| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 292180 |
2020-09-06T13:29:33 Z |
amiratou |
Cluedo (IOI10_cluedo) |
C++14 |
|
13 ms |
384 KB |
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
#define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define sz(x) (int)(x.size())
using namespace std;
vector<int> vec[3];
rando;
void Solve(){
vec[0].clear(),vec[1].clear(),vec[2].clear();
for (int i = 1; i <= 6; ++i)
vec[0].push_back(i);
for (int i = 1; i <= 10; ++i)
vec[1].push_back(i);
for (int i = 1; i <= 6; ++i)
vec[2].push_back(i);
for (int i = 0; i < 3; ++i)
shuffle(vec[i].begin(),vec[i].end(),rng);
while(sz(vec[0])!=1 || sz(vec[1])!=1 || sz(vec[2])!=1){
int h=Theory(vec[0].back(),vec[1].back(),vec[2].back());
if(!h)return;
vec[h-1].pop_back();
}
Theory(vec[0].back(),vec[1].back(),vec[2].back());
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
256 KB |
Output is correct |
| 2 |
Correct |
13 ms |
384 KB |
Output is correct |
| 3 |
Correct |
10 ms |
256 KB |
Output is correct |
| 4 |
Correct |
10 ms |
256 KB |
Output is correct |
| 5 |
Correct |
9 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 |
10 ms |
256 KB |
Output is correct |
| 9 |
Correct |
9 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 |
11 ms |
256 KB |
Output is correct |
| 14 |
Correct |
9 ms |
256 KB |
Output is correct |
| 15 |
Correct |
10 ms |
256 KB |
Output is correct |
| 16 |
Correct |
10 ms |
256 KB |
Output is correct |
| 17 |
Correct |
10 ms |
256 KB |
Output is correct |
| 18 |
Correct |
8 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
256 KB |
Output is correct |
| 2 |
Correct |
8 ms |
256 KB |
Output is correct |
| 3 |
Correct |
9 ms |
256 KB |
Output is correct |
| 4 |
Correct |
9 ms |
256 KB |
Output is correct |
| 5 |
Correct |
10 ms |
288 KB |
Output is correct |
| 6 |
Correct |
10 ms |
256 KB |
Output is correct |
| 7 |
Correct |
8 ms |
256 KB |
Output is correct |
| 8 |
Correct |
10 ms |
256 KB |
Output is correct |
| 9 |
Correct |
7 ms |
256 KB |
Output is correct |
| 10 |
Correct |
9 ms |
256 KB |
Output is correct |
| 11 |
Correct |
10 ms |
256 KB |
Output is correct |
| 12 |
Correct |
9 ms |
256 KB |
Output is correct |
| 13 |
Correct |
9 ms |
256 KB |
Output is correct |
| 14 |
Correct |
10 ms |
256 KB |
Output is correct |
| 15 |
Correct |
9 ms |
256 KB |
Output is correct |
| 16 |
Correct |
11 ms |
256 KB |
Output is correct |
| 17 |
Correct |
5 ms |
256 KB |
Output is correct |
| 18 |
Correct |
9 ms |
256 KB |
Output is correct |
