# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
705633 | mseebacher | Cluedo (IOI10_cluedo) | C++17 | 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 <bits/stdc++.h>
using namespace std;
void solve(){
set<int> s1,s2,s3;
for(int i = 1;i<=6;i++){
s1.insert(i);
s2.insert(i);
s3.insert(i);
}
s2.insert(7);
s2.insert(8);
s2.insert(9);
s2.insert(10);
int i = 0;
int erg = -1;
while(erg != 0){
erg = Theory(*s1.begin(),*s2.begin(),*s3.begin());
if(erg == 1) s1.erase(*s1.begin());
if(erg == 2) s2.erase(*s2.begin());
if(erg == 3) s3.erase(*s3.begin());
}
}