Submission #1300793

#TimeUsernameProblemLanguageResultExecution timeMemory
1300793cansu_mutluChameleon's Love (JOI20_chameleon)C++20
0 / 100
1 ms332 KiB
#include "chameleon.h" #include <bits/stdc++.h> using namespace std; int n; void Solve(int N) { n = N; vector<array<int,2>> ans; vector<int> var(2*n+1,0); for(int i=1;i<=2*n;i++) { for(int j=i+1;j<=2*n;j++) { if(var[i]==0 && var[j]==0) { vector<int> p = {i,j}; int num = Query(p); if(num==1) { var[i] = 1 , var[j] = 1; ans.push_back({i,j}); } } } for(auto x:ans) { Answer(x[0],x[1]); } } }
#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...