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>
// author : aykhn
using namespace std;
typedef long long ll;
#define pb push_back
#define ins insert
#define mpr make_pair
#define all(v) v.begin(), v.end()
#define bpc __builtin_popcount
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define infll 0x3F3F3F3F3F3F3F3F
#define inf 0x3F3F3F3F
void Solve(){
srand(time(0));
vector<int> v[3];
for (int i = 1; i <= 10; i++)
{
if (i <= 6) v[0].pb(i), v[1].pb(i), v[2].pb(i);
else v[1].pb(i);
}
random_shuffle(all(v[0]));
random_shuffle(all(v[1]));
random_shuffle(all(v[2]));
int i, j, k;
i = j = k = 0;
int x = Theory(v[0][i], v[1][j], v[2][k]);
while (x)
{
if (x == 1) i++;
else if (x == 2) j++;
else k++;
x = Theory(v[0][i], v[1][j], v[2][k]);
}
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |