/*
ID: varunra2
LANG: C++
TASK: cluedo
*/
#include<bits/stdc++.h>
#include "cluedo.h"
#include "grader.h"
using namespace std;
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
// int Theory(int a, int b, int c) {
// return 0;
// }
void Solve() {
VI vals(3, 1);
while(true) {
int x = Theory(vals[0], vals[1], vals[2]);
if(x == 0) return;
x--;
vals[x]++;
}
}
// int main() {
// #ifndef ONLINE_JUDGE
// freopen("cluedo.in", "r", stdin);
// freopen("cluedo.out", "w", stdout);
// #endif
// cin.sync_with_stdio(0); cin.tie(0);
// return 0;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
256 KB |
Output is correct |
| 2 |
Correct |
9 ms |
256 KB |
Output is correct |
| 3 |
Correct |
8 ms |
256 KB |
Output is correct |
| 4 |
Correct |
9 ms |
256 KB |
Output is correct |
| 5 |
Correct |
12 ms |
256 KB |
Output is correct |
| 6 |
Correct |
10 ms |
256 KB |
Output is correct |
| 7 |
Correct |
9 ms |
256 KB |
Output is correct |
| 8 |
Correct |
8 ms |
256 KB |
Output is correct |
| 9 |
Correct |
10 ms |
256 KB |
Output is correct |
| 10 |
Correct |
9 ms |
256 KB |
Output is correct |
| 11 |
Correct |
8 ms |
256 KB |
Output is correct |
| 12 |
Correct |
10 ms |
256 KB |
Output is correct |
| 13 |
Correct |
10 ms |
256 KB |
Output is correct |
| 14 |
Correct |
12 ms |
256 KB |
Output is correct |
| 15 |
Correct |
9 ms |
256 KB |
Output is correct |
| 16 |
Correct |
9 ms |
256 KB |
Output is correct |
| 17 |
Correct |
9 ms |
256 KB |
Output is correct |
| 18 |
Correct |
10 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
256 KB |
Output is correct |
| 2 |
Correct |
10 ms |
256 KB |
Output is correct |
| 3 |
Correct |
7 ms |
384 KB |
Output is correct |
| 4 |
Correct |
9 ms |
256 KB |
Output is correct |
| 5 |
Correct |
12 ms |
256 KB |
Output is correct |
| 6 |
Correct |
11 ms |
256 KB |
Output is correct |
| 7 |
Correct |
9 ms |
308 KB |
Output is correct |
| 8 |
Correct |
10 ms |
256 KB |
Output is correct |
| 9 |
Correct |
12 ms |
256 KB |
Output is correct |
| 10 |
Correct |
10 ms |
256 KB |
Output is correct |
| 11 |
Correct |
10 ms |
256 KB |
Output is correct |
| 12 |
Correct |
8 ms |
256 KB |
Output is correct |
| 13 |
Correct |
12 ms |
256 KB |
Output is correct |
| 14 |
Correct |
10 ms |
256 KB |
Output is correct |
| 15 |
Correct |
10 ms |
256 KB |
Output is correct |
| 16 |
Correct |
11 ms |
256 KB |
Output is correct |
| 17 |
Correct |
11 ms |
256 KB |
Output is correct |
| 18 |
Correct |
10 ms |
256 KB |
Output is correct |
