# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964259 | 2024-04-16T13:48:15 Z | anango | Cluedo (IOI10_cluedo) | C++17 | 9 ms | 596 KB |
#include "grader.h" #include "cluedo.h" #include <bits/stdc++.h> using namespace std; void Solve(){ int r; int a=6; int b=10; int c=6; vector<int> ans; vector<int> maxes={6,10,6}; int n=3; vector<set<int>> poss(3); for (int i=0; i<n; i++) { for (int j=1; j<=maxes[i]; j++) { poss[i].insert(j); } } for (int q=0; q<20; q++) { int a=*poss[0].begin(); int b=*poss[1].begin(); int c=*poss[2].begin(); int r=Theory(a,b,c); if (r==0) { break; } if (r==1) { poss[0].erase(a); } if (r==2) { poss[1].erase(b); } if (r==3) { poss[2].erase(c); } } return; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 344 KB | Output is correct |
2 | Correct | 4 ms | 348 KB | Output is correct |
3 | Correct | 4 ms | 344 KB | Output is correct |
4 | Correct | 5 ms | 344 KB | Output is correct |
5 | Correct | 5 ms | 344 KB | Output is correct |
6 | Correct | 5 ms | 596 KB | Output is correct |
7 | Correct | 4 ms | 344 KB | Output is correct |
8 | Correct | 6 ms | 344 KB | Output is correct |
9 | Correct | 5 ms | 344 KB | Output is correct |
10 | Correct | 5 ms | 344 KB | Output is correct |
11 | Correct | 5 ms | 344 KB | Output is correct |
12 | Correct | 5 ms | 344 KB | Output is correct |
13 | Correct | 5 ms | 344 KB | Output is correct |
14 | Correct | 5 ms | 496 KB | Output is correct |
15 | Correct | 4 ms | 344 KB | Output is correct |
16 | Correct | 5 ms | 344 KB | Output is correct |
17 | Correct | 5 ms | 344 KB | Output is correct |
18 | Correct | 9 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 344 KB | Output is correct |
2 | Correct | 6 ms | 596 KB | Output is correct |
3 | Correct | 5 ms | 344 KB | Output is correct |
4 | Correct | 6 ms | 500 KB | Output is correct |
5 | Correct | 5 ms | 344 KB | Output is correct |
6 | Correct | 6 ms | 344 KB | Output is correct |
7 | Correct | 6 ms | 352 KB | Output is correct |
8 | Correct | 5 ms | 344 KB | Output is correct |
9 | Correct | 7 ms | 344 KB | Output is correct |
10 | Correct | 6 ms | 344 KB | Output is correct |
11 | Correct | 5 ms | 344 KB | Output is correct |
12 | Correct | 5 ms | 344 KB | Output is correct |
13 | Correct | 6 ms | 344 KB | Output is correct |
14 | Correct | 5 ms | 344 KB | Output is correct |
15 | Correct | 6 ms | 344 KB | Output is correct |
16 | Correct | 5 ms | 344 KB | Output is correct |
17 | Correct | 5 ms | 344 KB | Output is correct |
18 | Correct | 5 ms | 344 KB | Output is correct |