# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098685 | 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>
#include "memory.h"
#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]);
}
}
//signed main() {
// ios::sync_with_stdio(false);
// cin.tie(nullptr), cout.tie(nullptr);
//
// int N,K; cin >> N >> K;
// int h[N-1][2], L[N-1];
// for (int i = 0; i < N-1; cin >> h[i][0] >> h[i][1] >> L[i++]);
// cout << best_path(N, K, h, L);
//}