oj.uz

Submission #754236

# Submission time Handle Problem Language Result Execution time Memory
754236 2023-06-07T09:58:36 Z lukameladze Parachute rings (IOI12_rings) C++17
52 / 100
 2061 ms 222284 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 = 1e6 + 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;
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:85:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   85 |             for (int x : pot) can[x] = 0; can[a] = 1;
      |             ^~~
rings.cpp:85:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   85 |             for (int x : pot) can[x] = 0; can[a] = 1;
      |                                           ^~~
rings.cpp:91:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for (int i = 0; i < pot.size(); i++) build(pot[i], i);
      |                         ~~^~~~~~~~~~~~
rings.cpp:101:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int i = 0; i < pot.size(); i++) build(pot[i], i);
      |                         ~~^~~~~~~~~~~~
rings.cpp:111:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         for (int i = 0; i < pot.size(); i++) {
      |                         ~~^~~~~~~~~~~~
rings.cpp: In function 'int CountCritical()':
rings.cpp:128:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for (int i = 0; i < pot.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 70732 KB Output is correct
2 Correct 37 ms 71524 KB Output is correct
3 Correct 38 ms 71804 KB Output is correct
4 Correct 34 ms 70880 KB Output is correct
5 Correct 40 ms 71144 KB Output is correct
6 Correct 41 ms 71552 KB Output is correct
7 Correct 36 ms 71208 KB Output is correct
8 Correct 38 ms 71380 KB Output is correct
9 Correct 37 ms 71784 KB Output is correct
10 Correct 39 ms 71672 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 152508 KB Output is correct
2 Incorrect 2061 ms 222284 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 70732 KB Output is correct
2 Correct 37 ms 71524 KB Output is correct
3 Correct 38 ms 71804 KB Output is correct
4 Correct 34 ms 70880 KB Output is correct
5 Correct 40 ms 71144 KB Output is correct
6 Correct 41 ms 71552 KB Output is correct
7 Correct 36 ms 71208 KB Output is correct
8 Correct 38 ms 71380 KB Output is correct
9 Correct 37 ms 71784 KB Output is correct
10 Correct 39 ms 71672 KB Output is correct
11 Correct 39 ms 71756 KB Output is correct
12 Correct 41 ms 72684 KB Output is correct
13 Correct 40 ms 72660 KB Output is correct
14 Correct 38 ms 72380 KB Output is correct
15 Correct 41 ms 73020 KB Output is correct
16 Correct 41 ms 72188 KB Output is correct
17 Correct 43 ms 72660 KB Output is correct
18 Correct 46 ms 73292 KB Output is correct
19 Correct 39 ms 72228 KB Output is correct
20 Correct 42 ms 72628 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 70732 KB Output is correct
2 Correct 37 ms 71524 KB Output is correct
3 Correct 38 ms 71804 KB Output is correct
4 Correct 34 ms 70880 KB Output is correct
5 Correct 40 ms 71144 KB Output is correct
6 Correct 41 ms 71552 KB Output is correct
7 Correct 36 ms 71208 KB Output is correct
8 Correct 38 ms 71380 KB Output is correct
9 Correct 37 ms 71784 KB Output is correct
10 Correct 39 ms 71672 KB Output is correct
11 Correct 39 ms 71756 KB Output is correct
12 Correct 41 ms 72684 KB Output is correct
13 Correct 40 ms 72660 KB Output is correct
14 Correct 38 ms 72380 KB Output is correct
15 Correct 41 ms 73020 KB Output is correct
16 Correct 41 ms 72188 KB Output is correct
17 Correct 43 ms 72660 KB Output is correct
18 Correct 46 ms 73292 KB Output is correct
19 Correct 39 ms 72228 KB Output is correct
20 Correct 42 ms 72628 KB Output is correct
21 Correct 59 ms 75244 KB Output is correct
22 Correct 83 ms 77788 KB Output is correct
23 Correct 97 ms 79692 KB Output is correct
24 Correct 142 ms 83788 KB Output is correct
25 Correct 54 ms 77396 KB Output is correct
26 Correct 126 ms 83896 KB Output is correct
27 Correct 129 ms 82956 KB Output is correct
28 Correct 151 ms 86704 KB Output is correct
29 Correct 99 ms 80472 KB Output is correct
30 Correct 180 ms 85028 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 70732 KB Output is correct
2 Correct 37 ms 71524 KB Output is correct
3 Correct 38 ms 71804 KB Output is correct
4 Correct 34 ms 70880 KB Output is correct
5 Correct 40 ms 71144 KB Output is correct
6 Correct 41 ms 71552 KB Output is correct
7 Correct 36 ms 71208 KB Output is correct
8 Correct 38 ms 71380 KB Output is correct
9 Correct 37 ms 71784 KB Output is correct
10 Correct 39 ms 71672 KB Output is correct
11 Correct 776 ms 152508 KB Output is correct
12 Incorrect 2061 ms 222284 KB Output isn't correct
13 Halted 0 ms 0 KB -