# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
512118 |
2022-01-16T06:48:20 Z |
600Mihnea |
Cluedo (IOI10_cluedo) |
C++17 |
|
15 ms |
288 KB |
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rng((long long) (new char));
void Solve() {
vector<vector<int>> a;
vector<int> p(3, 0);
a.push_back(vector<int> (6, 0));
a.push_back(vector<int> (10, 0));
a.push_back(vector<int> (6, 0));
for (auto &v : a) {
iota(v.begin(), v.end(), 1);
shuffle(v.begin(), v.end(), rng);
}
while (1) {
int r = Theory(a[0][p[0]], a[1][p[1]], a[2][p[2]]);
if (r == 0) {
return;
}
p[r - 1]++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
200 KB |
Output is correct |
2 |
Correct |
11 ms |
200 KB |
Output is correct |
3 |
Correct |
6 ms |
200 KB |
Output is correct |
4 |
Correct |
10 ms |
200 KB |
Output is correct |
5 |
Correct |
12 ms |
200 KB |
Output is correct |
6 |
Correct |
11 ms |
200 KB |
Output is correct |
7 |
Correct |
12 ms |
200 KB |
Output is correct |
8 |
Correct |
13 ms |
200 KB |
Output is correct |
9 |
Correct |
15 ms |
200 KB |
Output is correct |
10 |
Correct |
12 ms |
200 KB |
Output is correct |
11 |
Correct |
6 ms |
200 KB |
Output is correct |
12 |
Correct |
12 ms |
200 KB |
Output is correct |
13 |
Correct |
10 ms |
200 KB |
Output is correct |
14 |
Correct |
10 ms |
200 KB |
Output is correct |
15 |
Correct |
11 ms |
200 KB |
Output is correct |
16 |
Correct |
8 ms |
200 KB |
Output is correct |
17 |
Correct |
15 ms |
200 KB |
Output is correct |
18 |
Correct |
14 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
200 KB |
Output is correct |
2 |
Correct |
4 ms |
200 KB |
Output is correct |
3 |
Correct |
10 ms |
200 KB |
Output is correct |
4 |
Correct |
9 ms |
200 KB |
Output is correct |
5 |
Correct |
13 ms |
200 KB |
Output is correct |
6 |
Correct |
10 ms |
200 KB |
Output is correct |
7 |
Correct |
11 ms |
200 KB |
Output is correct |
8 |
Correct |
11 ms |
200 KB |
Output is correct |
9 |
Correct |
9 ms |
200 KB |
Output is correct |
10 |
Correct |
7 ms |
200 KB |
Output is correct |
11 |
Correct |
9 ms |
200 KB |
Output is correct |
12 |
Correct |
10 ms |
200 KB |
Output is correct |
13 |
Correct |
9 ms |
200 KB |
Output is correct |
14 |
Correct |
9 ms |
200 KB |
Output is correct |
15 |
Correct |
11 ms |
288 KB |
Output is correct |
16 |
Correct |
12 ms |
200 KB |
Output is correct |
17 |
Correct |
9 ms |
200 KB |
Output is correct |
18 |
Correct |
9 ms |
200 KB |
Output is correct |