Submission #394736

#	Time	Username	Problem	Language	Result	Execution time	Memory
394736		MarcoMeijer	Memory (IOI10_memory)	C++14	100 / 100	3 ms	328 KiB

memory

#include "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void play() {
    map<int,vi> mp;
    RE1(i,50) {
        int res = faceup(i);
        mp[res].pb(i);
    }
    FOR(p,mp) {
        faceup(p.se[0]);
        faceup(p.se[1]);
    }
}

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50