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>
#include "grader.h"
#include "cluedo.h"
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void Solve() {
vector<vector<int>> pos = { {1,2,3,4,5,6},{1,2,3,4,5,6,7,8,9, 10}, {1,2,3,4,5,6} };
for (int i = 0;i < 3;++i)
shuffle(pos[i].begin(), pos[i].end(), rng);
for (int i = 1;i <= 3;++i)
while (pos[i - 1].size() > 1) {
int r = Theory(pos[0].back(), pos[1].back(), pos[2].back());
if (!r)
return;
pos[r - 1].pop_back();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |