Submission #30422

#	Time	Username	Problem	Language	Result	Execution time	Memory
30422		inqr	Game (IOI14_game)	C++14	0 / 100	0 ms	10812 KiB

game

#include "game.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define all(x) x.begin() , x.end()
using namespace std;
int nonode[1505];
int N,totno,maxque,maxyes,maxno;
void initialize(int n) {
	N=n;
	maxque=(n)*(n-1)/(2);
	maxyes=n-1;
	maxno=maxque-maxyes;
	printf("n=%d maxque=%d maxyes=%d maxno=%d\n",n,maxque,maxyes,maxno);
}
int hasEdge(int u, int v) {
	if(nonode[u]<N-2&&nonode[v]<N-2&&totno<maxno){
		nonode[u]++;
		nonode[v]++;
		totno++;
		return 0;
	}
    return 1;
}

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