Submission #1337630

#TimeUsernameProblemLanguageResultExecution timeMemory
1337630aaaaaaaaChameleon's Love (JOI20_chameleon)C++20
0 / 100
16 ms428 KiB
#include <bits/stdc++.h>
#include "chameleon.h"

using namespace std;

void Solve(int N) {
    vector<pair<int, int>> ans;
    vector<int> done(N * 2 + 10, 0);
    for(int i = 1; i <= 2 * N; ++i){
        for(int j = 1; j <= 2 * N; ++j){
            if(i ^ j && !done[i] && !done[j]){
                int x = Query({i, j});
                if(x == 1){
                    done[i] = done[j] = 1;
                    ans.push_back({i, j});
                }else{

                }
            }
        }
    }
    for(auto [x, y] : ans){
        Answer(x, y);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...