Peli

#include <bits/stdc++.h>

const int size = 2001;

bool lookup[size][size] = {};

void build_lookup() {
    for (int i = 0; i < size; i++) {
        for (int l = 0; l < size; l++) {
            bool res = false;
            if (i == l) {
                res = true;
            } else if (i == 0) {
                res = true;
            } else if (l == 0) {
                res = true;
            } else {
                for (int x = 0; x < i; x++) {
                    if (lookup[i - x - 1][l] == false) {
                        res = true;
                        break;
                    }
                }
                if (res == false) {
                    for (int y = 0; y < l; y++) {
                        if (lookup[i][l - y - 1] == false) {
                            res = true;
                            break;
                        }
                    }
                }
                if (res == false) {
                    for (int z = 1; z < std::min(i, l); z++) {
                        int x = i - z;
                        int y = l - z;
                        if (lookup[x][y] == false) {
                            res = true;
                            break;
                        }
                    }
                }
            }
            lookup[i][l] = res;
        }
    }
    std::cout << "ready\n";
}

bool test(int a, int b) {
    return lookup[a][b];
}

int main() {
    build_lookup();

    int tests;
    std::cin >> tests;

    for (int i = 0; i < tests; i++) {
        int a, b;
        std::cin >> a >> b;
        if (test(a, b)) {
            std::cout << "first";
        } else {
            std::cout << "second";
        }
    }

    return 0;
}

Test 1 (public)

Subtask: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 2

Subtask: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Subtask: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Subtask: 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Subtask: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Subtask: 3

Verdict: TIME LIMIT EXCEEDED