# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260443 | 2020-08-10T09:17:43 Z | songc | Library (JOI18_library) | C++14 | 49 ms | 376 KB |
#include <cstdio> #include <vector> #include "library.h" using namespace std; int N; int R[1010]; vector<int> ans, Q; void Solve(int n){ N = n; if (N==1){ ans.push_back(1); Answer(ans); } Q.resize(N); for (int i=0; i<N; i++) R[i] = i; for (int i=0; i<N; i++){ for (int j=0; j<N; j++) Q[j] = (i==j)?0:1; if (Query(Q) == 1){ ans.push_back(i); for (int j=i; j<N; j++) swap(R[j], R[j+1]); break; } } for (int i=N-2; i>0; i--){ int l=0, h=i, k; while (l<=h){ int m=l+h>>1; for (int j=0; j<N; j++) Q[j] = 0; for (int j=0; j<=m; j++) Q[R[j]] = 1; int x = Query(Q); Q[ans.back()] = 1; int y = Query(Q); if (x == y) k=m, h=m-1; else l=m+1; } ans.push_back(R[k]); for (int j=k; j<i; j++) swap(R[j], R[j+1]); } ans.push_back(R[0]); for (int &x : ans) x++; Answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 40 ms | 256 KB | # of queries: 2399 |
2 | Correct | 44 ms | 256 KB | # of queries: 2435 |
3 | Correct | 49 ms | 256 KB | # of queries: 2656 |
4 | Correct | 46 ms | 256 KB | # of queries: 2595 |
5 | Correct | 43 ms | 256 KB | # of queries: 2524 |
6 | Correct | 49 ms | 256 KB | # of queries: 2563 |
7 | Correct | 39 ms | 372 KB | # of queries: 2554 |
8 | Correct | 37 ms | 256 KB | # of queries: 2422 |
9 | Correct | 44 ms | 376 KB | # of queries: 2548 |
10 | Correct | 20 ms | 256 KB | # of queries: 1486 |
11 | Incorrect | 0 ms | 256 KB | Wrong Answer [2] |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 40 ms | 256 KB | # of queries: 2399 |
2 | Correct | 44 ms | 256 KB | # of queries: 2435 |
3 | Correct | 49 ms | 256 KB | # of queries: 2656 |
4 | Correct | 46 ms | 256 KB | # of queries: 2595 |
5 | Correct | 43 ms | 256 KB | # of queries: 2524 |
6 | Correct | 49 ms | 256 KB | # of queries: 2563 |
7 | Correct | 39 ms | 372 KB | # of queries: 2554 |
8 | Correct | 37 ms | 256 KB | # of queries: 2422 |
9 | Correct | 44 ms | 376 KB | # of queries: 2548 |
10 | Correct | 20 ms | 256 KB | # of queries: 1486 |
11 | Incorrect | 0 ms | 256 KB | Wrong Answer [2] |
12 | Halted | 0 ms | 0 KB | - |