제출 #1267006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267006		ilovewaguri	Memory (IOI10_memory)	C++20	100 / 100	0 ms	408 KiB

memory

#include "grader.h"
#include "memory.h"
#include<bits/stdc++.h>
using namespace std;
#define NAME ""
#define nl '\n'
#define allofa(x,sz) x,x+sz+1
#define allof(x) x.begin(),x.end()
#define allof1(x) x.begin()+1,x.end()
#define mset(x,val) memset(x,val,sizeof(x))
#define couf(x) cout << fixed << setprecision(x)
template<class T> T Abs(T &x) {return (x>=0 ? x : -x);};
template<class X,class Y> bool minimize(X &a, Y b){if(a>b) {a=b;return true;}return false;};
template<class X,class Y> bool maximize(X &a, Y b){if(a<b) {a=b;return true;}return false;};
typedef long long ll;
const ll mod = (long long)1e9+7;
const ll LINF = (long long)1e15;
const int INF = (int)1e9;
int firstPos[25],secondPos[25];

void play() {
    mset(firstPos,-1);
    mset(secondPos,-1);
    for (int i = 1; i<=50; i+=2) {
        char firstCh = faceup(i);
        char secondCh = faceup(i+1);
        if(firstPos[firstCh-'A']==-1) {
            firstPos[firstCh-'A']=i;
        }
        else secondPos[firstCh-'A']=i;
        if(firstPos[secondCh-'A']==-1) {
            firstPos[secondCh-'A']=i+1;
        }
        else secondPos[secondCh-'A']=i+1;
    }
    for (int i = 0; i<25; i++) {
        faceup(firstPos[i]);
        faceup(secondPos[i]);
    }
}

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