제출 #983181

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

memory

#include "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/hash_policy.hpp>

#define int long long
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")

#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
using namespace std;
using namespace __gnu_pbds;

template <typename T>
using __indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using __indexed_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int sz = 3e5+9;
const int MOD = 1e9+7;
const int INF = 1e18;
char pos[100];

int a,b;

void play()
{
    for (int i = 1; i <= 50; ++i)
    {
        pos[i] = faceup(i);
    }
    for (char ch = 'A'; ch <= 'Y'; ++ch)
    {
        for (int i = 1; i <= 50; ++i)
        {
            if (pos[i] == ch)
            {
                for (int j = 1; j <= 50; ++j)
                {
                    if (i != j && pos[j] == ch)
                    {
                        faceup(i);
                        faceup(j);
                    }
                }
            }
        }
    }
}

void solve()
{
    play();
}

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