# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315094 | 2020-10-22T02:27:05 Z | thtsshz_bgwrswh | Mouse (info1cup19_mouse) | C++17 | 0 ms | 256 KB |
#pragma GCC optimize("Ofast") #include "grader.h" #include<stdio.h> #include<algorithm> using namespace std; int num[260]; vector<int> temp,temp2; int Q(int n,int id,int j){ int i,a,b; for(i=1;i<=n;i++) if(i!=j) a=i; for(i=1;i<=n;i++) if(i!=j&&i!=a) b=i; for(i=1;i<=n;i++){ temp[i]=a; temp2[i]=b; } temp[id]=temp2[id]=j; return query(temp)&&query(temp2); } void solve(int n){ int i,j; temp.resize(n+1); temp2.reserve(n+1); for(i=1;i<=n;i++) for(j=1;j<=n;j++){ if(Q(n,i,j)){ num[i]=j; break; } } vector<int> ans(n+1); for(i=1;i<=n;i++) ans[i]=num[i]; query(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 KB | Integer 0 violates the range [1, 7] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 KB | Integer 0 violates the range [1, 7] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 KB | Integer 0 violates the range [1, 7] |
2 | Halted | 0 ms | 0 KB | - |