oj.uz

Submission #635509

# Submission time Handle Problem Language Result Execution time Memory
635509 2022-08-26T10:53:49 Z Bruteforceman Parachute rings (IOI12_rings) C++11
100 / 100
 639 ms 55632 KB 
    #pragma GCC optimize("Ofast")    
    #include "bits/stdc++.h"
    using namespace std;
    int N;
    struct dsu {
        int other[1000010];
        int len[1000010];
        int cycle_cnt;
        int cycle_sum;
        bool bad;
        int no_of_nodes;
        int del_node;
     
        void init (int n) {
            no_of_nodes = n;
            del_node = -1;
            for(int i = 0; i < no_of_nodes; i++) {
                other[i] = i;
                len[i] = 1;
            }
            cycle_cnt = 0;
            cycle_sum = 0;
            bad = false;
        }
        void add(int x, int y) {
            if(del_node == x || del_node == y) return ; 
            if(bad) return ;
            if(other[x] == y) {
                other[x] = -1;
                other[y] = -1;
                cycle_cnt += 1;
                cycle_sum += len[x];
            } else {
                if(other[x] == -1 || other[y] == -1) {
                    bad = true;
                    return ;
                }
                int p = other[y];
                int q = other[x];
                other[p] = q;
                other[q] = p;
                int sum = len[x] + len[y];
                len[p] = len[q] = sum;
                if(x != p && x != q) {
                    other[x] = -1;
                }
                if(y != p && y != q) {
                    other[y] = -1;
                }
            }
        }
        int count() {
            if(bad) return 0;
            if(cycle_cnt <= 1) {
                if(cycle_cnt == 1) return cycle_sum;
                else return no_of_nodes;
            }
            return 0;
        }
    } T[4];
    int deg[1000010];
    vector <int> l, r;
    bool found_cand;
     
    void Init(int N_) {
      N = N_;
      T[0].init(N);
      for(int i = 0; i < N; i++) {
        deg[i] = 0;
      }
      l.clear(); r.clear();
      found_cand = false;
    }
    void Link(int A, int B) {
        if(found_cand) {
            for(int i = 0; i < 4; i++) {
                T[i].add(A, B);
            }
            return ;
        }
        ++deg[A]; ++deg[B];
        l.emplace_back(A);
        r.emplace_back(B);
        if(deg[A] == 3 || deg[B] == 3) {
            vector <int> v;
            int can = deg[A] == 3 ? A : B;
            v.emplace_back(can);
            for(int i = 0; i < (int) l.size(); i++) {
                if(l[i] == can || r[i] == can) {
                    v.emplace_back(l[i] ^ r[i] ^ can);
                }
            }
            for(int i = 0; i < 4; i++) {
                T[i].init(N);
                T[i].del_node = v[i];
            }
            found_cand = true;
        } else {
            T[0].add(A, B);
        }
        if(found_cand) {
            for(int i = 0; i < (int)l.size(); i++) {
                Link(l[i], r[i]);
            }
            l.clear(); r.clear();
        }
    }
     
    int CountCritical() {
        if(found_cand) {
            int ans = 0;
            for(int i = 0; i < 4; i++) {
                if(T[i].cycle_cnt == 0 && !T[i].bad) {
                    ++ans;
                }
            }
            return ans;
        }
        return T[0].count();
    }

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 660 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 17640 KB Output is correct
2 Correct 324 ms 41592 KB Output is correct
3 Correct 184 ms 48480 KB Output is correct
4 Correct 351 ms 33548 KB Output is correct
5 Correct 345 ms 33760 KB Output is correct
6 Correct 333 ms 32800 KB Output is correct
7 Correct 177 ms 47820 KB Output is correct
8 Correct 548 ms 51072 KB Output is correct
9 Correct 639 ms 55632 KB Output is correct
10 Correct 289 ms 32356 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 660 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 980 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 2 ms 852 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 740 KB Output is correct
20 Correct 3 ms 916 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 660 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 980 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 2 ms 852 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 740 KB Output is correct
20 Correct 3 ms 916 KB Output is correct
21 Correct 10 ms 1828 KB Output is correct
22 Correct 16 ms 2640 KB Output is correct
23 Correct 21 ms 3308 KB Output is correct
24 Correct 22 ms 4564 KB Output is correct
25 Correct 10 ms 4180 KB Output is correct
26 Correct 21 ms 4712 KB Output is correct
27 Correct 23 ms 3400 KB Output is correct
28 Correct 17 ms 4564 KB Output is correct
29 Correct 19 ms 4692 KB Output is correct
30 Correct 22 ms 3656 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 660 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 147 ms 17640 KB Output is correct
12 Correct 324 ms 41592 KB Output is correct
13 Correct 184 ms 48480 KB Output is correct
14 Correct 351 ms 33548 KB Output is correct
15 Correct 345 ms 33760 KB Output is correct
16 Correct 333 ms 32800 KB Output is correct
17 Correct 177 ms 47820 KB Output is correct
18 Correct 548 ms 51072 KB Output is correct
19 Correct 639 ms 55632 KB Output is correct
20 Correct 289 ms 32356 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 3 ms 980 KB Output is correct
23 Correct 3 ms 852 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 3 ms 1236 KB Output is correct
29 Correct 2 ms 740 KB Output is correct
30 Correct 3 ms 916 KB Output is correct
31 Correct 10 ms 1828 KB Output is correct
32 Correct 16 ms 2640 KB Output is correct
33 Correct 21 ms 3308 KB Output is correct
34 Correct 22 ms 4564 KB Output is correct
35 Correct 10 ms 4180 KB Output is correct
36 Correct 21 ms 4712 KB Output is correct
37 Correct 23 ms 3400 KB Output is correct
38 Correct 17 ms 4564 KB Output is correct
39 Correct 19 ms 4692 KB Output is correct
40 Correct 22 ms 3656 KB Output is correct
41 Correct 117 ms 13656 KB Output is correct
42 Correct 314 ms 41792 KB Output is correct
43 Correct 175 ms 38120 KB Output is correct
44 Correct 197 ms 45156 KB Output is correct
45 Correct 232 ms 45212 KB Output is correct
46 Correct 277 ms 29364 KB Output is correct
47 Correct 333 ms 29664 KB Output is correct
48 Correct 195 ms 43544 KB Output is correct
49 Correct 280 ms 30548 KB Output is correct
50 Correct 286 ms 29980 KB Output is correct
51 Correct 164 ms 33312 KB Output is correct
52 Correct 182 ms 37052 KB Output is correct
53 Correct 167 ms 42876 KB Output is correct
54 Correct 448 ms 44200 KB Output is correct
55 Correct 292 ms 43864 KB Output is correct