#include "bits/stdc++.h"
#include "grader.h"
#include "cluedo.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using ll = long long;
const int mod = 1e9+7;
void Solve() {
array<int, 3> a = {1, 1, 1};
while (true) {
int x = Theory(a[0], a[1], a[2]);
if (x == 0) return;
a[x-1]++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
364 KB |
Output is correct |
2 |
Correct |
8 ms |
364 KB |
Output is correct |
3 |
Correct |
10 ms |
364 KB |
Output is correct |
4 |
Correct |
8 ms |
364 KB |
Output is correct |
5 |
Correct |
10 ms |
364 KB |
Output is correct |
6 |
Correct |
7 ms |
364 KB |
Output is correct |
7 |
Correct |
13 ms |
364 KB |
Output is correct |
8 |
Correct |
8 ms |
364 KB |
Output is correct |
9 |
Correct |
15 ms |
364 KB |
Output is correct |
10 |
Correct |
13 ms |
364 KB |
Output is correct |
11 |
Correct |
11 ms |
364 KB |
Output is correct |
12 |
Correct |
9 ms |
364 KB |
Output is correct |
13 |
Correct |
13 ms |
364 KB |
Output is correct |
14 |
Correct |
13 ms |
364 KB |
Output is correct |
15 |
Correct |
10 ms |
364 KB |
Output is correct |
16 |
Correct |
14 ms |
364 KB |
Output is correct |
17 |
Correct |
14 ms |
364 KB |
Output is correct |
18 |
Correct |
11 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
364 KB |
Output is correct |
2 |
Correct |
10 ms |
364 KB |
Output is correct |
3 |
Correct |
10 ms |
364 KB |
Output is correct |
4 |
Correct |
9 ms |
364 KB |
Output is correct |
5 |
Correct |
8 ms |
364 KB |
Output is correct |
6 |
Correct |
14 ms |
384 KB |
Output is correct |
7 |
Correct |
9 ms |
364 KB |
Output is correct |
8 |
Correct |
6 ms |
364 KB |
Output is correct |
9 |
Correct |
10 ms |
364 KB |
Output is correct |
10 |
Correct |
10 ms |
364 KB |
Output is correct |
11 |
Correct |
9 ms |
364 KB |
Output is correct |
12 |
Correct |
10 ms |
364 KB |
Output is correct |
13 |
Correct |
10 ms |
364 KB |
Output is correct |
14 |
Correct |
10 ms |
364 KB |
Output is correct |
15 |
Correct |
10 ms |
364 KB |
Output is correct |
16 |
Correct |
10 ms |
364 KB |
Output is correct |
17 |
Correct |
10 ms |
364 KB |
Output is correct |
18 |
Correct |
10 ms |
364 KB |
Output is correct |