oj.uz

Submission #700865

# Submission time Handle Problem Language Result Execution time Memory
700865 2023-02-19T09:32:07 Z primenumber_zz Game (IOI14_game) C++14
42 / 100
 1000 ms 692 KB 
#include<bits/stdc++.h>
using namespace std;

int N;
int cnt,res;
vector<int>road[1515];
set<pair<int,int>>st;

struct UnionFind {
    vector<int>par,size,cnt;
    vector<vector<int>>cld;
    UnionFind() {};
    UnionFind(int n) {
        par.resize(n);
        size.resize(n,1);
        cnt.resize(n);
        cld.resize(n);
        for(int i = 0; i < n; i++) {
            par[i] = i;
            cld[i].push_back(i);
        }
    }
    int find(int x) {
        if(par[x] == x) {
            return x;
        }
        return par[x] = find(par[x]);
    }
    bool same(int u,int v) {
        u = find(u);
        v = find(v);
        return (u == v);
    }
    void unite(int u,int v) {
        u = find(u);
        v = find(v);
        if(u == v) return;
        if(size[u] > size[v]) swap(u,v);
        for(int i:cld[u]) {
            cld[v].push_back(i);
            for(int j:road[i]) {
                if(!same(i,j) && same(j,v)) {
                    cnt[v] -= 2;
                }
            }
        }
        par[u] = v;
        size[v] += size[u];
        cnt[v] += cnt[u];
    }
    int consize(int x) {
        x = find(x);
        return size[x];
    }
    int concnt(int x) {
        x = find(x);
        return cnt[x];
    }
};

UnionFind uf;

void initialize(int n) {
    N = n;
    cnt = 0;
    res = n-1;
    UnionFind init(n);
    uf = init;
}

int hasEdge(int u, int v) {
    if(u > v) swap(u,v);
    st.insert({u,v});
    if(uf.same(u,v)) {
        cnt++;
        return 0;
    }
    int a = uf.consize(u);
    int b = uf.concnt(u);
    if(a*(N-a) == b+1) {
        uf.unite(u,v);
        st.erase({u,v});
        res--;
        return 1;
    }
    a = uf.consize(v);
    b = uf.concnt(v);
    if(a*(N-a) == b+1) {
        uf.unite(u,v);
        st.erase({u,v});
        res--;
        return 1;
    }
    UnionFind flag(N);
    for(int i = 0; i < N; i++) {
        for(int j = i+1; j < N; j++) {
            if(!st.count({i,j})) {
                flag.unite(i,j);
            }
        }
    }
    if(flag.consize(0) != N) {
        uf.unite(u,v);
        st.erase({u,v});
        return 1;
    }
    uf.cnt[uf.find(u)]++;
    uf.cnt[uf.find(v)]++;
    cnt++;
    return 0;
}

/*
int main() {
    int N;
    cin >> N;
    initialize(N);
    for(int i = 0; i < N*(N-1)/2; i++) {
        int u,v;
        cin >> u >> v;
        cout << hasEdge(u,v) << "\n";
    }
}*/

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 9 ms 340 KB Output is correct
26 Correct 11 ms 480 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 9 ms 340 KB Output is correct
29 Correct 9 ms 356 KB Output is correct
30 Correct 10 ms 476 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 11 ms 468 KB Output is correct
33 Correct 10 ms 340 KB Output is correct
34 Correct 420 ms 448 KB Output is correct
35 Correct 451 ms 488 KB Output is correct
36 Correct 448 ms 468 KB Output is correct
37 Correct 459 ms 592 KB Output is correct
38 Correct 440 ms 560 KB Output is correct
39 Correct 461 ms 512 KB Output is correct
40 Correct 428 ms 492 KB Output is correct
41 Correct 419 ms 488 KB Output is correct
42 Correct 437 ms 496 KB Output is correct
43 Correct 338 ms 576 KB Output is correct
44 Correct 364 ms 572 KB Output is correct
45 Correct 439 ms 592 KB Output is correct
46 Correct 424 ms 504 KB Output is correct
47 Correct 445 ms 668 KB Output is correct
48 Correct 429 ms 512 KB Output is correct
49 Correct 460 ms 424 KB Output is correct
50 Correct 424 ms 652 KB Output is correct
51 Correct 431 ms 512 KB Output is correct
52 Correct 426 ms 504 KB Output is correct
53 Correct 412 ms 516 KB Output is correct
54 Correct 417 ms 512 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 9 ms 340 KB Output is correct
26 Correct 9 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 9 ms 360 KB Output is correct
29 Correct 9 ms 340 KB Output is correct
30 Correct 10 ms 364 KB Output is correct
31 Correct 9 ms 356 KB Output is correct
32 Correct 11 ms 348 KB Output is correct
33 Correct 9 ms 356 KB Output is correct
34 Correct 454 ms 488 KB Output is correct
35 Correct 439 ms 600 KB Output is correct
36 Correct 443 ms 488 KB Output is correct
37 Correct 440 ms 600 KB Output is correct
38 Correct 429 ms 616 KB Output is correct
39 Correct 437 ms 568 KB Output is correct
40 Correct 483 ms 604 KB Output is correct
41 Correct 414 ms 464 KB Output is correct
42 Correct 416 ms 556 KB Output is correct
43 Correct 360 ms 480 KB Output is correct
44 Correct 402 ms 692 KB Output is correct
45 Correct 463 ms 544 KB Output is correct
46 Correct 453 ms 584 KB Output is correct
47 Correct 422 ms 536 KB Output is correct
48 Correct 433 ms 508 KB Output is correct
49 Correct 441 ms 612 KB Output is correct
50 Correct 401 ms 476 KB Output is correct
51 Correct 421 ms 500 KB Output is correct
52 Correct 442 ms 500 KB Output is correct
53 Correct 408 ms 500 KB Output is correct
54 Correct 426 ms 504 KB Output is correct
55 Execution timed out 1082 ms 456 KB Time limit exceeded
56 Halted 0 ms 0 KB -