#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define v vector
typedef long long ll;
typedef pair<int, int > pii;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void Solve(){
int arr[4] = {-1,1,1,1};
while(1){
int res = Theory(arr[1], arr[2], arr[3]);
if(res == 0) return;
arr[res]++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
376 KB |
Output is correct |
2 |
Correct |
14 ms |
248 KB |
Output is correct |
3 |
Correct |
14 ms |
248 KB |
Output is correct |
4 |
Correct |
15 ms |
376 KB |
Output is correct |
5 |
Correct |
14 ms |
376 KB |
Output is correct |
6 |
Correct |
14 ms |
248 KB |
Output is correct |
7 |
Correct |
12 ms |
376 KB |
Output is correct |
8 |
Correct |
17 ms |
376 KB |
Output is correct |
9 |
Correct |
18 ms |
376 KB |
Output is correct |
10 |
Correct |
12 ms |
248 KB |
Output is correct |
11 |
Correct |
13 ms |
248 KB |
Output is correct |
12 |
Correct |
9 ms |
248 KB |
Output is correct |
13 |
Correct |
15 ms |
248 KB |
Output is correct |
14 |
Correct |
14 ms |
248 KB |
Output is correct |
15 |
Correct |
14 ms |
376 KB |
Output is correct |
16 |
Correct |
15 ms |
248 KB |
Output is correct |
17 |
Correct |
13 ms |
248 KB |
Output is correct |
18 |
Correct |
13 ms |
248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
376 KB |
Output is correct |
2 |
Correct |
13 ms |
248 KB |
Output is correct |
3 |
Correct |
14 ms |
248 KB |
Output is correct |
4 |
Correct |
17 ms |
376 KB |
Output is correct |
5 |
Correct |
16 ms |
248 KB |
Output is correct |
6 |
Correct |
13 ms |
248 KB |
Output is correct |
7 |
Correct |
14 ms |
376 KB |
Output is correct |
8 |
Correct |
14 ms |
248 KB |
Output is correct |
9 |
Correct |
17 ms |
248 KB |
Output is correct |
10 |
Correct |
14 ms |
248 KB |
Output is correct |
11 |
Correct |
14 ms |
248 KB |
Output is correct |
12 |
Correct |
14 ms |
380 KB |
Output is correct |
13 |
Correct |
14 ms |
248 KB |
Output is correct |
14 |
Correct |
15 ms |
248 KB |
Output is correct |
15 |
Correct |
15 ms |
376 KB |
Output is correct |
16 |
Correct |
9 ms |
248 KB |
Output is correct |
17 |
Correct |
18 ms |
376 KB |
Output is correct |
18 |
Correct |
14 ms |
376 KB |
Output is correct |