| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 229811 |
2020-05-06T16:49:11 Z |
CaroLinda |
Cluedo (IOI10_cluedo) |
C++14 |
|
17 ms |
384 KB |
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define mkt make_tuple
#define debug printf
#define all(x) x.begin(),x.end()
#define lp(i,a,b) for(int i = a ; i< b ; i++)
#define ss second
#define ff first
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mk make_pair
using namespace std ;
int A[6] , B[10] , C[6] ;
void Solve(){
int ptr_a = 0 , ptr_b = 0 , ptr_c = 0 , r;
iota(A,A+6,1) ;
iota(B,B+10, 1) ;
iota(C,C+6,1) ;
while(true)
{
r = Theory(A[ptr_a] , B[ptr_b] , C[ptr_c]) ;
if( r == 0 ) return ;
if( r == 1 ) ptr_a ++ ;
else if(r == 2) ptr_b ++ ;
else ptr_c ++ ;
}
}
Compilation message
cluedo.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("O3")
cluedo.cpp:7:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("unroll-loops")
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
256 KB |
Output is correct |
| 2 |
Correct |
14 ms |
256 KB |
Output is correct |
| 3 |
Correct |
13 ms |
384 KB |
Output is correct |
| 4 |
Correct |
12 ms |
384 KB |
Output is correct |
| 5 |
Correct |
14 ms |
384 KB |
Output is correct |
| 6 |
Correct |
14 ms |
384 KB |
Output is correct |
| 7 |
Correct |
12 ms |
384 KB |
Output is correct |
| 8 |
Correct |
14 ms |
384 KB |
Output is correct |
| 9 |
Correct |
14 ms |
384 KB |
Output is correct |
| 10 |
Correct |
16 ms |
256 KB |
Output is correct |
| 11 |
Correct |
14 ms |
384 KB |
Output is correct |
| 12 |
Correct |
13 ms |
384 KB |
Output is correct |
| 13 |
Correct |
11 ms |
256 KB |
Output is correct |
| 14 |
Correct |
13 ms |
384 KB |
Output is correct |
| 15 |
Correct |
17 ms |
256 KB |
Output is correct |
| 16 |
Correct |
15 ms |
256 KB |
Output is correct |
| 17 |
Correct |
14 ms |
384 KB |
Output is correct |
| 18 |
Correct |
14 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
384 KB |
Output is correct |
| 2 |
Correct |
14 ms |
256 KB |
Output is correct |
| 3 |
Correct |
14 ms |
256 KB |
Output is correct |
| 4 |
Correct |
9 ms |
256 KB |
Output is correct |
| 5 |
Correct |
14 ms |
384 KB |
Output is correct |
| 6 |
Correct |
10 ms |
256 KB |
Output is correct |
| 7 |
Correct |
14 ms |
256 KB |
Output is correct |
| 8 |
Correct |
12 ms |
256 KB |
Output is correct |
| 9 |
Correct |
14 ms |
384 KB |
Output is correct |
| 10 |
Correct |
14 ms |
256 KB |
Output is correct |
| 11 |
Correct |
12 ms |
256 KB |
Output is correct |
| 12 |
Correct |
12 ms |
256 KB |
Output is correct |
| 13 |
Correct |
14 ms |
384 KB |
Output is correct |
| 14 |
Correct |
13 ms |
256 KB |
Output is correct |
| 15 |
Correct |
16 ms |
256 KB |
Output is correct |
| 16 |
Correct |
16 ms |
384 KB |
Output is correct |
| 17 |
Correct |
13 ms |
384 KB |
Output is correct |
| 18 |
Correct |
14 ms |
256 KB |
Output is correct |
