Submission #1219099

#	Time	Username	Problem	Language	Result	Execution time	Memory
1219099		Theo830	Memory (IOI10_memory)	C++20	100 / 100	0 ms	412 KiB

memory

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define id pair<ll,vector<ll> >
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "grader.h"
#include "memory.h"
void play(){
    vector<ii>ans;
    ll pos[25] = {0};
    f(i,1,51){
        char c = faceup(i);
        if(pos[c - 'A']){
            ans.pb(ii(i,pos[c - 'A']));
        }
        else{
            pos[c - 'A'] = i;
        }
    }
    for(auto x:ans){
        faceup(x.F);
        faceup(x.S);
    }
}

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