제출 #205788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
205788		jasony123123	Memory (IOI10_memory)	C++11	100 / 100	7 ms	504 KiB

memory

#include "grader.h"
#include "memory.h"

#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define v vector
typedef long long ll;
typedef pair<int, int > pii;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void play() {
	v<int> pos[25];
	FORE(p,1,50)
		pos[faceup(p)-'A'].push_back(p);
	FOR(c,0,25)
		faceup(pos[c][0]), faceup(pos[c][1]);
}

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