oj.uz

Submission #304670

# Submission time Handle Problem Language Result Execution time Memory
304670 2020-09-21T17:07:36 Z MatijaL Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 269 ms 22392 KB 
/**
 * Author: MatijaL
 * Time: 2020-09-21 15:05:48
**/
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define loop(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i,n,m) for(ll i = n; i <= m; i++)
#define isIn(vec, item) find(vec.begin(), vec.end(), item) != vec.end()
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define inf 1000000005
#define mod 1000000007
const int limit = 1010;
int N;
int component[limit];
int rib[limit];

int parent1[limit];
int rank1[limit];

int find1(int node){
    if(parent1[node] != node) return find1(parent1[node]);
    return node;
}
void un1(int u, int v){
    if(find1(u) == find1(v)) return;
    if(rank1[u] < rank1[v]) swap(u, v);
    if(rank1[u] == rank1[v]) rank1[u]++;
    parent1[v] = u;
}
vector<int> comps[limit];
void resetDsu(){
    loop(i, limit){
        parent1[i] = i;
        rank1[i] = 0;
    }
}


int construct(vector<vector<int>> p){
    N = p.size();
    resetDsu();
    
    //check for 3
    loop(i, N) loop(j, N) if(p[i][j] == 3) return 0;

    //divide into components
    set<int> visited;
    map<int, int> compId;
    int id = 0;
    loop(i, N){
        loop(j, N){
            //gledamo i x i-1
            if(p[i][j] > 0){
                un1(i, j);
            }
        }
    }
    //assign component id
    loop(i, N){
        int loc = find1(i);
        if(visited.count(loc) == 0){
            visited.insert(loc);
            compId[loc] = id++;
        }
        int pos = compId[loc];
        comps[pos].pb(i); 
        component[i] = pos;
    }
    //check collisions
    loop(i, N){
        loop(j, N){
            if(i == j) continue;
            if(component[i] != component[j] and p[i][j] > 0) return 0;
            if(component[i] == component[j] and p[i][j] == 0) return 0;
        }
    }

    resetDsu(); 
    vector<vector<int>> b(N, vector<int>(N, 0));
    //Handle each component
    loop(c, id){
        vector<int> nodes = comps[c];

        //prepare the ribs
        for(auto i : nodes) for(auto j : nodes){
            if(i == j) continue;
            if(p[i][j] == 1) un1(i, j);
        }

        //prepare edges
        vector<int> roots;
        set<int> rootSet;
        for(auto i : nodes){
            int par = find1(i);
            if(rootSet.count(par) == 0){
                rootSet.insert(par);
                roots.pb(par);
            }
            if(par == i) continue;
            b[par][i] = 1;
            b[i][par] = 1;
        }

        //make a loop out of the roots
        if(roots.size() == 2) return 0;
        if(roots.size() > 2){
            loop(i, roots.size()){
                int u = roots[i];
                int v = roots[(i+1)%roots.size()];
                b[u][v] = 1;
                b[v][u] = 1;
            }
        }
        
        //check for collisions
        for(auto i : nodes) for(auto j : nodes){
            if(i == j) continue;
            if(find1(i) != find1(j) and p[i][j] == 1) return 0;
            if(find1(i) == find1(j) and p[i][j] == 2) return 0; 
        }

    
    }
    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 259 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 238 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 123 ms 8312 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 243 ms 22140 KB Output is correct
22 Correct 236 ms 22264 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 238 ms 22264 KB Output is correct
25 Correct 100 ms 8312 KB Output is correct
26 Correct 99 ms 8312 KB Output is correct
27 Correct 269 ms 22256 KB Output is correct
28 Correct 236 ms 22392 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 237 ms 22392 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 257 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 118 ms 8304 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 60 ms 5880 KB Output is correct
22 Correct 244 ms 22264 KB Output is correct
23 Correct 232 ms 22136 KB Output is correct
24 Correct 268 ms 22136 KB Output is correct
25 Correct 97 ms 12284 KB Output is correct
26 Correct 98 ms 8312 KB Output is correct
27 Correct 242 ms 22136 KB Output is correct
28 Correct 259 ms 22136 KB Output is correct
29 Correct 97 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 61 ms 5880 KB Output is correct
5 Correct 239 ms 22136 KB Output is correct
6 Correct 242 ms 22136 KB Output is correct
7 Correct 261 ms 22132 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 61 ms 5860 KB Output is correct
10 Correct 241 ms 22136 KB Output is correct
11 Correct 234 ms 22136 KB Output is correct
12 Correct 261 ms 22260 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 60 ms 5880 KB Output is correct
17 Correct 241 ms 22136 KB Output is correct
18 Correct 246 ms 22136 KB Output is correct
19 Correct 237 ms 22136 KB Output is correct
20 Correct 253 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 259 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 238 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 123 ms 8312 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 243 ms 22140 KB Output is correct
22 Correct 236 ms 22264 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 238 ms 22264 KB Output is correct
25 Correct 100 ms 8312 KB Output is correct
26 Correct 99 ms 8312 KB Output is correct
27 Correct 269 ms 22256 KB Output is correct
28 Correct 236 ms 22392 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 237 ms 22392 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 257 ms 22136 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 118 ms 8304 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 60 ms 5880 KB Output is correct
50 Correct 244 ms 22264 KB Output is correct
51 Correct 232 ms 22136 KB Output is correct
52 Correct 268 ms 22136 KB Output is correct
53 Correct 97 ms 12284 KB Output is correct
54 Correct 98 ms 8312 KB Output is correct
55 Correct 242 ms 22136 KB Output is correct
56 Correct 259 ms 22136 KB Output is correct
57 Correct 97 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 126 ms 8312 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 61 ms 5884 KB Output is correct
66 Correct 100 ms 8304 KB Output is correct
67 Correct 96 ms 8312 KB Output is correct
68 Correct 96 ms 8312 KB Output is correct
69 Correct 96 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 259 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 238 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 123 ms 8312 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 243 ms 22140 KB Output is correct
22 Correct 236 ms 22264 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 238 ms 22264 KB Output is correct
25 Correct 100 ms 8312 KB Output is correct
26 Correct 99 ms 8312 KB Output is correct
27 Correct 269 ms 22256 KB Output is correct
28 Correct 236 ms 22392 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 237 ms 22392 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 257 ms 22136 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 118 ms 8304 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 60 ms 5880 KB Output is correct
50 Correct 244 ms 22264 KB Output is correct
51 Correct 232 ms 22136 KB Output is correct
52 Correct 268 ms 22136 KB Output is correct
53 Correct 97 ms 12284 KB Output is correct
54 Correct 98 ms 8312 KB Output is correct
55 Correct 242 ms 22136 KB Output is correct
56 Correct 259 ms 22136 KB Output is correct
57 Correct 97 ms 12280 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 61 ms 5880 KB Output is correct
62 Correct 239 ms 22136 KB Output is correct
63 Correct 242 ms 22136 KB Output is correct
64 Correct 261 ms 22132 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 61 ms 5860 KB Output is correct
67 Correct 241 ms 22136 KB Output is correct
68 Correct 234 ms 22136 KB Output is correct
69 Correct 261 ms 22260 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 60 ms 5880 KB Output is correct
74 Correct 241 ms 22136 KB Output is correct
75 Correct 246 ms 22136 KB Output is correct
76 Correct 237 ms 22136 KB Output is correct
77 Correct 253 ms 22264 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 640 KB Output is correct
81 Correct 126 ms 8312 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 61 ms 5884 KB Output is correct
86 Correct 100 ms 8304 KB Output is correct
87 Correct 96 ms 8312 KB Output is correct
88 Correct 96 ms 8312 KB Output is correct
89 Correct 96 ms 12280 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 0 ms 384 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 108 ms 8180 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 0 ms 384 KB Output is correct
97 Correct 24 ms 2304 KB Output is correct
98 Correct 92 ms 8184 KB Output is correct
99 Correct 96 ms 8184 KB Output is correct
100 Correct 91 ms 8188 KB Output is correct
101 Correct 92 ms 8184 KB Output is correct
102 Correct 105 ms 8184 KB Output is correct
103 Correct 104 ms 8184 KB Output is correct
104 Correct 104 ms 8184 KB Output is correct
105 Correct 105 ms 8184 KB Output is correct