| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 229811 | CaroLinda | Cluedo (IOI10_cluedo) | C++14 | 17 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
