oj.uz

답안 #349570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349570 2021-01-17T20:47:17 Z justiny7 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 275 ms 22252 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define eb emplace_back
using namespace std;
using vb=vector<bool>;
using vi=vector<int>;
using vvi=vector<vi>;

const int mxN=1e3+1;
int n;
vb vis;
vvi ans;

struct DSU {
    int par[mxN], sz[mxN];
    DSU() {
        for (int i=0; i<n; ++i)
            par[i]=i, sz[i]=1;
    }
    int find(int v) {
        return (par[v]==v?v:par[v]=find(par[v]));
    }
    bool merge(int a, int b) {
        a=find(a), b=find(b);
        if (a==b)
            return 0;
        if (sz[a]>sz[b])
            swap(a, b);
        par[a]=b, sz[b]+=sz[a];
        return 1;
    }
    bool same(int a, int b) {
        return (find(a)==find(b));
    }
};

int construct(vvi p) {
    n=p.size();
    ans=vvi(n, vi(n));
    DSU d[4];
    for (int i=0; i<n; ++i)
        for (int j=0; j<n; ++j)
            if (p[i][j] && p[i][j]^2)
                d[p[i][j]].merge(i, j);
    for (int i=0; i<n; ++i)
        for (int j=0; j<n; ++j) {
            if (p[i][j]==2)
                d[2].merge(d[1].find(i), d[1].find(j));
            else if (!p[i][j]) {
                for (int k=1; k<4; ++k)
                    if (d[k].same(i, j))
                        return 0;
            }
        }
    vis=vb(n);
    for (int i=0; i<n; ++i) {
        if (vis[d[1].find(i)])
            continue;
        vis[d[1].find(i)]=1;
        for (int j=0; j<n; ++j)
            if (i^j && d[1].same(i, j)) {
                if (p[i]!=p[j])
                    return 0;
                ans[i][j]=ans[j][i]=1;
            }
    }
    vis=vb(n);
    for (int i=0; i<n; ++i) {
        if (vis[d[2].find(i)])
            continue;
        vis[d[2].find(i)]=1;
        vi v;
        for (int j=0; j<n; ++j)
            if (d[2].same(i, j))
                v.eb(j);
        int sz=v.size();
        if (sz==1)
            continue;
        if (sz==2)
            return 0;
        for (int j=0; j<sz; ++j) {
            if (j)
                ans[v[j]][v[j-1]]=ans[v[j-1]][v[j]]=1;
            if (j<sz-1)
                ans[v[j]][v[j+1]]=ans[v[j+1]][v[j]]=1;
        }
        ans[v[0]][v.back()]=ans[v.back()][v[0]]=1;
    }
    vis=vb(n);
    for (int i=0; i<n; ++i) {
        if (vis[d[3].find(i)])
            continue;
        vis[d[3].find(i)]=1;
        vi v;
        bool f=1;
        for (int j=0; j<n; ++j) {
            if (d[3].same(i, j))
                v.eb(j);
            if (i^j)
                f&=(p[i][j]==3 || !p[i][j]);
        }
        int sz=v.size();
        if (sz==1)
            continue;
        if (f || sz^4)
            return 0;
        ans[v[0]][v[1]]=ans[v[1]][v[0]]=1;
        ans[v[1]][v[2]]=ans[v[2]][v[1]]=1;
        ans[v[2]][v[3]]=ans[v[3]][v[2]]=1;
        ans[v[0]][v[3]]=ans[v[3]][v[0]]=1;
        ans[v[0]][v[2]]=ans[v[2]][v[0]]=1;
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22124 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22124 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 259 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 121 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 5868 KB Output is correct
21 Correct 255 ms 22124 KB Output is correct
22 Correct 260 ms 22152 KB Output is correct
23 Correct 275 ms 22124 KB Output is correct
24 Correct 252 ms 22124 KB Output is correct
25 Correct 109 ms 12140 KB Output is correct
26 Correct 102 ms 12268 KB Output is correct
27 Correct 269 ms 22124 KB Output is correct
28 Correct 259 ms 22252 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 253 ms 22124 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 248 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 110 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 64 ms 5868 KB Output is correct
22 Correct 255 ms 22124 KB Output is correct
23 Correct 263 ms 22124 KB Output is correct
24 Correct 266 ms 22124 KB Output is correct
25 Correct 117 ms 12268 KB Output is correct
26 Correct 104 ms 12140 KB Output is correct
27 Correct 254 ms 22252 KB Output is correct
28 Correct 265 ms 22140 KB Output is correct
29 Correct 112 ms 12268 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 64 ms 5884 KB Output is correct
5 Correct 258 ms 22124 KB Output is correct
6 Correct 261 ms 22124 KB Output is correct
7 Correct 270 ms 22184 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 64 ms 5868 KB Output is correct
10 Correct 253 ms 22124 KB Output is correct
11 Correct 253 ms 22112 KB Output is correct
12 Correct 263 ms 22124 KB Output is correct
13 Correct 1 ms 236 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 67 ms 5868 KB Output is correct
17 Correct 251 ms 22124 KB Output is correct
18 Correct 266 ms 22124 KB Output is correct
19 Correct 262 ms 22124 KB Output is correct
20 Correct 254 ms 22124 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22124 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 259 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 121 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 5868 KB Output is correct
21 Correct 255 ms 22124 KB Output is correct
22 Correct 260 ms 22152 KB Output is correct
23 Correct 275 ms 22124 KB Output is correct
24 Correct 252 ms 22124 KB Output is correct
25 Correct 109 ms 12140 KB Output is correct
26 Correct 102 ms 12268 KB Output is correct
27 Correct 269 ms 22124 KB Output is correct
28 Correct 259 ms 22252 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 0 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 253 ms 22124 KB Output is correct
38 Correct 0 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 10 ms 1260 KB Output is correct
41 Correct 248 ms 22124 KB Output is correct
42 Correct 0 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 110 ms 12140 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 64 ms 5868 KB Output is correct
50 Correct 255 ms 22124 KB Output is correct
51 Correct 263 ms 22124 KB Output is correct
52 Correct 266 ms 22124 KB Output is correct
53 Correct 117 ms 12268 KB Output is correct
54 Correct 104 ms 12140 KB Output is correct
55 Correct 254 ms 22252 KB Output is correct
56 Correct 265 ms 22140 KB Output is correct
57 Correct 112 ms 12268 KB Output is correct
58 Correct 0 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 5 ms 876 KB Output is correct
61 Correct 114 ms 12140 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 65 ms 5868 KB Output is correct
66 Correct 103 ms 12140 KB Output is correct
67 Correct 103 ms 12140 KB Output is correct
68 Correct 102 ms 12140 KB Output is correct
69 Correct 115 ms 12140 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22124 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 259 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 121 ms 12140 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 5868 KB Output is correct
21 Correct 255 ms 22124 KB Output is correct
22 Correct 260 ms 22152 KB Output is correct
23 Correct 275 ms 22124 KB Output is correct
24 Correct 252 ms 22124 KB Output is correct
25 Correct 109 ms 12140 KB Output is correct
26 Correct 102 ms 12268 KB Output is correct
27 Correct 269 ms 22124 KB Output is correct
28 Correct 259 ms 22252 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 0 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 253 ms 22124 KB Output is correct
38 Correct 0 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 10 ms 1260 KB Output is correct
41 Correct 248 ms 22124 KB Output is correct
42 Correct 0 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 110 ms 12140 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 64 ms 5868 KB Output is correct
50 Correct 255 ms 22124 KB Output is correct
51 Correct 263 ms 22124 KB Output is correct
52 Correct 266 ms 22124 KB Output is correct
53 Correct 117 ms 12268 KB Output is correct
54 Correct 104 ms 12140 KB Output is correct
55 Correct 254 ms 22252 KB Output is correct
56 Correct 265 ms 22140 KB Output is correct
57 Correct 112 ms 12268 KB Output is correct
58 Correct 0 ms 364 KB Output is correct
59 Correct 0 ms 364 KB Output is correct
60 Correct 0 ms 364 KB Output is correct
61 Correct 64 ms 5884 KB Output is correct
62 Correct 258 ms 22124 KB Output is correct
63 Correct 261 ms 22124 KB Output is correct
64 Correct 270 ms 22184 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 64 ms 5868 KB Output is correct
67 Correct 253 ms 22124 KB Output is correct
68 Correct 253 ms 22112 KB Output is correct
69 Correct 263 ms 22124 KB Output is correct
70 Correct 1 ms 236 KB Output is correct
71 Correct 0 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 67 ms 5868 KB Output is correct
74 Correct 251 ms 22124 KB Output is correct
75 Correct 266 ms 22124 KB Output is correct
76 Correct 262 ms 22124 KB Output is correct
77 Correct 254 ms 22124 KB Output is correct
78 Correct 0 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 5 ms 876 KB Output is correct
81 Correct 114 ms 12140 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 65 ms 5868 KB Output is correct
86 Correct 103 ms 12140 KB Output is correct
87 Correct 103 ms 12140 KB Output is correct
88 Correct 102 ms 12140 KB Output is correct
89 Correct 115 ms 12140 KB Output is correct
90 Correct 0 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 876 KB Output is correct
93 Correct 120 ms 12140 KB Output is correct
94 Correct 1 ms 364 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 0 ms 364 KB Output is correct
97 Correct 30 ms 3308 KB Output is correct
98 Correct 116 ms 12140 KB Output is correct
99 Correct 121 ms 12268 KB Output is correct
100 Correct 120 ms 12140 KB Output is correct
101 Correct 117 ms 12140 KB Output is correct
102 Correct 116 ms 12140 KB Output is correct
103 Correct 125 ms 12140 KB Output is correct
104 Correct 111 ms 12140 KB Output is correct
105 Correct 119 ms 12268 KB Output is correct