제출 #1156407

#제출 시각아이디문제언어결과실행 시간메모리
1156407minh30082008Memory (IOI10_memory)C++20
100 / 100
1 ms416 KiB
#include "memory.h"
#include "grader.h"
#include <stdio.h>
#include <stdlib.h>


#include<bits/stdc++.h>
#define INF 1e18
#define fi first
#define se second
#define FOR(i, k, n) for(ll i = k; i <= n; i++)
#define FOR1(i, k, n) for(ll i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "chinaflu.inp"
#define output "chinaflu.out"
#define rf 	freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 9;
const int base = 998244353;
void add(int &a, int b) 
{
	a += b; 
	if(a >= mod) a -= mod; 
	if(a < 0) a += mod; 
}
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	return uniform_int_distribution<int>(l, r) (rd);
}
vi vv[100];
void play()
{
	FOR(i, 0, 50)
		vv[i].clear();
	for(int i = 1; i <= 50; i += 2)
	{
		char c = faceup(i);
		vv[c - 'A'].pb(i);
		c = faceup(i + 1);
		vv[c - 'A'].pb(i + 1);
	}
	FOR(i, 0, 30)
		if(vv[i].size() < 2)
			continue;
		else
		{
			faceup(vv[i][0]);
			faceup(vv[i][1]);
		}
	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...