oj.uz

답안 #1061867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061867 2024-08-16T14:34:31 Z vjudge1 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 160 ms 22192 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) {
        while(e[u] >= 0) u = e[u];
        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);
    bool ok = true;
    for(int i = 0; i < m; ++i)
        for(int j = i + 1; j < m; ++j)
            if(p[comp[i]][comp[j]] == 0 || p[comp[i]][comp[j]] == 3) ok = 0;
    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
    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] == 0 && 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:44:31: warning: unused variable 'n' [-Wunused-variable]
   44 |     int m = (int)comp.size(), n = (int)p.size();
      |                               ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 138 ms 22020 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 138 ms 22020 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 110 ms 22100 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 60 ms 8276 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5720 KB Output is correct
21 Correct 123 ms 22096 KB Output is correct
22 Correct 113 ms 22096 KB Output is correct
23 Correct 118 ms 22040 KB Output is correct
24 Correct 160 ms 22024 KB Output is correct
25 Correct 62 ms 8272 KB Output is correct
26 Correct 56 ms 8276 KB Output is correct
27 Correct 122 ms 22040 KB Output is correct
28 Correct 155 ms 22020 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 5724 KB Output is correct
5 Correct 113 ms 22100 KB Output is correct
6 Correct 132 ms 22028 KB Output is correct
7 Correct 119 ms 22096 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 37 ms 5712 KB Output is correct
10 Correct 126 ms 22096 KB Output is correct
11 Correct 132 ms 22100 KB Output is correct
12 Correct 120 ms 22100 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 28 ms 5840 KB Output is correct
17 Correct 112 ms 22100 KB Output is correct
18 Correct 113 ms 22192 KB Output is correct
19 Correct 111 ms 22016 KB Output is correct
20 Correct 110 ms 22096 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 138 ms 22020 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 110 ms 22100 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 60 ms 8276 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5720 KB Output is correct
21 Correct 123 ms 22096 KB Output is correct
22 Correct 113 ms 22096 KB Output is correct
23 Correct 118 ms 22040 KB Output is correct
24 Correct 160 ms 22024 KB Output is correct
25 Correct 62 ms 8272 KB Output is correct
26 Correct 56 ms 8276 KB Output is correct
27 Correct 122 ms 22040 KB Output is correct
28 Correct 155 ms 22020 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 138 ms 22020 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 110 ms 22100 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 60 ms 8276 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5720 KB Output is correct
21 Correct 123 ms 22096 KB Output is correct
22 Correct 113 ms 22096 KB Output is correct
23 Correct 118 ms 22040 KB Output is correct
24 Correct 160 ms 22024 KB Output is correct
25 Correct 62 ms 8272 KB Output is correct
26 Correct 56 ms 8276 KB Output is correct
27 Correct 122 ms 22040 KB Output is correct
28 Correct 155 ms 22020 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -