oj.uz

Submission #754235

# Submission time Handle Problem Language Result Execution time Memory
754235 2023-06-07T09:58:00 Z lukameladze Parachute rings (IOI12_rings) C++17
52 / 100
 174 ms 48400 KB 
# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair <int, int>
#define pb push_back
const int MX = 3e5 + 5;
int n, a, b, p[MX], num_of_edges[MX],bad_deg[MX],par[4][MX],sz[MX],cnt_cyc = 0,cyc_len = 0, num_of_cycles[MX],cycles[MX];
int deg_[4][MX], in_deg[MX],can[MX];
vector <int> v[MX], pot;
// we have at most/in total 4 potential critical rings after "the" moment so we need to maintain DSU for each of them
void Init(int N_) {
    n = N_;
    for (int i = 1; i <= n; i++) p[i] = i, sz[i] = 1;
}
int get_col(int a) {
    if (a == p[a]) return a;
    else return p[a] = get_col(p[a]);
}
void col(int a, int b) {
    a = get_col(a);
    b = get_col(b);
    if (a == b) {
        num_of_edges[a]++;
        cnt_cyc++;
        cyc_len = sz[a];
        num_of_cycles[a]++;
        return ;
    }
    if (sz[a] < sz[b]) swap(a, b);
    num_of_edges[a] += num_of_edges[b];
    sz[a] += sz[b];
    p[b] = a;
    num_of_cycles[a] += num_of_cycles[b];
    sz[b] = 0; num_of_cycles[b] = 0; num_of_edges[b] = 0;
}

int get_col(int a, int ty) {
    if (a == par[ty][a]) return a;
    else return par[ty][a] = get_col(par[ty][a], ty);
}
void join(int a, int b, int ty) {
    // cout<<"join "<<a<<" "<<get_col(a, ty)<<" "<<b<<" "<<get_col(b, ty)<<" "<<ty<<"\n";
     deg_[ty][a]++; deg_[ty][b]++;
    a = get_col(a, ty);
    b = get_col(b, ty);

    if (a == b) {
    //    cout<<"tyy "<<ty<<"\n";
        cycles[ty]++;
        return ;
    }

    if(deg_[ty][a] > 2 || deg_[ty][b] > 2) bad_deg[ty] = 1;
    par[ty][b] = a;
}

void build(int a, int ty) {
    //cout<<"build  "<<ty<<" "<<a<<"\n";
    for (int i = 1; i <= n; i++) {
        par[ty][i] = i;
    }
    for (int i = 1; i <= n; i++) {
        for (int x : v[i]) {
            if (i != a && x != a && i < x) join(i, x, ty);
        }
    }
}
map <int, bool> adj[MX];
void Link(int A, int B) {
    A++; B++;
    a = A; b = B;
    in_deg[a]++; in_deg[b]++;
    adj[a][b] = 1; adj[b][a] = 1;
    v[a].pb(b); v[b].pb(a);
    int ff = 0;
    if (in_deg[a] == 4) {
        assert(pot.size());
        int is_a = 0;
        for (int x : pot) if (x == a) is_a = 1;

        if (is_a == 0) {
            pot.clear(); pot.pb(-1);
            return ;
        } else {
            for (int x : pot) can[x] = 0; can[a] = 1;
        }
    }
    if (in_deg[a] == 3 && !pot.size()) {
        pot.pb(a); can[a]  = 1; ff = 1;
        for (int x : v[a]) pot.pb(x),can[x] = 1;
        for (int i = 0; i < pot.size(); i++) build(pot[i], i);
    } else if (in_deg[a] == 3 && pot.size()) {
        for (int x : pot) {
            if (x != a && adj[a][x] != 1) can[x] = 0;
        }
    }

    if (in_deg[b] == 3 && !pot.size()) { //cout<<"add\n";
        pot.pb(b); can[b]  = 1; ff = 1;
        for (int x : v[b]) pot.pb(x),can[x] = 1;
        for (int i = 0; i < pot.size(); i++) build(pot[i], i);
    } else if (in_deg[b] == 3 && pot.size()) {
        for (int x : pot) {
            if (x != b && adj[b][x] != 1) can[x] = 0;
        }
    }

    col(a, b);
    if (pot.size() && pot[0] != -1 ) {
        //cout<<"pot ";
        for (int i = 0; i < pot.size(); i++) {
        //        cout<<pot[i]<<" ";
            if (a != pot[i] && b != pot[i] && !ff) join(a, b, i);
        }
       // cout<<"\n";
    }
}
int CountCritical() {
    if (!pot.size()) {
        if (cnt_cyc > 1) return 0;
        if (cnt_cyc == 0) return n;
        if (cnt_cyc == 1) return cyc_len;
    }
    if (pot.size() && pot[0] == -1) {
        return 0;
    }
    int res = 0;
    for (int i = 0; i < pot.size(); i++) {
       // cout<<cycles[i]<<"       "<<bad_deg[i]<<" "<<can[pot[i]]<<"\n";
        if (!can[pot[i]]) continue;

        if (!cycles[i] && !bad_deg[i]) res++;
    }
    return res;
}

