| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 232609 | crossing0ver | Memory (IOI10_memory) | C++17 | 0 ms | 0 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;
int A[51][2],B[51];
void memory() {
for (int i = 1; i <= 50; i++) {
int x = faceup(i) - 'a' + 1;
A[x][B[x]++] = i;
}
for (int i = 1; i <= 25; i++) {
faceup(A[i][0]);
faceup(A[i][1]);
}
return ;
}