oj.uz

Submission #488036

# Submission time Handle Problem Language Result Execution time Memory
488036 2021-11-17T12:59:21 Z SlavicG Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 198 ms 26124 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
struct DSU{
    int n;
    vector<int> par, s;
 
    DSU(int N){
        n = N;
        s.assign(n, 1), par.resize(n);
        iota(all(par), 0);
    }
 
    int get(int a){
        return par[a] = (a == par[a] ? a : get(par[a]));
    }
 
    void uni(int a, int b){
        a = get(a), b = get(b);
        if(s[a] > s[b])swap(a, b);
        par[a] = b, s[b] += s[a];
    }
 
    int get_size(int a){
        return s[get(a)];
    }
    bool same_set(int a, int b){
        return get(a) == get(b);
    }
};
 
const int N = 1005;
vector<int> adj[N], adj2[N];
vector<int> component;
bool vis[N];

void dfs(int u){
    component.pb(u);
    vis[u] = true;
    for(int v: adj[u])if(!vis[v])dfs(v);
}
 
int construct(vector<vector<int>> p){
    int n = sz(p);
    vector<vector<int>> ans(n, vector<int>(n, 0));
    
    forn(i,n)adj[i].clear(), adj2[i].clear();
    DSU d(n);
    DSU fuck(n);    
    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            if(i == j)continue;
            if(p[i][j] != p[j][i])return 0;
        }
    }
    for(int i = 0;i < n; ++i){
        vis[i] = false;
        for(int j = 0;j < n; ++j){
            if(p[i][j] == 2 && i != j){
                adj[i].pb(j);
            }
            if(p[i][j] == 1 && i != j){
                adj2[i].pb(j);
            }
        }
    }
 
    for(int i = 0;i < n; ++i){
        if(!vis[i]){
            component.clear();
            dfs(i);

            if(sz(component) == 2)return 0;
            for(int i = 0;i < sz(component); ++i){
                if(sz(component) > 1)ans[component[i]][component[(i + 1) % sz(component)]] = ans[component[(i + 1) % sz(component)]][component[i]] = 1;
                fuck.uni(component[i], component[(i + 1) % sz(component)]);
            }
 
            int prev = -1;
            for(int u: component){
                for(int v: adj2[u]){
                    if(!d.same_set(u, v)){
                        ans[u][v] = ans[v][u] = 1;
                        d.uni(u, v);
                    }
                }
                if(prev != -1)d.uni(prev, u);
 
                prev = u;
            }
        }
    }
    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            if(i == j)continue;
            if(ans[i][j] && !p[i][j])return 0;
            if(fuck.same_set(i, j) && !p[i][j])return 0;
            if(d.same_set(i, j) && !p[i][j])return 0;
        }
    }
    for(int i = 0;i < n; ++i){
        adj[i].clear();
        adj2[i].clear();
        vis[i] = false;
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1392 KB Output is correct
7 Correct 182 ms 26036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1392 KB Output is correct
7 Correct 182 ms 26036 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 166 ms 22052 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 91 ms 14512 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 45 ms 5804 KB Output is correct
21 Correct 180 ms 22724 KB Output is correct
22 Correct 170 ms 22056 KB Output is correct
23 Correct 198 ms 24116 KB Output is correct
24 Correct 175 ms 22084 KB Output is correct
25 Correct 77 ms 12600 KB Output is correct
26 Correct 75 ms 12100 KB Output is correct
27 Correct 194 ms 25048 KB Output is correct
28 Correct 165 ms 22072 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 7 ms 1172 KB Output is correct
9 Correct 166 ms 22060 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 9 ms 1428 KB Output is correct
13 Correct 187 ms 26124 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 85 ms 14644 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 45 ms 5808 KB Output is correct
22 Correct 180 ms 22540 KB Output is correct
23 Correct 177 ms 22032 KB Output is correct
24 Correct 195 ms 25144 KB Output is correct
25 Correct 71 ms 12100 KB Output is correct
26 Correct 72 ms 12588 KB Output is correct
27 Correct 177 ms 22060 KB Output is correct
28 Correct 188 ms 24132 KB Output is correct
29 Correct 71 ms 12080 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 47 ms 5852 KB Output is correct
5 Correct 175 ms 22612 KB Output is correct
6 Correct 171 ms 22056 KB Output is correct
7 Correct 190 ms 24120 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 46 ms 5828 KB Output is correct
10 Correct 183 ms 22580 KB Output is correct
11 Correct 178 ms 22056 KB Output is correct
12 Correct 189 ms 25140 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Incorrect 0 ms 332 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1392 KB Output is correct
7 Correct 182 ms 26036 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 166 ms 22052 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 91 ms 14512 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 45 ms 5804 KB Output is correct
21 Correct 180 ms 22724 KB Output is correct
22 Correct 170 ms 22056 KB Output is correct
23 Correct 198 ms 24116 KB Output is correct
24 Correct 175 ms 22084 KB Output is correct
25 Correct 77 ms 12600 KB Output is correct
26 Correct 75 ms 12100 KB Output is correct
27 Correct 194 ms 25048 KB Output is correct
28 Correct 165 ms 22072 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 7 ms 1172 KB Output is correct
37 Correct 166 ms 22060 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 9 ms 1428 KB Output is correct
41 Correct 187 ms 26124 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 85 ms 14644 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 45 ms 5808 KB Output is correct
50 Correct 180 ms 22540 KB Output is correct
51 Correct 177 ms 22032 KB Output is correct
52 Correct 195 ms 25144 KB Output is correct
53 Correct 71 ms 12100 KB Output is correct
54 Correct 72 ms 12588 KB Output is correct
55 Correct 177 ms 22060 KB Output is correct
56 Correct 188 ms 24132 KB Output is correct
57 Correct 71 ms 12080 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 4 ms 972 KB Output is correct
61 Correct 89 ms 16184 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 0 ms 332 KB Output is correct
65 Incorrect 46 ms 5736 KB Too many ways to get from 1 to 183, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 9 ms 1392 KB Output is correct
7 Correct 182 ms 26036 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 166 ms 22052 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 91 ms 14512 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 45 ms 5804 KB Output is correct
21 Correct 180 ms 22724 KB Output is correct
22 Correct 170 ms 22056 KB Output is correct
23 Correct 198 ms 24116 KB Output is correct
24 Correct 175 ms 22084 KB Output is correct
25 Correct 77 ms 12600 KB Output is correct
26 Correct 75 ms 12100 KB Output is correct
27 Correct 194 ms 25048 KB Output is correct
28 Correct 165 ms 22072 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 7 ms 1172 KB Output is correct
37 Correct 166 ms 22060 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 9 ms 1428 KB Output is correct
41 Correct 187 ms 26124 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 85 ms 14644 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 45 ms 5808 KB Output is correct
50 Correct 180 ms 22540 KB Output is correct
51 Correct 177 ms 22032 KB Output is correct
52 Correct 195 ms 25144 KB Output is correct
53 Correct 71 ms 12100 KB Output is correct
54 Correct 72 ms 12588 KB Output is correct
55 Correct 177 ms 22060 KB Output is correct
56 Correct 188 ms 24132 KB Output is correct
57 Correct 71 ms 12080 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 47 ms 5852 KB Output is correct
62 Correct 175 ms 22612 KB Output is correct
63 Correct 171 ms 22056 KB Output is correct
64 Correct 190 ms 24120 KB Output is correct
65 Correct 0 ms 332 KB Output is correct
66 Correct 46 ms 5828 KB Output is correct
67 Correct 183 ms 22580 KB Output is correct
68 Correct 178 ms 22056 KB Output is correct
69 Correct 189 ms 25140 KB Output is correct
70 Correct 0 ms 332 KB Output is correct
71 Correct 0 ms 332 KB Output is correct
72 Incorrect 0 ms 332 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -