oj.uz

Submission #950599

# Submission time Handle Problem Language Result Execution time Memory
950599 2024-03-20T13:29:09 Z quanlt206 Game (IOI14_game) C++17
42 / 100
 1000 ms 4700 KB 
#include "game.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 1507;

bool c[N][N];

int n;

struct DSU {
    int par[N], sz[N];
    DSU() {
        REP(i, 0, N) par[i] = i, sz[i] = 1;
    }
    int FS(int v) {
        return v == par[v] ? v : (par[v] = FS(par[v]));
    }
    void US(int a, int b) {
        a = FS(a);
        b = FS(b);
        if (a == b) return ;
        if (sz[a] > sz[b]) swap(a, b);
        par[a] = b;
        sz[b]+=sz[a];
    }
    void Init(int n) {
        FOR(i, 0, n) par[i] = i, sz[i] = 1;
    }
} dsu;

void initialize(int m) {
    n = m;
    REP(i, 0, n)
        REP(j, i + 1, n) c[i][j] = true;
}

bool check_connected() {
    dsu.Init(n);
    REP(i, 0, n)
        REP(j, i + 1, n)
            if (c[i][j]) dsu.US(i, j);
    REP(i, 1, n)
        if (dsu.FS(i) != dsu.FS(i - 1)) return false;
    return true;
}

int hasEdge(int u, int v) {
    if (u > v) swap(u, v);
    c[u][v] = false;
    if (check_connected()) return 0;
    c[u][v] = true;
    return 1;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 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 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 2504 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2464 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 2396 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 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 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 2396 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 2648 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 2392 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 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 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 2 ms 2396 KB Output is correct
31 Correct 2 ms 2508 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 21 ms 2396 KB Output is correct
35 Correct 22 ms 2396 KB Output is correct
36 Correct 22 ms 2396 KB Output is correct
37 Correct 22 ms 2640 KB Output is correct
38 Correct 22 ms 2652 KB Output is correct
39 Correct 22 ms 2632 KB Output is correct
40 Correct 22 ms 2396 KB Output is correct
41 Correct 22 ms 2396 KB Output is correct
42 Correct 22 ms 2396 KB Output is correct
43 Correct 26 ms 2392 KB Output is correct
44 Correct 17 ms 2396 KB Output is correct
45 Correct 21 ms 2876 KB Output is correct
46 Correct 22 ms 2392 KB Output is correct
47 Correct 21 ms 2396 KB Output is correct
48 Correct 22 ms 2396 KB Output is correct
49 Correct 22 ms 2396 KB Output is correct
50 Correct 21 ms 2392 KB Output is correct
51 Correct 20 ms 2396 KB Output is correct
52 Correct 21 ms 2396 KB Output is correct
53 Correct 21 ms 2396 KB Output is correct
54 Correct 21 ms 2396 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2500 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 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 2396 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 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2592 KB Output is correct
19 Correct 1 ms 2392 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 2508 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 2 ms 2392 KB Output is correct
29 Correct 2 ms 2648 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 22 ms 2392 KB Output is correct
35 Correct 22 ms 2392 KB Output is correct
36 Correct 22 ms 2396 KB Output is correct
37 Correct 23 ms 2396 KB Output is correct
38 Correct 23 ms 2648 KB Output is correct
39 Correct 21 ms 2396 KB Output is correct
40 Correct 22 ms 2648 KB Output is correct
41 Correct 26 ms 2392 KB Output is correct
42 Correct 22 ms 2392 KB Output is correct
43 Correct 23 ms 2632 KB Output is correct
44 Correct 17 ms 2648 KB Output is correct
45 Correct 22 ms 2396 KB Output is correct
46 Correct 25 ms 2392 KB Output is correct
47 Correct 21 ms 2584 KB Output is correct
48 Correct 21 ms 2648 KB Output is correct
49 Correct 22 ms 2640 KB Output is correct
50 Correct 20 ms 2652 KB Output is correct
51 Correct 21 ms 2636 KB Output is correct
52 Correct 21 ms 2648 KB Output is correct
53 Correct 21 ms 2396 KB Output is correct
54 Correct 21 ms 2648 KB Output is correct
55 Execution timed out 1073 ms 4700 KB Time limit exceeded
56 Halted 0 ms 0 KB -