| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1281105 | WH8 | Cluedo (IOI10_cluedo) | C++20 | 5 ms | 400 KiB |
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(){
random_device rd;
mt19937_64 g(rd());
vector<vector<int>> v(4);
v[1].resize(6);
v[2].resize(10);
v[3].resize(6);
for(int i=1;i<=3;i++){
iota(v[i].begin(),v[i].end(),1);
shuffle(v[i].begin(),v[i].end(),g);
}
vector<int> p(4, 0);
int ret;
while (1){
ret=Theory(v[1][p[1]],v[2][p[2]],v[3][p[3]]);
if(ret==0)return;
p[ret]++;
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
