# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
871948 | 2023-11-12T03:42:26 Z | 12345678 | 도서관 (JOI18_library) | C++17 | 160 ms | 700 KB |
#include <cstdio> #include <bits/stdc++.h> #include "library.h" using namespace std; const int nx=1005; int s; vector<int> v[nx], res; void dfs(int u, int p) { res.push_back(u); for (auto x:v[u]) if (x!=p) dfs(x, u); } void Solve(int N) { vector<int> M(N); for (int i=0; i<N; i++) { for (int j=i+1; j<N; j++) { M[i]=M[j]=1; if (Query(M)==1) v[i+1].push_back(j+1), v[j+1].push_back(i+1); M[i]=M[j]=0; } } for (int i=1; i<=N; i++) if (v[i].size()==1) s=i; if (s==0) int x=1/0; dfs(s, s); Answer(res); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 140 ms | 696 KB | # of queries: 18336 |
2 | Correct | 127 ms | 692 KB | # of queries: 18145 |
3 | Correct | 156 ms | 696 KB | # of queries: 19900 |
4 | Correct | 155 ms | 700 KB | # of queries: 19900 |
5 | Correct | 148 ms | 460 KB | # of queries: 19900 |
6 | Correct | 160 ms | 700 KB | # of queries: 19900 |
7 | Correct | 147 ms | 448 KB | # of queries: 19900 |
8 | Correct | 142 ms | 440 KB | # of queries: 18528 |
9 | Correct | 140 ms | 444 KB | # of queries: 19701 |
10 | Correct | 66 ms | 456 KB | # of queries: 8256 |
11 | Incorrect | 0 ms | 344 KB | Wrong Answer [5] |
12 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 140 ms | 696 KB | # of queries: 18336 |
2 | Correct | 127 ms | 692 KB | # of queries: 18145 |
3 | Correct | 156 ms | 696 KB | # of queries: 19900 |
4 | Correct | 155 ms | 700 KB | # of queries: 19900 |
5 | Correct | 148 ms | 460 KB | # of queries: 19900 |
6 | Correct | 160 ms | 700 KB | # of queries: 19900 |
7 | Correct | 147 ms | 448 KB | # of queries: 19900 |
8 | Correct | 142 ms | 440 KB | # of queries: 18528 |
9 | Correct | 140 ms | 444 KB | # of queries: 19701 |
10 | Correct | 66 ms | 456 KB | # of queries: 8256 |
11 | Incorrect | 0 ms | 344 KB | Wrong Answer [5] |
12 | Halted | 0 ms | 0 KB | - |