oj.uz

답안 #1032869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032869 2024-07-24T10:10:28 Z Zicrus 슈퍼트리 잇기 (IOI20_supertrees) C++17
46 / 100
 137 ms 24592 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

typedef long long ll;

vector<ll> lnk1, lnk2;

ll find1(ll a) {
    if (lnk1[a] != a) lnk1[a] = find1(lnk1[a]);
    return lnk1[a];
}

ll find2(ll a) {
    if (lnk2[a] != a) lnk2[a] = find2(lnk2[a]);
    return lnk2[a];
}

void unite1(ll a, ll b) {
    a = find1(a); b = find1(b);
    lnk1[b] = a;
}

void unite2(ll a, ll b) {
    a = find2(a); b = find2(b);
    lnk2[b] = a;
}

int construct(vector<vector<int>> p) {
    ll n = p.size();
    lnk1 = vector<ll>(p.size());
    lnk2 = vector<ll>(p.size());
    for (int i = 0; i < n; i++) lnk1[i] = lnk2[i] = i;
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (p[i][j] == 3) return 0;
            if (p[i][j] == 2) unite2(i, j);
            if (p[i][j] == 1) unite1(i, j);
        }
    }

    vector<set<ll>> clubs1(n), clubs2(n);
    for (int i = 0; i < n; i++) {
        clubs1[find1(i)].insert(i);
        clubs2[find2(i)].insert(find1(i));
    }

    vector<vector<int>> res(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        if (clubs2[i].size() > 1) {
            ll prev = *--clubs2[i].end();
            for (auto &e : clubs2[i]) {
                res[prev][e] = 1;
                res[e][prev] = 1;
                prev = e;
            }
        }
        if (clubs1[i].size() > 1) {
            ll prev = -1;
            for (auto &e : clubs1[i]) {
                if (prev != -1) {
                    res[prev][e] = 1;
                    res[e][prev] = 1;
                }
                prev = e;
            }
        }
    }

    build(res);
    return 1;
}

Subtask #1
11.0 / 11.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1376 KB Output is correct
7 Correct 114 ms 24332 KB Output is correct

Subtask #2
0 / 10.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1376 KB Output is correct
7 Correct 114 ms 24332 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 116 ms 24312 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 344 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 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 6404 KB Output is correct
5 Correct 137 ms 24144 KB Output is correct
6 Correct 112 ms 24200 KB Output is correct
7 Correct 118 ms 24404 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 28 ms 6468 KB Output is correct
10 Correct 115 ms 24152 KB Output is correct
11 Correct 122 ms 24148 KB Output is correct
12 Correct 121 ms 24144 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Correct 29 ms 6368 KB Output is correct
17 Correct 125 ms 24592 KB Output is correct
18 Correct 107 ms 24144 KB Output is correct
19 Correct 115 ms 24148 KB Output is correct
20 Correct 121 ms 24152 KB Output is correct

Subtask #5
0 / 21.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1376 KB Output is correct
7 Correct 114 ms 24332 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 116 ms 24312 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1376 KB Output is correct
7 Correct 114 ms 24332 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 116 ms 24312 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -