oj.uz

Submission #316691

# Submission time Handle Problem Language Result Execution time Memory
316691 2020-10-27T10:05:10 Z talant117408 Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 259 ms 26360 KB 
#include "supertrees.h"
#ifdef EVAL
#else 
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

vector <vector <int>> P, ans;
int N, compnum, par[1003], vis[1003], comp[1003];
vector <int> cycle;

void dfs(int u){
    cycle.pb(u);
    vis[u] = 1;
    par[u] = u;
    comp[u] = compnum;
    
    for(int i = 0; i < N; i++){
        if(!vis[i]){
            if(P[u][i] == 1){
                vis[i] = 1;
                par[i] = u;
                comp[i] = compnum;
                ans[i][u] = ans[u][i] = 1;
            }
        } 
    }
    for(int i = 0; i < N; i++){
        if(!vis[i]){
            if(P[u][i] == 2){
                dfs(i);
            }
        } 
    }
}

int construct(vector<vector<int>> p){
    P = p;
    N = sz(p);
    ans.resize(N, vector <int> (N));
    
    for(int i = 0; i < N; i++){
        if(!vis[i]){
            dfs(i);
            if(sz(cycle) == 2) return 0;
            else if(sz(cycle) > 2){
                for(int j = 0; j < sz(cycle); j++){
                    ans[cycle[j]][cycle[(j+1)%sz(cycle)]] = ans[cycle[(j+1)%sz(cycle)]][cycle[j]] = 1;
                }
            }
            ++compnum;
            cycle.clear();
        }
    }
    
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(par[i] == par[j] && p[i][j] != 1) return 0;
            if(comp[i] == comp[j] && par[i] != par[j] && p[i][j] != 2) return 0;
            if(comp[i] != comp[j] && p[i][j]) return 0;
        }
    }
    
    build(ans);
    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 0 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 246 ms 26104 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 0 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 246 ms 26104 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 239 ms 26108 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 106 ms 16248 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 6792 KB Output is correct
