oj.uz

Submission #349563

# Submission time Handle Problem Language Result Execution time Memory
349563 2021-01-17T20:20:47 Z justiny7 Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 286 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]) {
                d[p[i][j]].merge(i, j);
                continue;
            }
            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) && find(v.begin(), v.end(), j)==v.end())
                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

# Verdict Execution time Memory 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 11 ms 1260 KB Output is correct
7 Correct 281 ms 22112 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 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 11 ms 1260 KB Output is correct
7 Correct 281 ms 22112 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 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 12 ms 1260 KB Output is correct
13 Correct 259 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 115 ms 12268 KB Output is correct
18 Correct 0 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 275 ms 22124 KB Output is correct
22 Correct 269 ms 22124 KB Output is correct
23 Correct 283 ms 22124 KB Output is correct
24 Correct 261 ms 22124 KB Output is correct
25 Correct 111 ms 12268 KB Output is correct
26 Correct 105 ms 12140 KB Output is correct
27 Correct 280 ms 22124 KB Output is correct
28 Correct 261 ms 22252 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 1 ms 364 KB Output is correct
5 Correct 1 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 261 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 11 ms 1260 KB Output is correct
13 Correct 279 ms 22252 KB Output is correct
14 Correct 1 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 122 ms 12268 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 66 ms 5868 KB Output is correct
22 Correct 266 ms 22252 KB Output is correct
23 Correct 271 ms 22124 KB Output is correct
24 Correct 283 ms 22112 KB Output is correct
25 Correct 116 ms 12140 KB Output is correct
26 Correct 107 ms 12268 KB Output is correct
27 Correct 262 ms 22124 KB Output is correct
28 Correct 285 ms 22252 KB Output is correct
29 Correct 117 ms 12396 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory 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 68 ms 5996 KB Output is correct
5 Correct 264 ms 22124 KB Output is correct
6 Correct 264 ms 22124 KB Output is correct
7 Correct 284 ms 22252 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 66 ms 5868 KB Output is correct
10 Correct 265 ms 22124 KB Output is correct
11 Correct 263 ms 22124 KB Output is correct
12 Correct 286 ms 22124 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Incorrect 1 ms 364 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory 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 11 ms 1260 KB Output is correct
7 Correct 281 ms 22112 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 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 12 ms 1260 KB Output is correct
13 Correct 259 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 115 ms 12268 KB Output is correct
18 Correct 0 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 275 ms 22124 KB Output is correct
22 Correct 269 ms 22124 KB Output is correct
23 Correct 283 ms 22124 KB Output is correct
24 Correct 261 ms 22124 KB Output is correct
25 Correct 111 ms 12268 KB Output is correct
26 Correct 105 ms 12140 KB Output is correct
27 Correct 280 ms 22124 KB Output is correct
28 Correct 261 ms 22252 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 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 261 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 11 ms 1260 KB Output is correct
41 Correct 279 ms 22252 KB Output is correct
42 Correct 1 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 122 ms 12268 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 66 ms 5868 KB Output is correct
50 Correct 266 ms 22252 KB Output is correct
51 Correct 271 ms 22124 KB Output is correct
52 Correct 283 ms 22112 KB Output is correct
53 Correct 116 ms 12140 KB Output is correct
54 Correct 107 ms 12268 KB Output is correct
55 Correct 262 ms 22124 KB Output is correct
56 Correct 285 ms 22252 KB Output is correct
57 Correct 117 ms 12396 KB Output is correct
58 Correct 1 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 120 ms 12256 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 Incorrect 67 ms 5868 KB Too many ways to get from 1 to 183, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory 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 11 ms 1260 KB Output is correct
7 Correct 281 ms 22112 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 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 12 ms 1260 KB Output is correct
13 Correct 259 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 876 KB Output is correct
17 Correct 115 ms 12268 KB Output is correct
18 Correct 0 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 275 ms 22124 KB Output is correct
22 Correct 269 ms 22124 KB Output is correct
23 Correct 283 ms 22124 KB Output is correct
24 Correct 261 ms 22124 KB Output is correct
25 Correct 111 ms 12268 KB Output is correct
26 Correct 105 ms 12140 KB Output is correct
27 Correct 280 ms 22124 KB Output is correct
28 Correct 261 ms 22252 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 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 261 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 11 ms 1260 KB Output is correct
41 Correct 279 ms 22252 KB Output is correct
42 Correct 1 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 122 ms 12268 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 66 ms 5868 KB Output is correct
50 Correct 266 ms 22252 KB Output is correct
51 Correct 271 ms 22124 KB Output is correct
52 Correct 283 ms 22112 KB Output is correct
53 Correct 116 ms 12140 KB Output is correct
54 Correct 107 ms 12268 KB Output is correct
55 Correct 262 ms 22124 KB Output is correct
56 Correct 285 ms 22252 KB Output is correct
57 Correct 117 ms 12396 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 68 ms 5996 KB Output is correct
62 Correct 264 ms 22124 KB Output is correct
63 Correct 264 ms 22124 KB Output is correct
64 Correct 284 ms 22252 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 66 ms 5868 KB Output is correct
67 Correct 265 ms 22124 KB Output is correct
68 Correct 263 ms 22124 KB Output is correct
69 Correct 286 ms 22124 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Incorrect 1 ms 364 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -