Submission #972081

#TimeUsernameProblemLanguageResultExecution timeMemory
97208112345678Chameleon's Love (JOI20_chameleon)C++17
0 / 100
16 ms596 KiB
#include "chameleon.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e4+5;

int vs[nx];

void Solve(int N) {
    for (int i=1; i<=2*N; i++)
    {   
        if (vs[i]) continue;
        for (int j=i+1; j<=2*N; j++) if (Query(vector<int> {i, j})==1) vs[i]=vs[j]=1, Answer(i, j);
    }
}
#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...