#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void Solve(){
vi pos[4];
RE1(i,6 ) pos[1].pb(i);
RE1(i,10) pos[2].pb(i);
RE1(i,6 ) pos[3].pb(i);
while(true) {
int res = Theory(pos[1].back(), pos[2].back(), pos[3].back());
if(res == 0) return;
pos[res].pop_back();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
200 KB |
Output is correct |
| 2 |
Correct |
14 ms |
200 KB |
Output is correct |
| 3 |
Correct |
8 ms |
200 KB |
Output is correct |
| 4 |
Correct |
15 ms |
200 KB |
Output is correct |
| 5 |
Correct |
9 ms |
200 KB |
Output is correct |
| 6 |
Correct |
11 ms |
200 KB |
Output is correct |
| 7 |
Correct |
14 ms |
200 KB |
Output is correct |
| 8 |
Correct |
10 ms |
200 KB |
Output is correct |
| 9 |
Correct |
13 ms |
200 KB |
Output is correct |
| 10 |
Correct |
9 ms |
200 KB |
Output is correct |
| 11 |
Correct |
5 ms |
328 KB |
Output is correct |
| 12 |
Correct |
11 ms |
200 KB |
Output is correct |
| 13 |
Correct |
9 ms |
200 KB |
Output is correct |
| 14 |
Correct |
14 ms |
256 KB |
Output is correct |
| 15 |
Correct |
13 ms |
200 KB |
Output is correct |
| 16 |
Correct |
13 ms |
256 KB |
Output is correct |
| 17 |
Correct |
13 ms |
200 KB |
Output is correct |
| 18 |
Correct |
13 ms |
200 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
200 KB |
Output is correct |
| 2 |
Correct |
13 ms |
200 KB |
Output is correct |
| 3 |
Correct |
10 ms |
200 KB |
Output is correct |
| 4 |
Correct |
9 ms |
268 KB |
Output is correct |
| 5 |
Correct |
13 ms |
292 KB |
Output is correct |
| 6 |
Correct |
5 ms |
288 KB |
Output is correct |
| 7 |
Correct |
11 ms |
200 KB |
Output is correct |
| 8 |
Correct |
10 ms |
200 KB |
Output is correct |
| 9 |
Correct |
9 ms |
200 KB |
Output is correct |
| 10 |
Correct |
14 ms |
200 KB |
Output is correct |
| 11 |
Correct |
9 ms |
200 KB |
Output is correct |
| 12 |
Correct |
12 ms |
200 KB |
Output is correct |
| 13 |
Correct |
14 ms |
200 KB |
Output is correct |
| 14 |
Correct |
8 ms |
252 KB |
Output is correct |
| 15 |
Correct |
12 ms |
200 KB |
Output is correct |
| 16 |
Correct |
13 ms |
200 KB |
Output is correct |
| 17 |
Correct |
13 ms |
200 KB |
Output is correct |
| 18 |
Correct |
14 ms |
200 KB |
Output is correct |
