Submission #995170

#TimeUsernameProblemLanguageResultExecution timeMemory
99517012345678Chameleon's Love (JOI20_chameleon)C++17
40 / 100
15 ms528 KiB
#include "chameleon.h" #include <bits/stdc++.h> using namespace std; const int nx=1e3+5; int vs[nx]; vector<int> d[nx]; set<int> s[nx]; void Solve(int N) { for (int i=1; i<=2*N; i++) for (int j=1; j<i; j++) if (Query(vector<int> {i, j})==1) d[i].push_back(j), d[j].push_back(i); for (int i=1; i<=2*N; i++) { if (vs[i]) continue; if (d[i].size()==1) { Answer(i, d[i][0]); vs[i]=vs[d[i][0]]=1; continue; } for (auto x:d[i]) { for (auto y:d[x]) { if (y!=i&&Query(vector<int> {i, x, y})==1) s[i].insert(x); } } } for (int i=1; i<=2*N; i++) { if (vs[i]) continue; for (auto x:s[i]) if (s[x].find(i)!=s[x].end()) vs[i]=vs[x]=1, Answer(i, x); } }
#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...