제출 #1275042

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275042		KluydQ	Game (IOI14_game)	C++20	100 / 100	162 ms	13296 KiB

game

#include "game.h"
#include <bits/stdc++.h>

//#define respagold ios_base::sync_with_stdio(0), cin.tie(0);     
//#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define pf push_front
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define ppi pair <pair <int, int>, int>
#define pip pair <int, pair <int, int>>
#define mkp make_pair
 
using namespace std;
 
const int N = 2e5 + 12;
const int inf = 2e9;
const int mod = 1e9 + 7;
const double eps = 1e-20;

int n, m, x, y, a[N];

void initialize( int n )
{
	FOR( i, 1, n, 1 ) a[i] = i;
}
int hasEdge( int v, int u )
{
	a[max(v, u)] --;
	
	if( a[max(v, u)] == 0 ) return 1;
	else return 0;
}
/*
void solve()
{
	
}
signed main()
{
	respagold
	
	int test = 1;
	if( !test ) cin >> test;
	while( test -- ) solve();
}*/

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 58 / 58