oj.uz

Submission #950677

# Submission time Handle Problem Language Result Execution time Memory
950677 2024-03-20T14:56:57 Z kilkuwu Game (IOI14_game) C++17
42 / 100
 1000 ms 7040 KB 
#ifdef LOCAL
#ifndef _GAME_H
#define _GAME_H

void initialize(int n);
int hasEdge(int u, int v);

#include <cstdio>
#include <cassert>
#include "game.h"

int read_int() {
    int x;
    assert(scanf("%d", &x) == 1);
    return x;
}

int main() {
    int n, u, v;
    n = read_int();
    initialize(n);
    for (int i = 0; i < n * (n - 1) / 2; i++) {
        u = read_int();
        v = read_int();
        printf("%d\n", hasEdge(u, v));
    }
    return 0;
}

#endif
#else 
#include "game.h"
#endif

#include <bits/stdc++.h>

struct DSU {
  std::vector<int> e;
  int cnt = 0;

  DSU(int n) : e(n, -1) {}

  int find(int u) {
    return e[u] < 0 ? u : e[u] = find(e[u]);
  }
  
  bool merge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v) return false;
    cnt++;
    if (e[u] > e[v]) std::swap(u, v);
    e[u] += e[v];
    e[v] = u;
    return true;
  } 

  bool same(int u, int v) {
    return find(u) == find(v);
  }
  
  int size(int u) {
    return -e[find(u)];
  }

  int size() {
    return e.size() - cnt;
  }
};

const int mxN = 1500;
int broken[mxN][mxN];
int n;


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

int hasEdge(int u, int v) {
  // let's delete this
  broken[u][v] = 1;
  broken[v][u] = 1;

  DSU dsu(n);
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (!broken[i][j]) {
        dsu.merge(i, j);
      }
    }
  }

  if (dsu.size() == 1) {
    return 0;
  } else {
    broken[u][v] = broken[v][u] = 0;
    return 1;
  }
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2392 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2484 KB Output is correct
31 Correct 2 ms 2648 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 25 ms 4440 KB Output is correct
35 Correct 25 ms 2648 KB Output is correct
36 Correct 24 ms 2648 KB Output is correct
37 Correct 25 ms 4444 KB Output is correct
38 Correct 28 ms 4704 KB Output is correct
39 Correct 25 ms 4688 KB Output is correct
40 Correct 26 ms 4440 KB Output is correct
41 Correct 24 ms 4700 KB Output is correct
42 Correct 24 ms 4444 KB Output is correct
43 Correct 22 ms 2652 KB Output is correct
44 Correct 20 ms 4700 KB Output is correct
45 Correct 25 ms 4444 KB Output is correct
46 Correct 25 ms 4700 KB Output is correct
47 Correct 32 ms 4700 KB Output is correct
48 Correct 24 ms 4440 KB Output is correct
49 Correct 24 ms 4440 KB Output is correct
50 Correct 24 ms 4700 KB Output is correct
51 Correct 24 ms 4700 KB Output is correct
52 Correct 24 ms 4692 KB Output is correct
53 Correct 23 ms 4700 KB Output is correct
54 Correct 25 ms 4440 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2500 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2504 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2516 KB Output is correct
26 Correct 1 ms 2496 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 2 ms 2392 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 25 ms 4696 KB Output is correct
35 Correct 24 ms 2648 KB Output is correct
36 Correct 24 ms 2652 KB Output is correct
37 Correct 25 ms 4444 KB Output is correct
38 Correct 24 ms 4696 KB Output is correct
39 Correct 26 ms 4444 KB Output is correct
40 Correct 27 ms 4700 KB Output is correct
41 Correct 24 ms 4700 KB Output is correct
42 Correct 27 ms 4676 KB Output is correct
43 Correct 22 ms 2852 KB Output is correct
44 Correct 18 ms 4696 KB Output is correct
45 Correct 27 ms 4444 KB Output is correct
46 Correct 24 ms 4700 KB Output is correct
47 Correct 26 ms 4888 KB Output is correct
48 Correct 25 ms 4684 KB Output is correct
49 Correct 25 ms 4700 KB Output is correct
50 Correct 23 ms 4696 KB Output is correct
51 Correct 24 ms 4440 KB Output is correct
52 Correct 23 ms 4696 KB Output is correct
53 Correct 23 ms 4444 KB Output is correct
54 Correct 23 ms 4444 KB Output is correct
55 Execution timed out 1055 ms 7040 KB Time limit exceeded
56 Halted 0 ms 0 KB -