oj.uz

Submission #65405

# Submission time Handle Problem Language Result Execution time Memory
65405 2018-08-07T14:13:21 Z theknife2001 Game (IOI14_game) C++17
15 / 100
 5 ms 648 KB 
#include "game.h"
#include <bits/stdc++.h>


using namespace std;
const int N=1555;
int cnt[N];
int n;
int counter=0;


void initialize(int N) {
n=N;
}

int hasEdge(int u, int v)
{
    cnt[u]++;
    cnt[v]++;
    if(cnt[u]==n-2)
        counter++;
    if(cnt[v]==n-2)
        counter++;
    if(counter==n-(n%2))
    {
        counter++;
        return 1;
    }
    if(cnt[u]==n-1||cnt[v]==n-1)
        return 1;
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 3 ms 476 KB Output is correct
7 Correct 3 ms 476 KB Output is correct
8 Correct 3 ms 552 KB Output is correct
9 Correct 3 ms 552 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 552 KB Output is correct
12 Correct 3 ms 552 KB Output is correct
13 Correct 2 ms 552 KB Output is correct
14 Correct 2 ms 552 KB Output is correct
15 Correct 3 ms 552 KB Output is correct
16 Correct 2 ms 552 KB Output is correct
17 Correct 3 ms 552 KB Output is correct
18 Correct 2 ms 552 KB Output is correct
19 Correct 3 ms 552 KB Output is correct
20 Correct 2 ms 552 KB Output is correct
21 Correct 2 ms 552 KB Output is correct
22 Correct 2 ms 576 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 592 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 2 ms 636 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 3 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 636 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 2 ms 636 KB Output is correct
14 Correct 3 ms 636 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 636 KB Output is correct
18 Correct 2 ms 636 KB Output is correct
19 Correct 2 ms 636 KB Output is correct
20 Correct 3 ms 636 KB Output is correct
21 Correct 3 ms 648 KB Output is correct
22 Correct 2 ms 648 KB Output is correct
23 Correct 2 ms 648 KB Output is correct
24 Correct 3 ms 648 KB Output is correct
25 Incorrect 3 ms 648 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 648 KB Output is correct
2 Correct 3 ms 648 KB Output is correct
3 Correct 2 ms 648 KB Output is correct
4 Correct 2 ms 648 KB Output is correct
5 Correct 3 ms 648 KB Output is correct
6 Correct 2 ms 648 KB Output is correct
7 Correct 4 ms 648 KB Output is correct
8 Correct 3 ms 648 KB Output is correct
9 Correct 3 ms 648 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 3 ms 648 KB Output is correct
12 Correct 3 ms 648 KB Output is correct
13 Correct 3 ms 648 KB Output is correct
14 Correct 3 ms 648 KB Output is correct
15 Correct 5 ms 648 KB Output is correct
16 Correct 3 ms 648 KB Output is correct
17 Correct 2 ms 648 KB Output is correct
18 Correct 3 ms 648 KB Output is correct
19 Correct 3 ms 648 KB Output is correct
20 Correct 2 ms 648 KB Output is correct
21 Correct 2 ms 648 KB Output is correct
22 Correct 2 ms 648 KB Output is correct
23 Correct 2 ms 648 KB Output is correct
24 Correct 2 ms 648 KB Output is correct
25 Incorrect 2 ms 648 KB Output isn't correct
26 Halted 0 ms 0 KB -