# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412438 | abdzag | 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<unordered_map>
#include"grader.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define sz(a) a.size()
typedef long double ld;
using namespace std;
static const long long inf = 1e15;
typedef long long ll;
typedef unsigned long long ull;
int main() {
vector<char> v(50);
rep(i, 0, 50)v[i] = faceup(i);
rep(i, 0, 50) {
rep(j, 0, 50) {
if (j == i)continue;
if (v[i] == v[j]) {
faceup(i);
faceup(j);
v.erase(v.begin() + j);
break;
}
}
}
}