제출 #961175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
961175		steveonalex	Memory (IOI10_memory)	C++17	100 / 100	1 ms	596 KiB

memory

#include <bits/stdc++.h>
#include "memory.h"
#include "grader.h"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)

// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n"){
        for(auto i: a) cout << i << separator;
        cout << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void play(){
    int n = 50;
    vector<char> bruh(n+1);
    for(int i= 1; i<=n; i += 2){
        bruh[i] = faceup(i);
        bruh[i+1] = faceup(i+1);
    }

    vector<pair<int, int>> identical;
    for(int i = 1; i<=n; ++i) 
    for(int j = i+1; j<=n; ++j) if (bruh[i] == bruh[j]) identical.push_back({i, j});
    for(pair<int, int> i: identical){
        faceup(i.first);
        faceup(i.second);
    }
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     return 0;
// }

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