# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088625 | toast12 | Memory (IOI10_memory) | C++14 | 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 <vector>
using namespace std;
void play() {
vector<pair<int, int>> ans(25);
char a, b;
for (int i = 1; i <= 25; ++i) {
a = faceup(i);
b = faceup(51-i);
if (ans[a-'A'].first != 0) {
ans[a-'A'].second = i;
}
else {
ans[a-'A'].first = i;
}
if (ans[b-'A'].first != 0) {
ans[b-'A'].second = 51-i;
}
else {
ans[b-'A'].first = 51-i;
}
}
for (int i = 0; i < 25; i++) {
faceup(ans[i].first);
faceup(ans[i].second);
}
return;
}