# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866048 | ElenaBM | 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;
vector<int>a, b, c;
vector<int>ans(3);
vector<int> Solve (){
a.clear();
b.clear();
c.clear();
for (int i = 1; i <= 6; ++i){
a.push_back(i);
c.push_back(i);
}
for (int i = 1; i <= 10; ++i)b.push_back(i);
int x = Theory (a[(int)a.size() - 1], b[(int)b.size()-1], c[(int)c.size()-1)]);
while (x != 0){
if (x == 1) a.pop_back();
if (x== 2) b.pop_back();
else c.pop_back();
x = Theory (a[(int)a.size() - 1], b[(int)b.size()-1], c[(int)c.size()-1)]);
}
ans[0] = a[(int)a.size() - 1];
ans[1] = b[(int)b.size()-1];
ans[2] = c[(int)c.size()-1)];
return ans;
}
int main()
{
return 0;
}