oj.uz

Submission #366986

# Submission time Handle Problem Language Result Execution time Memory
366986 2021-02-15T22:48:01 Z PurpleCrayon Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 262 ms 22252 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) int(v.size())

int n;

struct DSU {
    vector<int> p, sz;
    void init(int n){ sz.assign(n, 1); p.resize(n); iota(p.begin(), p.end(), 0); }
    int find_set(int v){ return v==p[v]?v:p[v]=find_set(p[v]); }
    bool union_sets(int a, int b){
        if ((a=find_set(a))==(b=find_set(b))) return 0;
        if (sz[a] < sz[b]) swap(a, b);
        p[b]=a, sz[a]+=sz[b], sz[b]=0;
        return 1;
    }
} d;

int construct(vector<vector<int>> g) {
	n = sz(g);
    vector<vector<int>> ans(n, vector<int>(n));


    bool done=0, bad=0;

    [&](){ //handle case with a 3
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (g[i][j] == 3) {
            bad=1; return;
        }
    }();

    
    [&](){ //only 1's (tree)
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 1) return;
        for (int i = 1; i < n; i++) ans[i][0] = ans[0][i] = 1;

        build(ans), done=1;
    }();

    [&](){ //0, 1's (just deal with separate comps)
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 0 && g[i][j] != 1) return;

        d.init(n);
        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j])
            if (d.union_sets(i, j)) ans[i][j] = ans[j][i] = 1;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++)
            if ((d.find_set(i) == d.find_set(j))^(g[i][j])) return;

        build(ans), done=1;
    }();
    
    
	return !bad && done;
}

Subtask #1
11.0 / 11.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 0 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 244 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 244 ms 22136 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 250 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 748 KB Output is correct
17 Correct 116 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 68 ms 5996 KB Output is correct
21 Correct 247 ms 22124 KB Output is correct
22 Correct 248 ms 22252 KB Output is correct
23 Correct 255 ms 22124 KB Output is correct
24 Correct 245 ms 22124 KB Output is correct
25 Correct 110 ms 12140 KB Output is correct
26 Correct 111 ms 12140 KB Output is correct
27 Correct 253 ms 22124 KB Output is correct
28 Correct 262 ms 22124 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 0 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 244 ms 22136 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 250 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 748 KB Output is correct
17 Correct 116 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 68 ms 5996 KB Output is correct
21 Correct 247 ms 22124 KB Output is correct
22 Correct 248 ms 22252 KB Output is correct
23 Correct 255 ms 22124 KB Output is correct
24 Correct 245 ms 22124 KB Output is correct
25 Correct 110 ms 12140 KB Output is correct
26 Correct 111 ms 12140 KB Output is correct
27 Correct 253 ms 22124 KB Output is correct
28 Correct 262 ms 22124 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 0 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 244 ms 22136 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 250 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 748 KB Output is correct
17 Correct 116 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 68 ms 5996 KB Output is correct
21 Correct 247 ms 22124 KB Output is correct
22 Correct 248 ms 22252 KB Output is correct
23 Correct 255 ms 22124 KB Output is correct
24 Correct 245 ms 22124 KB Output is correct
25 Correct 110 ms 12140 KB Output is correct
26 Correct 111 ms 12140 KB Output is correct
27 Correct 253 ms 22124 KB Output is correct
28 Correct 262 ms 22124 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -