oj.uz

Submission #300955

# Submission time Handle Problem Language Result Execution time Memory
300955 2020-09-17T15:27:23 Z rocks03 Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 281 ms 22264 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;

void build(vector<vector<int>> _b);

const int MAXN = 1e3+100;
int p[MAXN], sz[MAXN];
void init(int n){
    iota(p, p+n, 0);
    fill(sz, sz+n, 1);
}

int find_parent(int x){
    if(x == p[x])
        return x;
    return p[x] = find_parent(p[x]);
}

bool same_set(int a, int b){
    return (find_parent(a) == find_parent(b));
}

void union_set(int a, int b){
    a = find_parent(a);
    b = find_parent(b);
    if(a == b)
        return;
    if(sz[a] < sz[b])
        swap(a, b);
    p[b] = a;
    sz[a] += sz[b];
}

int p2[MAXN], sz2[MAXN];
void init2(int n){
    iota(p2, p2+n, 0);
    fill(sz2, sz2+n, 1);
}

int find2(int x){
    if(x == p2[x])
        return x;
    return p2[x] = find2(p2[x]);
}

bool same2(int a, int b){
    return (find2(a) == find2(b));
}

void union2(int a, int b){
    a = find2(a);
    b = find2(b);
    if(a == b)
        return;
    if(sz2[a] < sz2[b])
        swap(a, b);
    p2[b] = a;
    sz2[a] += sz2[b];
}

int construct(vector<vector<int>> p){
    int N = SZ(p);
    init(N);
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(p[i][j] > 0){
                union_set(i, j);
            }
        }
    }
    vector<vector<int>> ans(N, vector<int>(N, 0));
    vector<bool> vis(N, false), vis2(N, false), touse(N, false);
    init2(N);
    for(int i = 0; i < N; i++){
        int v = find_parent(i);
        if(!vis[v]){
            vis[v] = true;
            vector<int> vertici;
            vertici.pb(i);
            for(int j = i+1; j < N; j++){
                if(same_set(i, j)){
                    vertici.pb(j);
                }
            }
            for(int j = 0; j < SZ(vertici); j++){
                for(int k = 0; k < SZ(vertici); k++){
                    if(p[vertici[j]][vertici[k]] == 0){
                        return 0;
                    }
                }
            }
            bool onlyone = true;
            for(int j = 0; j < SZ(vertici); j++){
                for(int k = 0; k < SZ(vertici); k++){
                    if(p[vertici[j]][vertici[k]] != 1){
                        onlyone = false;
                    }
                }
            }
            if(onlyone){
                for(int j = 1; j < SZ(vertici); j++){
                    ans[vertici[j-1]][vertici[j]] = 1;
                    ans[vertici[j]][vertici[j-1]] = 1;
                }
                continue;
            }
            for(int j = 0; j < SZ(vertici); j++){
                for(int k = j + 1; k < SZ(vertici); k++){
                    int v1 = vertici[j], v2 = vertici[k];
                    if(p[v1][v2] == 1){
                        union2(v1, v2);
                        touse[find2(v1)] = true;
                    }
                }
            }
            set<int> l, c, r;
            for(int j = 0; j < SZ(vertici); j++){
                int root = find2(vertici[j]);
                if(!touse[root] || vis2[root]) continue;
                vis2[root] = true;
                if(SZ(l) && SZ(r)) return 0;
                bool is = false;
                if(!SZ(l)){
                    l.insert(vertici[j]);
                    is = true;
                }
                else{
                    r.insert(vertici[j]);
                }
                for(int k = j+1; k < SZ(vertici); k++){
                    if(same2(vertici[j], vertici[k])){
                        if(is){
                            l.insert(vertici[k]);
                        } else{
                            r.insert(vertici[k]);
                        }
                    }
                }
            }
            for(auto x : vertici){
                if(l.find(x) == l.end() && r.find(x) == r.end()){
                    c.insert(x);
                }
            }
            int last = -1;
            for(auto x : l){
                if(last != -1){
                    ans[last][x] = ans[x][last] = 1;
                }
                last = x;
            }
            for(auto x : c){
                if(last != -1){
                    ans[last][x] = ans[x][last] = 1;
                }
                last = x;
            }
            for(auto x : r){
                ans[last][x] = ans[x][last] = 1;
                last = x;
            }
            int da, a;
            if(!SZ(l)){
                da = *c.begin(), a = *c.rbegin();
            } else{
                da = *l.rbegin(), a = *c.rbegin();
            }
            ans[da][a] = ans[a][da] = 1;
        }
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 259 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 259 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 125 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 247 ms 22140 KB Output is correct
22 Correct 249 ms 22136 KB Output is correct
23 Correct 281 ms 22108 KB Output is correct
24 Correct 250 ms 22264 KB Output is correct
25 Correct 115 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 264 ms 22136 KB Output is correct
28 Correct 247 ms 22104 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 0 ms 384 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 72 ms 5880 KB Output is correct
5 Correct 251 ms 22136 KB Output is correct
6 Correct 249 ms 22136 KB Output is correct
7 Correct 259 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 63 ms 5880 KB Output is correct
10 Correct 253 ms 22112 KB Output is correct
11 Correct 254 ms 22136 KB Output is correct
12 Correct 265 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Incorrect 28 ms 3328 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 259 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 125 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 247 ms 22140 KB Output is correct
22 Correct 249 ms 22136 KB Output is correct
23 Correct 281 ms 22108 KB Output is correct
24 Correct 250 ms 22264 KB Output is correct
25 Correct 115 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 264 ms 22136 KB Output is correct
28 Correct 247 ms 22104 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 0 ms 384 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 259 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 125 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 247 ms 22140 KB Output is correct
22 Correct 249 ms 22136 KB Output is correct
23 Correct 281 ms 22108 KB Output is correct
24 Correct 250 ms 22264 KB Output is correct
25 Correct 115 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 264 ms 22136 KB Output is correct
28 Correct 247 ms 22104 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 0 ms 384 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -