Submission #702074

#TimeUsernameProblemLanguageResultExecution timeMemory
702074ld_minh4354Monster Game (JOI21_monster)C++17
10 / 100
190 ms300 KiB
#include<bits/stdc++.h> #include "monster.h" using namespace std; vector<int> Solve(int n) { int i,j,f[205],ans2[205]; vector<int> a[205],ans,ansf; for (i=0;i<n;i++) f[i]=0; for (i=0;i<n;i++) for (j=i+1;j<n;j++) if (Query(i,j)) f[i]++;else f[j]++; for (i=0;i<n;i++) a[f[i]].push_back(i); if (Query(a[1][0],a[1][1])) { ans.push_back(a[1][0]); ans.push_back(a[1][1]); } else { ans.push_back(a[1][1]); ans.push_back(a[1][0]); } for (i=2;i<n-2;i++) ans.push_back(a[i][0]); if (Query(a[n-2][0],a[n-2][1])) { ans.push_back(a[n-2][0]); ans.push_back(a[n-2][1]); } else { ans.push_back(a[n-2][1]); ans.push_back(a[n-2][0]); } for (i=0;i<n;i++) ans2[ans[i]]=i; for (i=0;i<n;i++) ansf.push_back(ans2[i]); return ansf; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...