#include<bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N = 1e5 + 10;
void Solve(){
int x, y, z;
x = y = z = 1;
for (int i = 1; i <= 20; ++i)
{
int r = Theory(x,y,z);
if (r == 0) return;
if (r == 1) x++;
if (r == 2) y++;
if (r == 3) z++;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
200 KB |
Output is correct |
2 |
Correct |
10 ms |
200 KB |
Output is correct |
3 |
Correct |
5 ms |
200 KB |
Output is correct |
4 |
Correct |
9 ms |
200 KB |
Output is correct |
5 |
Correct |
14 ms |
200 KB |
Output is correct |
6 |
Correct |
11 ms |
200 KB |
Output is correct |
7 |
Correct |
12 ms |
200 KB |
Output is correct |
8 |
Correct |
9 ms |
200 KB |
Output is correct |
9 |
Correct |
16 ms |
200 KB |
Output is correct |
10 |
Correct |
14 ms |
200 KB |
Output is correct |
11 |
Correct |
14 ms |
200 KB |
Output is correct |
12 |
Correct |
17 ms |
200 KB |
Output is correct |
13 |
Correct |
12 ms |
200 KB |
Output is correct |
14 |
Correct |
15 ms |
200 KB |
Output is correct |
15 |
Correct |
10 ms |
200 KB |
Output is correct |
16 |
Correct |
9 ms |
200 KB |
Output is correct |
17 |
Correct |
12 ms |
200 KB |
Output is correct |
18 |
Correct |
9 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
200 KB |
Output is correct |
2 |
Correct |
14 ms |
200 KB |
Output is correct |
3 |
Correct |
10 ms |
200 KB |
Output is correct |
4 |
Correct |
15 ms |
200 KB |
Output is correct |
5 |
Correct |
18 ms |
200 KB |
Output is correct |
6 |
Correct |
11 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 |
14 ms |
200 KB |
Output is correct |
10 |
Correct |
13 ms |
200 KB |
Output is correct |
11 |
Correct |
11 ms |
200 KB |
Output is correct |
12 |
Correct |
13 ms |
200 KB |
Output is correct |
13 |
Correct |
16 ms |
200 KB |
Output is correct |
14 |
Correct |
10 ms |
200 KB |
Output is correct |
15 |
Correct |
9 ms |
200 KB |
Output is correct |
16 |
Correct |
8 ms |
200 KB |
Output is correct |
17 |
Correct |
11 ms |
200 KB |
Output is correct |
18 |
Correct |
14 ms |
200 KB |
Output is correct |