21 Correct 237 ms 26104 KB Output is correct
22 Correct 237 ms 26104 KB Output is correct
23 Correct 245 ms 25976 KB Output is correct
24 Correct 239 ms 26104 KB Output is correct
25 Correct 102 ms 16120 KB Output is correct
26 Correct 99 ms 16224 KB Output is correct
27 Correct 251 ms 25980 KB Output is correct
28 Correct 237 ms 26104 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 0 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 256 KB Output is correct
8 Correct 10 ms 1408 KB Output is correct
9 Correct 238 ms 26104 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 259 ms 26076 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 110 ms 16120 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 61 ms 6868 KB Output is correct
22 Correct 245 ms 26104 KB Output is correct
23 Correct 240 ms 26076 KB Output is correct
24 Correct 255 ms 26360 KB Output is correct
25 Correct 104 ms 16120 KB Output is correct
26 Correct 103 ms 16188 KB Output is correct
27 Correct 246 ms 26108 KB Output is correct
28 Correct 255 ms 26104 KB Output is correct
29 Correct 99 ms 16092 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 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 60 ms 6776 KB Output is correct
5 Correct 237 ms 26108 KB Output is correct
6 Correct 238 ms 26108 KB Output is correct
7 Correct 249 ms 26104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 61 ms 6776 KB Output is correct
10 Correct 243 ms 26232 KB Output is correct
11 Correct 241 ms 26104 KB Output is correct
12 Correct 252 ms 26104 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 63 ms 6776 KB Output is correct
17 Correct 247 ms 26104 KB Output is correct
18 Correct 244 ms 26104 KB Output is correct
19 Correct 238 ms 26104 KB Output is correct
20 Correct 238 ms 26116 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 0 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 246 ms 26104 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 239 ms 26108 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 106 ms 16248 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 6792 KB Output is correct
21 Correct 237 ms 26104 KB Output is correct
22 Correct 237 ms 26104 KB Output is correct
23 Correct 245 ms 25976 KB Output is correct
24 Correct 239 ms 26104 KB Output is correct
25 Correct 102 ms 16120 KB Output is correct
26 Correct 99 ms 16224 KB Output is correct
27 Correct 251 ms 25980 KB Output is correct
28 Correct 237 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 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 256 KB Output is correct
36 Correct 10 ms 1408 KB Output is correct
37 Correct 238 ms 26104 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 259 ms 26076 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 110 ms 16120 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 6868 KB Output is correct
50 Correct 245 ms 26104 KB Output is correct
51 Correct 240 ms 26076 KB Output is correct
52 Correct 255 ms 26360 KB Output is correct
53 Correct 104 ms 16120 KB Output is correct
54 Correct 103 ms 16188 KB Output is correct
55 Correct 246 ms 26108 KB Output is correct
56 Correct 255 ms 26104 KB Output is correct
57 Correct 99 ms 16092 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 1024 KB Output is correct
61 Correct 111 ms 16120 KB Output is correct
62 Correct 1 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 63 ms 6868 KB Output is correct
66 Correct 104 ms 16120 KB Output is correct
67 Correct 104 ms 16124 KB Output is correct
68 Correct 101 ms 16120 KB Output is correct
69 Correct 97 ms 16120 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 0 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 246 ms 26104 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 239 ms 26108 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 106 ms 16248 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 6792 KB Output is correct
21 Correct 237 ms 26104 KB Output is correct
22 Correct 237 ms 26104 KB Output is correct
23 Correct 245 ms 25976 KB Output is correct
24 Correct 239 ms 26104 KB Output is correct
25 Correct 102 ms 16120 KB Output is correct
26 Correct 99 ms 16224 KB Output is correct
27 Correct 251 ms 25980 KB Output is correct
28 Correct 237 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 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 256 KB Output is correct
36 Correct 10 ms 1408 KB Output is correct
37 Correct 238 ms 26104 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 259 ms 26076 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 110 ms 16120 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 6868 KB Output is correct
50 Correct 245 ms 26104 KB Output is correct
51 Correct 240 ms 26076 KB Output is correct
52 Correct 255 ms 26360 KB Output is correct
53 Correct 104 ms 16120 KB Output is correct
54 Correct 103 ms 16188 KB Output is correct
55 Correct 246 ms 26108 KB Output is correct
56 Correct 255 ms 26104 KB Output is correct
57 Correct 99 ms 16092 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 60 ms 6776 KB Output is correct
62 Correct 237 ms 26108 KB Output is correct
63 Correct 238 ms 26108 KB Output is correct
64 Correct 249 ms 26104 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 61 ms 6776 KB Output is correct
67 Correct 243 ms 26232 KB Output is correct
68 Correct 241 ms 26104 KB Output is correct
69 Correct 252 ms 26104 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 288 KB Output is correct
72 Correct 1 ms 512 KB Output is correct
73 Correct 63 ms 6776 KB Output is correct
74 Correct 247 ms 26104 KB Output is correct
75 Correct 244 ms 26104 KB Output is correct
76 Correct 238 ms 26104 KB Output is correct
77 Correct 238 ms 26116 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 1024 KB Output is correct
81 Correct 111 ms 16120 KB Output is correct
82 Correct 1 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 63 ms 6868 KB Output is correct
86 Correct 104 ms 16120 KB Output is correct
87 Correct 104 ms 16124 KB Output is correct
88 Correct 101 ms 16120 KB Output is correct
89 Correct 97 ms 16120 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 5 ms 1024 KB Output is correct
93 Correct 110 ms 16120 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 0 ms 384 KB Output is correct
97 Correct 26 ms 4344 KB Output is correct
98 Correct 103 ms 16120 KB Output is correct
99 Correct 107 ms 16120 KB Output is correct
100 Correct 102 ms 16124 KB Output is correct
101 Correct 104 ms 16120 KB Output is correct
102 Correct 114 ms 16120 KB Output is correct
103 Correct 111 ms 16376 KB Output is correct
104 Correct 111 ms 16120 KB Output is correct
105 Correct 110 ms 16092 KB Output is correct