# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199531 | 2020-02-01T21:36:51 Z | Markomafko972 | Cluedo (IOI10_cluedo) | C++14 | 23 ms | 380 KB |
#include "grader.h" #include "cluedo.h" #include<bits/stdc++.h> using namespace std; set<int> s[5]; void Solve (){ for (int i = 1; i <= 10; i++) { s[2].insert(i); if (i <= 6) { s[1].insert(i); s[3].insert(i); } } while (s[1].size() > 1 || s[2].size() > 1 || s[3].size() > 1) { int t = Theory(*s[1].begin(), *s[2].begin(), *s[3].begin()); if (t == 0) return; s[t].erase(s[t].begin()); } int t = Theory(*s[1].begin(), *s[2].begin(), *s[3].begin()); return; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 376 KB | Output is correct |
2 | Correct | 16 ms | 248 KB | Output is correct |
3 | Correct | 13 ms | 248 KB | Output is correct |
4 | Correct | 13 ms | 376 KB | Output is correct |
5 | Correct | 12 ms | 376 KB | Output is correct |
6 | Correct | 18 ms | 248 KB | Output is correct |
7 | Correct | 17 ms | 248 KB | Output is correct |
8 | Correct | 20 ms | 252 KB | Output is correct |
9 | Correct | 23 ms | 248 KB | Output is correct |
10 | Correct | 13 ms | 248 KB | Output is correct |
11 | Correct | 12 ms | 248 KB | Output is correct |
12 | Correct | 17 ms | 376 KB | Output is correct |
13 | Correct | 21 ms | 248 KB | Output is correct |
14 | Correct | 14 ms | 380 KB | Output is correct |
15 | Correct | 12 ms | 376 KB | Output is correct |
16 | Correct | 20 ms | 248 KB | Output is correct |
17 | Correct | 19 ms | 248 KB | Output is correct |
18 | Correct | 22 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 376 KB | Output is correct |
2 | Correct | 14 ms | 248 KB | Output is correct |
3 | Correct | 15 ms | 252 KB | Output is correct |
4 | Correct | 15 ms | 244 KB | Output is correct |
5 | Correct | 19 ms | 248 KB | Output is correct |
6 | Correct | 18 ms | 248 KB | Output is correct |
7 | Correct | 15 ms | 376 KB | Output is correct |
8 | Correct | 19 ms | 376 KB | Output is correct |
9 | Correct | 21 ms | 376 KB | Output is correct |
10 | Correct | 15 ms | 248 KB | Output is correct |
11 | Correct | 14 ms | 248 KB | Output is correct |
12 | Correct | 17 ms | 248 KB | Output is correct |
13 | Correct | 20 ms | 248 KB | Output is correct |
14 | Correct | 20 ms | 376 KB | Output is correct |
15 | Correct | 20 ms | 376 KB | Output is correct |
16 | Correct | 15 ms | 248 KB | Output is correct |
17 | Correct | 21 ms | 248 KB | Output is correct |
18 | Correct | 17 ms | 376 KB | Output is correct |