# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199530 | Markomafko972 | Cluedo (IOI10_cluedo) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}