oj.uz

Submission #421997

# Submission time Handle Problem Language Result Execution time Memory
421997 2021-06-09T14:35:58 Z OttoTheDino Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 254 ms 24044 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;

int construct (vector<vi> p) {
    int n = p.size();

    int sup[n], tree[n], spec[n];
    memset(sup,-1,4*n), memset(tree,-1,4*n);

    rep (i,0,n-1) {
        if (sup[i]==-1) {
            bool two = 0;
            rep (j,0,n-1) {
                if (p[i][j]==3) return 0;
                if (p[i][j]==1 || p[i][j]==2) {
                    if (sup[i]==-1) sup[i] = sup[j] = j;
                    else sup[j] = sup[i];
                    if (p[i][j]==1) {
                        if (tree[i]==-1) tree[i] = tree[j] = j;
                        else tree[j] = tree[i];
                    }
                    else two = 1;
                }
                else if (i==j) return 0;
            }
            spec[sup[i]] = !two;
        }
        else if (tree[i]==-1) {
            rep (j,0,n-1) {
                if (p[i][j]==3) return 0;
                if (p[i][j]==1 || p[i][j]==2) {
                    if (p[sup[i]][j] != 1 && p[sup[i]][j] != 2) return 0;
                    if (p[i][j]==1) {
                        if (tree[i]==-1) tree[i] = tree[j] = j;
                        else tree[j] = tree[i];
                    }
                }
                else if (p[sup[i]][j]) return 0;
            }
        }
        else rep (j,0,n-1) if (p[tree[i]][j]!=p[i][j]) return 0;
    }

    vector<vi> b(n,vi(n,0));
    rep (i,0,n-1) {
        if (i==sup[i]) {
            int last = i, cnt = 0;
            rep (j,0,n-1) {
                if (sup[j]==i && j==tree[j]) cnt++;
                if (i==j || sup[j]!=i) continue;
                if (j==tree[j]) {
                    if (spec[i]) continue;
                    b[j][last] = b[last][j] = 1;
                    last = j;
                }
                else b[j][tree[j]] = b[tree[j]][j] = 1;
            }
            if (last!=i && !spec[i]) b[last][i] = b[i][last] = 1;
            if (!spec[i] && cnt==2) return 0;
        }
    }

	build(b);        
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 234 ms 22016 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 234 ms 22016 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 244 ms 22020 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 700 KB Output is correct
17 Correct 132 ms 8072 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 78 ms 5740 KB Output is correct
21 Correct 248 ms 21928 KB Output is correct
22 Correct 225 ms 21968 KB Output is correct
23 Correct 254 ms 22140 KB Output is correct
24 Correct 229 ms 22012 KB Output is correct
25 Correct 102 ms 8072 KB Output is correct
26 Correct 91 ms 8132 KB Output is correct
27 Correct 239 ms 22020 KB Output is correct
28 Correct 236 ms 21992 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 14 ms 1164 KB Output is correct
9 Correct 230 ms 22008 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 230 ms 22028 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 588 KB Output is correct
17 Correct 99 ms 8060 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 59 ms 5760 KB Output is correct
22 Correct 236 ms 22020 KB Output is correct
23 Correct 228 ms 22024 KB Output is correct
24 Correct 232 ms 22084 KB Output is correct
25 Correct 95 ms 12028 KB Output is correct
26 Correct 97 ms 10092 KB Output is correct
27 Correct 225 ms 24044 KB Output is correct
28 Correct 250 ms 24040 KB Output is correct
29 Correct 111 ms 14072 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 56 ms 5756 KB Output is correct
5 Correct 231 ms 21948 KB Output is correct
6 Correct 223 ms 21956 KB Output is correct
7 Correct 236 ms 21976 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 58 ms 5756 KB Output is correct
10 Correct 242 ms 21928 KB Output is correct
11 Correct 233 ms 22024 KB Output is correct
12 Correct 234 ms 22012 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 60 ms 5752 KB Output is correct
17 Correct 238 ms 22020 KB Output is correct
18 Correct 239 ms 21960 KB Output is correct
19 Correct 253 ms 21952 KB Output is correct
20 Correct 239 ms 22008 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 234 ms 22016 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 244 ms 22020 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 700 KB Output is correct
17 Correct 132 ms 8072 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 78 ms 5740 KB Output is correct
21 Correct 248 ms 21928 KB Output is correct
22 Correct 225 ms 21968 KB Output is correct
23 Correct 254 ms 22140 KB Output is correct
24 Correct 229 ms 22012 KB Output is correct
25 Correct 102 ms 8072 KB Output is correct
26 Correct 91 ms 8132 KB Output is correct
27 Correct 239 ms 22020 KB Output is correct
28 Correct 236 ms 21992 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 14 ms 1164 KB Output is correct
37 Correct 230 ms 22008 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 230 ms 22028 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 99 ms 8060 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 59 ms 5760 KB Output is correct
50 Correct 236 ms 22020 KB Output is correct
51 Correct 228 ms 22024 KB Output is correct
52 Correct 232 ms 22084 KB Output is correct
53 Correct 95 ms 12028 KB Output is correct
54 Correct 97 ms 10092 KB Output is correct
55 Correct 225 ms 24044 KB Output is correct
56 Correct 250 ms 24040 KB Output is correct
57 Correct 111 ms 14072 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 5 ms 588 KB Output is correct
61 Correct 100 ms 10020 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 60 ms 6168 KB Output is correct
66 Correct 96 ms 10108 KB Output is correct
67 Correct 95 ms 10104 KB Output is correct
68 Correct 97 ms 10124 KB Output is correct
69 Correct 97 ms 14072 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 234 ms 22016 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 244 ms 22020 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 700 KB Output is correct
17 Correct 132 ms 8072 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 78 ms 5740 KB Output is correct
21 Correct 248 ms 21928 KB Output is correct
22 Correct 225 ms 21968 KB Output is correct
23 Correct 254 ms 22140 KB Output is correct
24 Correct 229 ms 22012 KB Output is correct
25 Correct 102 ms 8072 KB Output is correct
26 Correct 91 ms 8132 KB Output is correct
27 Correct 239 ms 22020 KB Output is correct
28 Correct 236 ms 21992 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 14 ms 1164 KB Output is correct
37 Correct 230 ms 22008 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 230 ms 22028 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 99 ms 8060 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 59 ms 5760 KB Output is correct
50 Correct 236 ms 22020 KB Output is correct
51 Correct 228 ms 22024 KB Output is correct
52 Correct 232 ms 22084 KB Output is correct
53 Correct 95 ms 12028 KB Output is correct
54 Correct 97 ms 10092 KB Output is correct
55 Correct 225 ms 24044 KB Output is correct
56 Correct 250 ms 24040 KB Output is correct
57 Correct 111 ms 14072 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 56 ms 5756 KB Output is correct
62 Correct 231 ms 21948 KB Output is correct
63 Correct 223 ms 21956 KB Output is correct
64 Correct 236 ms 21976 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 58 ms 5756 KB Output is correct
67 Correct 242 ms 21928 KB Output is correct
68 Correct 233 ms 22024 KB Output is correct
69 Correct 234 ms 22012 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 60 ms 5752 KB Output is correct
74 Correct 238 ms 22020 KB Output is correct
75 Correct 239 ms 21960 KB Output is correct
76 Correct 253 ms 21952 KB Output is correct
77 Correct 239 ms 22008 KB Output is correct
78 Correct 0 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 5 ms 588 KB Output is correct
81 Correct 100 ms 10020 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 60 ms 6168 KB Output is correct
86 Correct 96 ms 10108 KB Output is correct
87 Correct 95 ms 10104 KB Output is correct
88 Correct 97 ms 10124 KB Output is correct
89 Correct 97 ms 14072 KB Output is correct
90 Correct 1 ms 204 KB Output is correct
91 Correct 1 ms 292 KB Output is correct
92 Correct 5 ms 588 KB Output is correct
93 Correct 130 ms 10096 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 23 ms 2672 KB Output is correct
98 Correct 95 ms 10096 KB Output is correct
99 Correct 99 ms 10092 KB Output is correct
100 Correct 96 ms 10052 KB Output is correct
101 Correct 102 ms 10088 KB Output is correct
102 Correct 93 ms 10104 KB Output is correct
103 Correct 93 ms 10108 KB Output is correct
104 Correct 93 ms 10092 KB Output is correct
105 Correct 104 ms 10088 KB Output is correct