# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116770 | 2019-06-13T19:45:23 Z | ioilolcom | Carnival (CEOI14_carnival) | C++14 | 13 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; #define endl "\n" typedef long long int ll; const int N=125; int P[N],an[N]; int cnt; int query(int e,int a){ if(a<=e) { cout<<e<<" "; for(int i=1; i<=e; i++) { cout<<i<<" "; } cout<<endl; fflush(stdout); } else{ cout<<e+1<<" "; for(int i=1; i<=e; i++) { cout<<i<<" "; } cout<<a<<endl; fflush(stdout); } int cur; cin>>cur; return cur; } int main() { int n; cin>>n; for(int i=1; i<=n; i++) { P[i]=query(i,0); } for(int i=1; i<=n; i++) { int l=1; int r=i; int ans=i; while(l<r) { int mid=(l+r)/2; if(P[mid]==query(mid,i)) { r=mid; } else{ l=mid+1; } } if(l!=i) { an[i]=an[l]; } else{ an[i]=++cnt; } } cout<<0<<" "; for(int i=1; i<=n; i++) { cout<<an[i]<<" "; } cout<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 256 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 13 ms | 384 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 384 KB | Output is correct |
2 | Incorrect | 9 ms | 256 KB | Incorrect |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 256 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 256 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |