oj.uz

Submission #521332

# Submission time Handle Problem Language Result Execution time Memory
521332 2022-02-01T18:14:10 Z ddy888 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 217 ms 27928 KB 
#include "supertrees.h"
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#include <vector>

int N, vis[100010];
vector<vector<int> > A;
vector<vector<int> > twos;
vector<vector<int> > ans;

struct DSU {
    vector<int> par;
    void init(int x) { par.resize(x + 1); for (int i = 0; i <= N; ++i) par[i] = i; }
    int root(int x) { return (par[x]==x)? x:par[x]=root(par[x]); }
    bool same(int a, int b) { return root(a) == root(b); }
    void merge(int a, int b) {par[root(a)] = root(b);}
};

void link(int x, int y) {
    if (x == y) return;
    ans[x - 1][y - 1] = ans[y - 1][x - 1] = 1;
}

int construct(std::vector<std::vector<int>> p) {
    N = p.size();
    A.resize(N + 1, vector<int>(N + 1));
    ans.resize(N, vector<int>(N));
    for (int i = 1; i <= N; ++i) for (int j = 1; j <= N; ++j) A[i][j] = p[i - 1][j - 1];
    
    DSU dsu1, dsu2;
    dsu1.init(N);
    dsu2.init(N);
    for (int i = 1; i <= N; ++i) {
        for (int j = i + 1; j <= N; ++j) {
            if (A[i][j] == 3) return 0;
            if (A[i][j] == 1) {
                if (dsu1.same(i, j)) continue;
                dsu1.merge(i, j);
                link(i, dsu1.root(i)); link(j, dsu1.root(j));
            } 
        }
    }
    for (int i = 1; i <= N; ++i) {
        if (vis[i]) continue;
        bool non = false;
        for (int j = i + 1; j <= N; ++j) {
            if (A[i][j] == 1) non = true;
        }
        if (!non) {
            vector<int> nodes;
            nodes.pb(i);
            vis[i] = 1;
            for (int j = i + 1; j <= N; ++j) {
                if (A[i][j] == 2) {
                    nodes.pb(j);
                    vis[j] = 1;
                }   
            }
            twos.pb(nodes);
        }
    }
    for (auto st: twos) {
        int ss = st.size();
        for (int i = 1; i < ss; ++i) {
            if (dsu1.same(st[i], st[i - 1])) return 0;
            dsu1.merge(st[i], st[i - 1]);
            link(st[i], st[i - 1]);
        }
        link(st[0], st[ss - 1]);
    }
    for (int i = 1; i <= N; ++i) {
        for (int j = i + 1; j <= N; ++j) {
            if (A[i][j] == 0 && dsu1.same(i, j)) return 0;
        }
    }
    build(ans);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 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 8 ms 1356 KB Output is correct
7 Correct 196 ms 26000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 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 8 ms 1356 KB Output is correct
7 Correct 196 ms 26000 KB Output is correct
8 Correct 1 ms 204 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 8 ms 1356 KB Output is correct
13 Correct 176 ms 26028 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 90 ms 16000 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 47 ms 6788 KB Output is correct
21 Correct 170 ms 25892 KB Output is correct
22 Correct 204 ms 25984 KB Output is correct
23 Correct 185 ms 25988 KB Output is correct
24 Correct 172 ms 25988 KB Output is correct
25 Correct 71 ms 16068 KB Output is correct
26 Correct 97 ms 16008 KB Output is correct
27 Correct 179 ms 25984 KB Output is correct
28 Correct 171 ms 26180 KB Output is correct

Subtask #3
0 / 19.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 0 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
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 1 ms 204 KB Output is correct
4 Correct 47 ms 6700 KB Output is correct
5 Correct 217 ms 25928 KB Output is correct
6 Correct 181 ms 25924 KB Output is correct
7 Correct 188 ms 25956 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 46 ms 7220 KB Output is correct
10 Correct 181 ms 27892 KB Output is correct
11 Correct 209 ms 27896 KB Output is correct
12 Correct 181 ms 27928 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Incorrect 20 ms 4656 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 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 8 ms 1356 KB Output is correct
7 Correct 196 ms 26000 KB Output is correct
8 Correct 1 ms 204 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 8 ms 1356 KB Output is correct
13 Correct 176 ms 26028 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 90 ms 16000 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 47 ms 6788 KB Output is correct
21 Correct 170 ms 25892 KB Output is correct
22 Correct 204 ms 25984 KB Output is correct
23 Correct 185 ms 25988 KB Output is correct
24 Correct 172 ms 25988 KB Output is correct
25 Correct 71 ms 16068 KB Output is correct
26 Correct 97 ms 16008 KB Output is correct
27 Correct 179 ms 25984 KB Output is correct
28 Correct 171 ms 26180 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 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 8 ms 1356 KB Output is correct
7 Correct 196 ms 26000 KB Output is correct
8 Correct 1 ms 204 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 8 ms 1356 KB Output is correct
13 Correct 176 ms 26028 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 90 ms 16000 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 47 ms 6788 KB Output is correct
21 Correct 170 ms 25892 KB Output is correct
22 Correct 204 ms 25984 KB Output is correct
23 Correct 185 ms 25988 KB Output is correct
24 Correct 172 ms 25988 KB Output is correct
25 Correct 71 ms 16068 KB Output is correct
26 Correct 97 ms 16008 KB Output is correct
27 Correct 179 ms 25984 KB Output is correct
28 Correct 171 ms 26180 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -