# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464811 | Benmath | Memory (IOI10_memory) | C++14 | 2 ms | 284 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<bits/stdc++.h>
#include "grader.h"
#include "memory.h"
using namespace std;
void play() {
int i;
char a, b;
map<char,int>mapa1;
map<char,int>mapa2;
for(char x='A';x<='Y';x++){
mapa1[x]=-1;
mapa2[x]=-1;
}
for (int i=1;i<=49;i=i+2){
a=faceup(i);
b=faceup(i+1);
if(mapa1[a]==-1){
mapa1[a]=i;
}else{
mapa2[a]=i;
}
if(mapa1[b]==-1){
mapa1[b]=i+1;
}else{
mapa2[b]=i+1;
}
}
for(char x='A';x<='Y';x++){
a=faceup(mapa1[x]);
b=faceup(mapa2[x]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |