Leikkijät

input/code.cpp: In function 'void solve()':
input/code.cpp:37:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for (int i = 0; i < order.size() - 1; i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
// chmod u+x b.sh
void solve(); int main() {
    ios_base::sync_with_stdio(0); cout.tie(0);
    solve();
}

void solve()
{
    map<pair<int, int>, int> ma;
    for (int k = 1; k < 2500; k++) {
        vector<int> order;
        set<int> s;
        for (int i = 1; i <= k; i++) s.insert(i);
        auto it = s.begin();
        bool even = false;
        while (s.size() > 0) {
            auto it2 = it;
            it2++;
            if (it2 == s.end()) {
                it2 = s.begin();
            }
            if (even) {
                //cout << *it << " ";
                order.push_back(*it);
                s.erase(it);
            }
            even = !even;
            it = it2;
        }
        //cout << endl;
        //cout << order[0] << " ";
        for (int i = 0; i < order.size() - 1; i++) {
            //cout << order[i + 1] << " ";
            if (!ma.contains({order[i], order[i + 1]}))
                ma.insert({{order[i], order[i + 1]}, k});
        }
        //cout << endl;
    }
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        int a, b;
        cin >> a >> b;

        if (a % 2 == 0 && a > 2) {
            //cout << "ans2\n";
            if (b == 3) {
                cout << a << "\n";
            }
            else if (b == 1) {
                cout << a + 1 << "\n";
            }
            else if (a + 2 == b) {
                cout << b << "\n";
            }
            else {
                cout << "-1\n";
            }
        }
        else if (b % 2 == 0 && a % 2 != 0 && b > 1) {
            cout << "-1\n";
        }
        else if (a < b && a > 1000 && abs(a - b) <= 4) {
            cout << max(a, b) << "\n";
        }
        else if (a < b && a > 1000 && abs(a - b) <= 8) {
            cout << max(a, b) + 1 << "\n";
        }


        else if (ma.contains({a, b}))
            cout << ma[{a, b}] << "\n";
        else
            cout << -1 << "\n";
    }
}

Test 1

Group: 1, 2, 5, 6

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 5, 6

Verdict: ACCEPTED

Test 3

Group: 1, 2, 5, 6

Verdict: ACCEPTED

Test 4

Group: 1, 2, 4, 5, 6

Verdict: ACCEPTED

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 3, 5, 6

Verdict: ACCEPTED

Test 7

Group: 2, 5, 6

Verdict: ACCEPTED

Test 8

Group: 2, 4, 5, 6

Verdict: ACCEPTED

Test 9

Group: 5, 6

Verdict: ACCEPTED

Test 10

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 1, 2, 5, 6

Verdict: ACCEPTED

Test 12

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3, 5, 6

Verdict: ACCEPTED

Test 14

Group: 3, 5, 6

Verdict: ACCEPTED

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

Test 16

Group: 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 5, 6

Verdict: WRONG ANSWER