oj.uz

Submission #31712

# Submission time Handle Problem Language Result Execution time Memory
31712 2017-09-01T10:30:40 Z top34051 Game (IOI14_game) C++14
0 / 100
 0 ms 10808 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define maxn 1505

int n,ok;
int cnt[maxn];

void initialize(int N) {
    n = N;
    ok = n*(n-1)/2 - (n-1);
    memset(cnt,0,sizeof(cnt));
}

int hasEdge(int u, int v) {
    if(ok && cnt[u]+1<n-1 && cnt[v]+1!=n-1) {
        cnt[u]++; cnt[v]++; ok--;
        return 0;
    }
    ok++;
    return 1;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10808 KB Output is correct
2 Incorrect 0 ms 10808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10808 KB Output is correct
2 Incorrect 0 ms 10808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10808 KB Output is correct
2 Incorrect 0 ms 10808 KB Output isn't correct
3 Halted 0 ms 0 KB -