| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 260333 | 2020-08-10T05:46:48 Z | 문홍윤(#5075) | 도서관 (JOI18_library) | C++17 | 2000 ms | 636 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+1].eb(j+1);
link[j+1].eb(i+1);
}
qu[i]=qu[j]=0;
}
}
int rt;
for(int i=1; i<=N; i++){
if(link[i].size()==1)rt=i;
}
dfs(rt, -1);
Answer(ret);
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 293 ms | 376 KB | # of queries: 18336 |
| 2 | Correct | 246 ms | 508 KB | # of queries: 18145 |
| 3 | Correct | 306 ms | 500 KB | # of queries: 19900 |
| 4 | Correct | 315 ms | 504 KB | # of queries: 19900 |
| 5 | Correct | 349 ms | 368 KB | # of queries: 19900 |
| 6 | Correct | 344 ms | 376 KB | # of queries: 19900 |
| 7 | Correct | 272 ms | 636 KB | # of queries: 19900 |
| 8 | Correct | 281 ms | 372 KB | # of queries: 18528 |
| 9 | Correct | 211 ms | 496 KB | # of queries: 19701 |
| 10 | Correct | 149 ms | 376 KB | # of queries: 8256 |
| 11 | Incorrect | 0 ms | 256 KB | Wrong Answer [5] |
| 12 | Correct | 0 ms | 256 KB | # of queries: 1 |
| 13 | Correct | 1 ms | 256 KB | # of queries: 3 |
| 14 | Correct | 0 ms | 256 KB | # of queries: 6 |
| 15 | Correct | 2 ms | 256 KB | # of queries: 105 |
| 16 | Correct | 6 ms | 256 KB | # of queries: 351 |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 293 ms | 376 KB | # of queries: 18336 |
| 2 | Correct | 246 ms | 508 KB | # of queries: 18145 |
| 3 | Correct | 306 ms | 500 KB | # of queries: 19900 |
| 4 | Correct | 315 ms | 504 KB | # of queries: 19900 |
| 5 | Correct | 349 ms | 368 KB | # of queries: 19900 |
| 6 | Correct | 344 ms | 376 KB | # of queries: 19900 |
| 7 | Correct | 272 ms | 636 KB | # of queries: 19900 |
| 8 | Correct | 281 ms | 372 KB | # of queries: 18528 |
| 9 | Correct | 211 ms | 496 KB | # of queries: 19701 |
| 10 | Correct | 149 ms | 376 KB | # of queries: 8256 |
| 11 | Incorrect | 0 ms | 256 KB | Wrong Answer [5] |
| 12 | Correct | 0 ms | 256 KB | # of queries: 1 |
| 13 | Correct | 1 ms | 256 KB | # of queries: 3 |
| 14 | Correct | 0 ms | 256 KB | # of queries: 6 |
| 15 | Correct | 2 ms | 256 KB | # of queries: 105 |
| 16 | Correct | 6 ms | 256 KB | # of queries: 351 |
| 17 | Execution timed out | 3016 ms | 380 KB | Time limit exceeded |
| 18 | Execution timed out | 3076 ms | 376 KB | Time limit exceeded |
| 19 | Execution timed out | 3059 ms | 376 KB | Time limit exceeded |
| 20 | Execution timed out | 3026 ms | 376 KB | Time limit exceeded |
| 21 | Execution timed out | 3011 ms | 376 KB | Time limit exceeded |
| 22 | Execution timed out | 3075 ms | 376 KB | Time limit exceeded |
| 23 | Execution timed out | 3009 ms | 376 KB | Time limit exceeded |
| 24 | Runtime error | 1099 ms | 628 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 25 | Execution timed out | 3098 ms | 376 KB | Time limit exceeded |
| 26 | Execution timed out | 3078 ms | 256 KB | Time limit exceeded |
| 27 | Runtime error | 1079 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 28 | Execution timed out | 3098 ms | 376 KB | Time limit exceeded |
| 29 | Execution timed out | 3097 ms | 504 KB | Time limit exceeded |
| 30 | Execution timed out | 3013 ms | 376 KB | Time limit exceeded |