# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
260331 | 2020-08-10T05:41:09 Z | 문홍윤(#5075) | 도서관 (JOI18_library) | C++17 | 2000 ms | 760 KB |
#include "library.h" #include <bits/stdc++.h> #define eb emplace_back using namespace std; vector<int> link[210], ret; void dfs(int num, int par){ ret.eb(num); for(auto i:link[num]){ if(i==par)continue; dfs(i, num); } } void Solve(int N){ vector<int> qu(N); for(int i=0; i<N; i++){ for(int j=0; j<i; j++){ qu[i]=qu[j]=1; int tmp=Query(qu); if(tmp==1){ link[i].eb(j); link[j].eb(i); } } } int rt; for(int i=0; i<N; i++){ if(link[i].size()==1)rt=i; } dfs(rt, -1); Answer(ret); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 297 ms | 368 KB | Wrong Answer [5] |
2 | Incorrect | 382 ms | 368 KB | Wrong Answer [5] |
3 | Incorrect | 245 ms | 376 KB | Wrong Answer [5] |
4 | Incorrect | 330 ms | 372 KB | Wrong Answer [5] |
5 | Incorrect | 298 ms | 368 KB | Wrong Answer [5] |
6 | Incorrect | 332 ms | 376 KB | Wrong Answer [5] |
7 | Incorrect | 300 ms | 368 KB | Wrong Answer [5] |
8 | Incorrect | 314 ms | 376 KB | Wrong Answer [5] |
9 | Incorrect | 335 ms | 368 KB | Wrong Answer [5] |
10 | Incorrect | 145 ms | 480 KB | Wrong Answer [5] |
11 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
12 | Incorrect | 1 ms | 256 KB | Wrong Answer [5] |
13 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
14 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
15 | Incorrect | 2 ms | 256 KB | Wrong Answer [5] |
16 | Incorrect | 7 ms | 256 KB | Wrong Answer [5] |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 297 ms | 368 KB | Wrong Answer [5] |
2 | Incorrect | 382 ms | 368 KB | Wrong Answer [5] |
3 | Incorrect | 245 ms | 376 KB | Wrong Answer [5] |
4 | Incorrect | 330 ms | 372 KB | Wrong Answer [5] |
5 | Incorrect | 298 ms | 368 KB | Wrong Answer [5] |
6 | Incorrect | 332 ms | 376 KB | Wrong Answer [5] |
7 | Incorrect | 300 ms | 368 KB | Wrong Answer [5] |
8 | Incorrect | 314 ms | 376 KB | Wrong Answer [5] |
9 | Incorrect | 335 ms | 368 KB | Wrong Answer [5] |
10 | Incorrect | 145 ms | 480 KB | Wrong Answer [5] |
11 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
12 | Incorrect | 1 ms | 256 KB | Wrong Answer [5] |
13 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
14 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
15 | Incorrect | 2 ms | 256 KB | Wrong Answer [5] |
16 | Incorrect | 7 ms | 256 KB | Wrong Answer [5] |
17 | Execution timed out | 3097 ms | 384 KB | Time limit exceeded |
18 | Execution timed out | 3074 ms | 256 KB | Time limit exceeded |
19 | Execution timed out | 3024 ms | 256 KB | Time limit exceeded |
20 | Execution timed out | 3012 ms | 256 KB | Time limit exceeded |
21 | Execution timed out | 3065 ms | 256 KB | Time limit exceeded |
22 | Execution timed out | 3014 ms | 256 KB | Time limit exceeded |
23 | Execution timed out | 3051 ms | 256 KB | Time limit exceeded |
24 | Runtime error | 1058 ms | 500 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
25 | Execution timed out | 3051 ms | 256 KB | Time limit exceeded |
26 | Execution timed out | 3098 ms | 384 KB | Time limit exceeded |
27 | Runtime error | 1014 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
28 | Execution timed out | 3037 ms | 628 KB | Time limit exceeded |
29 | Execution timed out | 3089 ms | 760 KB | Time limit exceeded |
30 | Execution timed out | 3021 ms | 680 KB | Time limit exceeded |