oj.uz

Submission #31717

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

int n, ok;
int cnt[maxn];
int edge[maxn][maxn];
vector<int> dst, src;

void gentree() {
    int i,a,b;
    for(i=1;i<=n;i++) dst.push_back(i);
    random_shuffle(dst.begin(),dst.end());
    src.push_back(dst[0]);
    for(i=1;i<n;i++) {
        a = src[rand()%src.size()];
        b = dst[i];
        src.push_back(b);
        edge[a][b] = edge[b][a] = 1;
    }
}

void initialize(int N) {
    int i,x;
    n = N;
    if(n>4) gentree();
    else {
        ok = n*(n-1)/2 - (n-1);
        memset(cnt,0,sizeof(cnt));
    }
    if(n>4 && n<10) printf("%d",1/0);
}

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

Compilation message

game.cpp: In function 'void initialize(int)':
game.cpp:32:34: warning: division by zero [-Wdiv-by-zero]
     if(n>4 && n<10) printf("%d",1/0);
                                  ^
game.cpp:25:9: warning: unused variable 'i' [-Wunused-variable]
     int i,x;
         ^
game.cpp:25:11: warning: unused variable 'x' [-Wunused-variable]
     int i,x;
           ^

Subtask #1
15.0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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