Compilation message

rings.cpp: In function 'void Link(int, int)':
rings.cpp:86:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   86 |             for (int x : pot) can[x] = 0; can[a] = 1;
      |             ^~~
rings.cpp:86:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   86 |             for (int x : pot) can[x] = 0; can[a] = 1;
      |                                           ^~~
rings.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for (int i = 0; i < pot.size(); i++) build(pot[i], i);
      |                         ~~^~~~~~~~~~~~
rings.cpp:102:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |         for (int i = 0; i < pot.size(); i++) build(pot[i], i);
      |                         ~~^~~~~~~~~~~~
rings.cpp:112:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for (int i = 0; i < pot.size(); i++) {
      |                         ~~^~~~~~~~~~~~
rings.cpp: In function 'int CountCritical()':
rings.cpp:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |     for (int i = 0; i < pot.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 17 ms 22252 KB Output is correct
3 Correct 14 ms 22392 KB Output is correct
4 Correct 13 ms 21576 KB Output is correct
5 Correct 12 ms 21852 KB Output is correct
6 Correct 14 ms 22256 KB Output is correct
7 Correct 12 ms 21844 KB Output is correct
8 Correct 14 ms 22040 KB Output is correct
9 Correct 16 ms 22392 KB Output is correct
10 Correct 17 ms 22496 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 48400 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 17 ms 22252 KB Output is correct
3 Correct 14 ms 22392 KB Output is correct
4 Correct 13 ms 21576 KB Output is correct
5 Correct 12 ms 21852 KB Output is correct
6 Correct 14 ms 22256 KB Output is correct
7 Correct 12 ms 21844 KB Output is correct
8 Correct 14 ms 22040 KB Output is correct
9 Correct 16 ms 22392 KB Output is correct
10 Correct 17 ms 22496 KB Output is correct
11 Correct 17 ms 22516 KB Output is correct
12 Correct 21 ms 23460 KB Output is correct
13 Correct 18 ms 23380 KB Output is correct
14 Correct 17 ms 23172 KB Output is correct
15 Correct 19 ms 23764 KB Output is correct
16 Correct 21 ms 23016 KB Output is correct
17 Correct 18 ms 23456 KB Output is correct
18 Correct 24 ms 24028 KB Output is correct
19 Correct 19 ms 22952 KB Output is correct
20 Correct 20 ms 23360 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 17 ms 22252 KB Output is correct
3 Correct 14 ms 22392 KB Output is correct
4 Correct 13 ms 21576 KB Output is correct
5 Correct 12 ms 21852 KB Output is correct
6 Correct 14 ms 22256 KB Output is correct
7 Correct 12 ms 21844 KB Output is correct
8 Correct 14 ms 22040 KB Output is correct
9 Correct 16 ms 22392 KB Output is correct
10 Correct 17 ms 22496 KB Output is correct
11 Correct 17 ms 22516 KB Output is correct
12 Correct 21 ms 23460 KB Output is correct
13 Correct 18 ms 23380 KB Output is correct
14 Correct 17 ms 23172 KB Output is correct
15 Correct 19 ms 23764 KB Output is correct
16 Correct 21 ms 23016 KB Output is correct
17 Correct 18 ms 23456 KB Output is correct
18 Correct 24 ms 24028 KB Output is correct
19 Correct 19 ms 22952 KB Output is correct
20 Correct 20 ms 23360 KB Output is correct
21 Correct 42 ms 26296 KB Output is correct
22 Correct 58 ms 29076 KB Output is correct
23 Correct 73 ms 31144 KB Output is correct
24 Correct 143 ms 35200 KB Output is correct
25 Correct 31 ms 28172 KB Output is correct
26 Correct 93 ms 35404 KB Output is correct
27 Correct 95 ms 34620 KB Output is correct
28 Correct 174 ms 38364 KB Output is correct
29 Correct 63 ms 31692 KB Output is correct
30 Correct 138 ms 36808 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 17 ms 22252 KB Output is correct
3 Correct 14 ms 22392 KB Output is correct
4 Correct 13 ms 21576 KB Output is correct
5 Correct 12 ms 21852 KB Output is correct
6 Correct 14 ms 22256 KB Output is correct
7 Correct 12 ms 21844 KB Output is correct
8 Correct 14 ms 22040 KB Output is correct
9 Correct 16 ms 22392 KB Output is correct
10 Correct 17 ms 22496 KB Output is correct
11 Runtime error 30 ms 48400 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -