oj.uz

Submission #1061860

# Submission time Handle Problem Language Result Execution time Memory
1061860 2024-08-16T14:26:49 Z vjudge1 Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 134 ms 22352 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;

struct DSU {
    vi e;
    DSU(int n) : e(n, -1) {}

    int repr(int u) {
        int u0 = u;
        while(e[u] >= 0) u = e[u];
        while(e[u0] >= 0) {
            int v = e[u0];
            e[u0] = u;
            u0 = v;
        }
        return u;
    }

    void join(int u, int v) {
        u = repr(u); v = repr(v);
        if(u == v) return;
        if(e[u] >= e[v]) swap(u, v);
        e[u] += e[v];
        e[v] = u;
    }

    bool same(int u, int v) { return repr(u) == repr(v); }

    vector<vi> comp() {
        ///va da componentele
        int n = int(e.size()), nr = 0;
        map<int, int> Id;
        for(int i = 0; i < n; ++i) {
            if(e[i] < 0) {
                Id[i] = nr++;
            }
        }
        vector<vi> Re(nr);
        for(int i = 0; i < n; ++i)
            Re[Id[repr(i)]].push_back(i);
        return Re;
    }
};

bool solve(vi comp, vector<vi> &p, vector<vi> &L) {
    int m = (int)comp.size(), n = (int)p.size();
    DSU Sol(m);
    for(int i = 0; i < m; ++i)
        for(int j = i + 1; j < m; ++j)
            if(p[comp[i]][comp[j]] == 1) Sol.join(i, j); /// arborescenta
    bool ok = true;
    for(int i = 0; i < m; ++i)
        for(int j = i + 1; j < m; ++j)
            if(p[comp[i]][comp[j]] != 1 && Sol.same(i, j)) ok = false;
    auto Arb = Sol.comp();
    vi A;
    for(auto sir : Arb) {
        for(int i = 1; i < (int)sir.size(); ++i) {
            L[comp[sir[0]]][comp[sir[i]]] = 1;
            L[comp[sir[i]]][comp[sir[0]]] = 1;
        }
        A.push_back(comp[sir[0]]);
    }
    for(int i = 0; i + 1 < (int)A.size(); ++i) {
        L[A[i]][A[i + 1]] = 1;
        L[A[i + 1]][A[i]] = 1;
    }
    if(A.size() != 1) {
        L[A[0]][A.back()] = 1;
        L[A.back()][A[0]] = 1;
    }
    return ok;
}

int construct(vector<vi> p) {
    int n = int(p.size());
    DSU Sol(n);
    for(int i = 0; i < n; ++i) {
        for(int j = i + 1; j < n; ++j) {
            if(p[i][j]) Sol.join(i, j);
        }
    }
    bool ok = true;
    for(int i = 0; i < n; ++i) {
        for(int j = i + 1; j < n; ++j) {
            if(!p[i][j] == Sol.same(i, j))
                ok = false;
            if(p[i][j] == 3) ok = false;
        }
    }
    if(!ok) return 0;
    auto C = Sol.comp();
    vector<vi> Muchii(n, vi(n, 0));
    for(auto comp : C) {
        ok &= solve(comp, p, Muchii);
    }
    if(ok) {
        build(Muchii);
    }
    return ok;
}

Compilation message

supertrees.cpp: In function 'bool solve(vi, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&)':
supertrees.cpp:50:31: warning: unused variable 'n' [-Wunused-variable]
   50 |     int m = (int)comp.size(), n = (int)p.size();
      |                               ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 134 ms 22040 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 134 ms 22040 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 108 ms 22072 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 64 ms 8212 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 28 ms 5824 KB Output is correct
21 Correct 114 ms 22040 KB Output is correct
22 Correct 115 ms 22196 KB Output is correct
23 Correct 124 ms 22100 KB Output is correct
24 Correct 123 ms 22100 KB Output is correct
25 Correct 48 ms 8276 KB Output is correct
26 Correct 55 ms 8204 KB Output is correct
27 Correct 117 ms 22100 KB Output is correct
28 Correct 109 ms 22100 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 29 ms 5784 KB Output is correct
5 Correct 111 ms 22036 KB Output is correct
6 Correct 116 ms 22044 KB Output is correct
7 Correct 130 ms 22100 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 28 ms 5892 KB Output is correct
10 Correct 117 ms 22096 KB Output is correct
11 Correct 113 ms 22040 KB Output is correct
12 Correct 118 ms 22096 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 28 ms 5780 KB Output is correct
17 Correct 113 ms 22036 KB Output is correct
18 Correct 121 ms 22096 KB Output is correct
19 Correct 111 ms 22132 KB Output is correct
20 Correct 109 ms 22352 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 134 ms 22040 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 108 ms 22072 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 64 ms 8212 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 28 ms 5824 KB Output is correct
21 Correct 114 ms 22040 KB Output is correct
22 Correct 115 ms 22196 KB Output is correct
23 Correct 124 ms 22100 KB Output is correct
24 Correct 123 ms 22100 KB Output is correct
25 Correct 48 ms 8276 KB Output is correct
26 Correct 55 ms 8204 KB Output is correct
27 Correct 117 ms 22100 KB Output is correct
28 Correct 109 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Incorrect 0 ms 348 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 134 ms 22040 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 108 ms 22072 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 64 ms 8212 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 28 ms 5824 KB Output is correct
21 Correct 114 ms 22040 KB Output is correct
22 Correct 115 ms 22196 KB Output is correct
23 Correct 124 ms 22100 KB Output is correct
24 Correct 123 ms 22100 KB Output is correct
25 Correct 48 ms 8276 KB Output is correct
26 Correct 55 ms 8204 KB Output is correct
27 Correct 117 ms 22100 KB Output is correct
28 Correct 109 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -