Submission #237455

#	Time	Username	Problem	Language	Result	Execution time	Memory
237455		Fasho	Game (IOI14_game)	C++14	100 / 100	411 ms	10744 KiB

game

#include "game.h"
#include <bits/stdc++.h>
#define N 1505
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("badhair.gir","r",stdin);freopen ("badhair.cik","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
using namespace std;


ll tut[N],n;

void initialize(int m) {
	n=m;
	fo(i,0,n-1)
	tut[i]=n-i-1;
}

int hasEdge(int u, int v) {

	if(u>v)
		swap(u,v);
	tut[u]--;
	if(!tut[u])
		return 1;
	// else
	return 0;
	// if(u<=1 && x<=2)
	// 	return 1;
	// if(x<=1)
	// 	return 1;
	// if(v<=1 && y<=2)
	// 	return 1;
	// if(y<=1)
	// 	return 1;

	// tut[u]++;
	// tut[v]++;
	// return 0;
}
// int main()
// {
// 	fast;
// 	initialize(4);
// 	cout<<endl;
// 	fo(i,1,6)
// 	{
// 		int a,b;
// 		cin>>a>>b;
// 		cout<<hasEdge(a,b)<<endl;
// 	}
// }

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