# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655041 | hyakup | Memory (IOI10_memory) | C++17 | 2 ms | 292 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 "memory.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
int cont[maxn];
int pos1[maxn], pos2[maxn];
void play() {
for( int i = 1; i <= 25; i++){
char c1, c2;
c1 = faceup(2*i - 1);
cont[ c1 - 'A' ]++;
if( cont[ c1 - 'A' ] == 1 ) pos1[ c1 - 'A' ] = 2*i - 1;
else pos2[ c1 - 'A' ] = 2*i - 1;
c2 = faceup(2*i);
cont[ c2 - 'A' ]++;
if( cont[ c2 - 'A' ] == 1 ) pos1[ c2 - 'A' ] = 2*i;
else pos2[ c2 - 'A' ] = 2*i;
}
for( int i = 0; i < 25; i++ ){
char c1, c2;
c1 = faceup( pos1[i] );
c2 = faceup( pos2[i] );
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |