This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
int hasEdge(int u, int v) {
if(nonode[u]<N-2&&nonode[v]<N-2&&totno<maxno){
return 0;
nonode[u]++;
nonode[v]++;
totno++;
}
return 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |