#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001;
void Solve(){
int r = -1;
int a = 1, b = 1, c = 1;
while (true) {
r = Theory(a, b, c);
if (r == 1) a++;
if (r == 2) b++;
if (r == 3) c++;
if (r == 0) return;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
200 KB |
Output is correct |
| 2 |
Correct |
11 ms |
200 KB |
Output is correct |
| 3 |
Correct |
8 ms |
200 KB |
Output is correct |
| 4 |
Correct |
14 ms |
200 KB |
Output is correct |
| 5 |
Correct |
14 ms |
200 KB |
Output is correct |
| 6 |
Correct |
8 ms |
200 KB |
Output is correct |
| 7 |
Correct |
11 ms |
200 KB |
Output is correct |
| 8 |
Correct |
13 ms |
200 KB |
Output is correct |
| 9 |
Correct |
15 ms |
200 KB |
Output is correct |
| 10 |
Correct |
11 ms |
200 KB |
Output is correct |
| 11 |
Correct |
8 ms |
200 KB |
Output is correct |
| 12 |
Correct |
13 ms |
200 KB |
Output is correct |
| 13 |
Correct |
12 ms |
200 KB |
Output is correct |
| 14 |
Correct |
9 ms |
200 KB |
Output is correct |
| 15 |
Correct |
14 ms |
200 KB |
Output is correct |
| 16 |
Correct |
13 ms |
200 KB |
Output is correct |
| 17 |
Correct |
10 ms |
200 KB |
Output is correct |
| 18 |
Correct |
14 ms |
200 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
200 KB |
Output is correct |
| 2 |
Correct |
15 ms |
200 KB |
Output is correct |
| 3 |
Correct |
14 ms |
200 KB |
Output is correct |
| 4 |
Correct |
11 ms |
200 KB |
Output is correct |
| 5 |
Correct |
9 ms |
200 KB |
Output is correct |
| 6 |
Correct |
14 ms |
200 KB |
Output is correct |
| 7 |
Correct |
13 ms |
200 KB |
Output is correct |
| 8 |
Correct |
5 ms |
200 KB |
Output is correct |
| 9 |
Correct |
14 ms |
200 KB |
Output is correct |
| 10 |
Correct |
14 ms |
200 KB |
Output is correct |
| 11 |
Correct |
16 ms |
200 KB |
Output is correct |
| 12 |
Correct |
9 ms |
200 KB |
Output is correct |
| 13 |
Correct |
9 ms |
200 KB |
Output is correct |
| 14 |
Correct |
15 ms |
200 KB |
Output is correct |
| 15 |
Correct |
13 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 |
13 ms |
200 KB |
Output is correct |
