# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
722252 |
2023-04-11T15:59:53 Z |
ktkerem |
Cluedo (IOI10_cluedo) |
C++17 |
|
12 ms |
332 KB |
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
typedef int ll;
typedef long double ld;
typedef __int128 vll;
typedef long long ftyp;
typedef std::complex<ftyp> vec;
#define llll std::pair<ll , ll>
#define pb push_back
#define fi first
#define sec second
#define cx real
#define cy imag
#define all(a) a.begin() , a.end()
#define debug std::cout << "!!ALERT ALERT!!" << std::endl;
const ll limit = 1e9+7;
const ll sus = 5e4+5;
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
/*ll fun(ll x , ll y , ll z){
std::cout << x << y << z;
ll kk;std::cin >> kk;
return kk;
}*/
void Solve(){
ll dlm[7] , dll[11] , dlg[7];
memset(dlm , 0 , sizeof(dlm));
memset(dll , 0 , sizeof(dll));
memset(dlg , 0 , sizeof(dlg));
ll cs[4] = {0 , 1 , 1 , 1};
ll o = 1;
while(o){
o = Theory(cs[1] , cs[2] , cs[3]);
if(o == 1){
dlm[cs[1]] = 1;
}
else if(o == 2){
dll[cs[2]] = 1;
}
else if(o == 3){
dlg[cs[3]] = 1;
}
while(dlm[cs[1]] + dll[cs[2]] + dlg[cs[3]]){
cs[1] += dlm[cs[1]];
cs[2] += dll[cs[2]];
cs[3] += dlg[cs[3]];
cs[1] = (cs[1] % 7) + (cs[1] >= 7?1:0);
cs[2] = (cs[2] % 11) + (cs[2] >= 11?1:0);
cs[3] = (cs[3] % 7) + (cs[3] >= 7?1:0);
}
}
return;
}
/*void solve(){
Solve();
return;
}
int main(){
/*std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("in.txt" , "r" , stdin);
freopen("out.txt" , "w" , stdout);
#endif
ll t = 1;
//std::cin >> t;
while(t--){
solve();
}
}*/
Compilation message
cluedo.cpp:5:78: warning: "/*" within comment [-Wcomment]
5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
|
cluedo.cpp:64:3: warning: "/*" within comment [-Wcomment]
64 | /*std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
208 KB |
Output is correct |
2 |
Correct |
12 ms |
208 KB |
Output is correct |
3 |
Correct |
10 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
208 KB |
Output is correct |
5 |
Correct |
10 ms |
208 KB |
Output is correct |
6 |
Correct |
11 ms |
208 KB |
Output is correct |
7 |
Correct |
9 ms |
208 KB |
Output is correct |
8 |
Correct |
9 ms |
208 KB |
Output is correct |
9 |
Correct |
12 ms |
208 KB |
Output is correct |
10 |
Correct |
10 ms |
208 KB |
Output is correct |
11 |
Correct |
11 ms |
208 KB |
Output is correct |
12 |
Correct |
8 ms |
208 KB |
Output is correct |
13 |
Correct |
10 ms |
208 KB |
Output is correct |
14 |
Correct |
10 ms |
208 KB |
Output is correct |
15 |
Correct |
11 ms |
208 KB |
Output is correct |
16 |
Correct |
10 ms |
208 KB |
Output is correct |
17 |
Correct |
10 ms |
208 KB |
Output is correct |
18 |
Correct |
11 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
208 KB |
Output is correct |
2 |
Correct |
11 ms |
208 KB |
Output is correct |
3 |
Correct |
11 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
208 KB |
Output is correct |
5 |
Correct |
5 ms |
332 KB |
Output is correct |
6 |
Correct |
12 ms |
208 KB |
Output is correct |
7 |
Correct |
10 ms |
208 KB |
Output is correct |
8 |
Correct |
10 ms |
208 KB |
Output is correct |
9 |
Correct |
11 ms |
208 KB |
Output is correct |
10 |
Correct |
5 ms |
208 KB |
Output is correct |
11 |
Correct |
11 ms |
208 KB |
Output is correct |
12 |
Correct |
11 ms |
208 KB |
Output is correct |
13 |
Correct |
11 ms |
208 KB |
Output is correct |
14 |
Correct |
9 ms |
208 KB |
Output is correct |
15 |
Correct |
8 ms |
208 KB |
Output is correct |
16 |
Correct |
10 ms |
208 KB |
Output is correct |
17 |
Correct |
11 ms |
208 KB |
Output is correct |
18 |
Correct |
7 ms |
208 KB |
Output is correct |