# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
584139 | Cauchico | 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<bool> found(25);
vector<pair<int,int>> a(25,{-1,-1});
for (int i=1;i<=25;i++) {
char x = faceup(i);
char y = faceup(i+25);
if (x==y) {
found[x-'A'] = true;
}
if (a[x-'A'].first == -1) {
a[x-'A'].first = i;
} else {
a[x-'A'].second = i;
}
if (a[y-'A'].first == -1) {
a[y-'A'].first = i+25;
} else {
a[y-'A'].second = i+25;
}
}
for (int i=0;i<25;i++) {
if (not found[i]) {
faceup(a[i].first);
faceup(a[i].second);
}
}
return 0;
}