oj.uz

답안 #482857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482857 2021-10-26T15:38:05 Z jalsol 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 194 ms 22168 KB 
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

#include "supertrees.h"

constexpr int maxn = 3e5 + 5;

vector<int> par;

int find(int x) {
    return (par[x] < 0) ? x : (par[x] = find(par[x]));
}

bool merge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v) return false;

    if (par[v] < par[u]) swap(u, v);
    par[u] += par[v];
    par[v] = u;
    return true;
}

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

int construct(vector<vector<int>> req) {
	int n = req.size();
	vector<vector<int>> ans(n, vector<int>(n));

    par.assign(n, -1);
    Rep (i, n) {
        For (j, i + 1, n - 1) {
            if (!req[i][j]) continue;

            if (merge(i, j)) {
                ans[i][j] = ans[j][i] = 1;
            }
        }
    }

    Rep (i, n) {
        For (j, i + 1, n - 1) {
            if (req[i][j] != same(i, j)) {
                return 0;
            }
        }
    }

	build(ans);
	return 1;
}

// does oj.uz allow IOI-style scoring?

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 193 ms 22040 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 193 ms 22040 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 182 ms 21948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 91 ms 12228 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 5888 KB Output is correct
21 Correct 179 ms 22084 KB Output is correct
22 Correct 178 ms 22084 KB Output is correct
23 Correct 189 ms 22084 KB Output is correct
24 Correct 179 ms 22108 KB Output is correct
25 Correct 84 ms 12156 KB Output is correct
26 Correct 80 ms 12164 KB Output is correct
27 Correct 194 ms 22168 KB Output is correct
28 Correct 177 ms 22136 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 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 Incorrect 0 ms 204 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 193 ms 22040 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 182 ms 21948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 91 ms 12228 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 5888 KB Output is correct
21 Correct 179 ms 22084 KB Output is correct
22 Correct 178 ms 22084 KB Output is correct
23 Correct 189 ms 22084 KB Output is correct
24 Correct 179 ms 22108 KB Output is correct
25 Correct 84 ms 12156 KB Output is correct
26 Correct 80 ms 12164 KB Output is correct
27 Correct 194 ms 22168 KB Output is correct
28 Correct 177 ms 22136 KB Output is correct
29 Correct 0 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 Correct 1 ms 204 KB Output is correct
33 Incorrect 0 ms 204 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1100 KB Output is correct
7 Correct 193 ms 22040 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 182 ms 21948 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 91 ms 12228 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 5888 KB Output is correct
21 Correct 179 ms 22084 KB Output is correct
22 Correct 178 ms 22084 KB Output is correct
23 Correct 189 ms 22084 KB Output is correct
24 Correct 179 ms 22108 KB Output is correct
25 Correct 84 ms 12156 KB Output is correct
26 Correct 80 ms 12164 KB Output is correct
27 Correct 194 ms 22168 KB Output is correct
28 Correct 177 ms 22136 KB Output is correct
29 Correct 0 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 Correct 1 ms 204 KB Output is correct
33 Incorrect 0 ms 204 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -