# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098684 | SulA | 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 <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define bitcount __builtin_popcountll
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<long long,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;
void play() {
vector<int> ind['Z'];
for (int i = 1; i <= 50; i++) {
ind[faceup(i)].push_back(i);
}
for (char c = 'A'; c <= 'Y'; c++) {
faceup(ind[c][0]);
faceup(ind[c][1]);
}
}