# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
232346 | 2020-05-16T19:32:11 Z | crossing0ver | Cluedo (IOI10_cluedo) | C++17 | 18 ms | 384 KB |
#include<bits/stdc++.h> #include "grader.h" #include "cluedo.h" using namespace std; void Solve(){ int r; set<int> s[4]; for (int i = 1; i <= 6; i++) s[1].insert(i), s[3].insert(i); for (int i = 1; i <= 10; i++) s[2].insert(i); while(true) { r = Theory ( *s[1].begin() , *s[2].begin(), *s[3].begin()); if (!r) return; s[r].erase(s[r].begin()); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 256 KB | Output is correct |
2 | Correct | 16 ms | 256 KB | Output is correct |
3 | Correct | 17 ms | 256 KB | Output is correct |
4 | Correct | 12 ms | 256 KB | Output is correct |
5 | Correct | 16 ms | 384 KB | Output is correct |
6 | Correct | 17 ms | 384 KB | Output is correct |
7 | Correct | 14 ms | 256 KB | Output is correct |
8 | Correct | 12 ms | 256 KB | Output is correct |
9 | Correct | 18 ms | 384 KB | Output is correct |
10 | Correct | 15 ms | 256 KB | Output is correct |
11 | Correct | 17 ms | 384 KB | Output is correct |
12 | Correct | 16 ms | 256 KB | Output is correct |
13 | Correct | 13 ms | 256 KB | Output is correct |
14 | Correct | 12 ms | 384 KB | Output is correct |
15 | Correct | 13 ms | 256 KB | Output is correct |
16 | Correct | 17 ms | 256 KB | Output is correct |
17 | Correct | 9 ms | 256 KB | Output is correct |
18 | Correct | 15 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 256 KB | Output is correct |
2 | Correct | 17 ms | 256 KB | Output is correct |
3 | Correct | 16 ms | 256 KB | Output is correct |
4 | Correct | 12 ms | 256 KB | Output is correct |
5 | Correct | 17 ms | 256 KB | Output is correct |
6 | Correct | 10 ms | 256 KB | Output is correct |
7 | Correct | 14 ms | 256 KB | Output is correct |
8 | Correct | 13 ms | 256 KB | Output is correct |
9 | Correct | 17 ms | 256 KB | Output is correct |
10 | Correct | 15 ms | 256 KB | Output is correct |
11 | Correct | 13 ms | 384 KB | Output is correct |
12 | Correct | 16 ms | 384 KB | Output is correct |
13 | Correct | 12 ms | 256 KB | Output is correct |
14 | Correct | 14 ms | 256 KB | Output is correct |
15 | Correct | 13 ms | 384 KB | Output is correct |
16 | Correct | 14 ms | 256 KB | Output is correct |
17 | Correct | 12 ms | 384 KB | Output is correct |
18 | Correct | 13 ms | 256 KB | Output is correct |