Submission #604953

#	Time	Username	Problem	Language	Result	Execution time	Memory
604953		HediChehaidar	Game (IOI14_game)	C++17	15 / 100	1 ms	340 KiB

game

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define dte  tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = 1e9 + 7;//998244353 ;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)2e18;

int cur ;
bool g[2020][2020];
int nb[2020];
int n;
int hasEdge(int u, int v){
    if(cur == n - 1) return 1;
    if(nb[u] == 1 || nb[v] == 1) return 1;
    cur--;
    nb[u]--; nb[v]--;
    return 0;
}
void initialize(int N){
    n = N;
    cur = n * (n - 1);
    cur /= 2;
    for(int i = 0 ; i < n ; i++) nb[i] = n - 1;
    for(int i = 0 ; i < n ; i++){
        for(int j = 0 ; j < n ; j++) g[i][j] = false;
    }
}
/*int main(){
    //ifstream fin ("testing.txt");
    //ofstream fout ("output.txt");
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n; cin>>n;
    initialize(n);
    for(int i = 0 ; i < (n * (n - 1)) / 2 ; i++){
        int u , v; cin>>u>>v; cout<< hasEdge(u , v) << endl;
    }
    return 0;
}
*/
/*
    Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO / HLD
    Read the statement CAREFULLY !!
    Make a GREADY APPROACH !!!! (start from highest / lowest)
    Make your own TESTS !!
    Be careful from CORNER CASES !
*/

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