| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 210270 |
2020-03-17T00:59:29 Z |
SorahISA |
Cluedo (IOI10_cluedo) |
C++17 |
|
19 ms |
376 KB |
#include "grader.h"
#include "cluedo.h"
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define Y second
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(0, 1); \
auto rnd = bind(__dis, __gen);
const int INF = 1E18;
const int mod = 1E9 + 7;
void Solve() {
int res, a[4] = {0, 1, 1, 1};
while (res = Theory(a[1], a[2], a[3])) ++a[res];
}
/*
int32_t main() {
fastIO();
return 0;
}*/
Compilation message
cluedo.cpp: In function 'void Solve()':
cluedo.cpp:36:16: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
while (res = Theory(a[1], a[2], a[3])) ++a[res];
~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
248 KB |
Output is correct |
| 2 |
Correct |
17 ms |
248 KB |
Output is correct |
| 3 |
Correct |
14 ms |
248 KB |
Output is correct |
| 4 |
Correct |
14 ms |
248 KB |
Output is correct |
| 5 |
Correct |
15 ms |
252 KB |
Output is correct |
| 6 |
Correct |
14 ms |
376 KB |
Output is correct |
| 7 |
Correct |
14 ms |
376 KB |
Output is correct |
| 8 |
Correct |
13 ms |
376 KB |
Output is correct |
| 9 |
Correct |
15 ms |
248 KB |
Output is correct |
| 10 |
Correct |
14 ms |
248 KB |
Output is correct |
| 11 |
Correct |
13 ms |
248 KB |
Output is correct |
| 12 |
Correct |
14 ms |
376 KB |
Output is correct |
| 13 |
Correct |
14 ms |
376 KB |
Output is correct |
| 14 |
Correct |
14 ms |
248 KB |
Output is correct |
| 15 |
Correct |
16 ms |
248 KB |
Output is correct |
| 16 |
Correct |
14 ms |
248 KB |
Output is correct |
| 17 |
Correct |
16 ms |
248 KB |
Output is correct |
| 18 |
Correct |
14 ms |
248 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
248 KB |
Output is correct |
| 2 |
Correct |
13 ms |
376 KB |
Output is correct |
| 3 |
Correct |
12 ms |
248 KB |
Output is correct |
| 4 |
Correct |
14 ms |
248 KB |
Output is correct |
| 5 |
Correct |
17 ms |
248 KB |
Output is correct |
| 6 |
Correct |
19 ms |
248 KB |
Output is correct |
| 7 |
Correct |
11 ms |
376 KB |
Output is correct |
| 8 |
Correct |
14 ms |
376 KB |
Output is correct |
| 9 |
Correct |
15 ms |
248 KB |
Output is correct |
| 10 |
Correct |
14 ms |
248 KB |
Output is correct |
| 11 |
Correct |
17 ms |
376 KB |
Output is correct |
| 12 |
Correct |
13 ms |
248 KB |
Output is correct |
| 13 |
Correct |
14 ms |
248 KB |
Output is correct |
| 14 |
Correct |
15 ms |
248 KB |
Output is correct |
| 15 |
Correct |
14 ms |
376 KB |
Output is correct |
| 16 |
Correct |
14 ms |
248 KB |
Output is correct |
| 17 |
Correct |
14 ms |
248 KB |
Output is correct |
| 18 |
Correct |
14 ms |
252 KB |
Output is correct |
