oj.uz

Submission #300352

# Submission time Handle Problem Language Result Execution time Memory
300352 2020-09-17T05:47:20 Z junseo Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 256 ms 22228 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rmin(r, x) r = min(r, x)
#define rmax(r, x) r = max(r, x)
#define ends ' '
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int maxn = 1e3 + 10;

int n, pa[maxn];
bool chk[maxn];
vector<vector<int>> b;

int fnd(int x) { return (pa[x] < 0 ? x : pa[x] = fnd(pa[x])); }
void uni(int a, int b) {
	a = fnd(a), b = fnd(b);
	if(a == b)	return;
	pa[a] = b;
}

int construct(vector<std::vector<int>> p) {
	memset(pa, -1, sizeof(pa));
	n = p.size();
	b.resize(n);
	for(int i = 0; i < n; ++i)	b[i].resize(n);

	for(int i = 0; i < n; ++i) for(int j = i + 1; j < n; ++j) if(p[i][j] == 1 && fnd(i) != fnd(j)) {
		uni(i, j);
		b[i][j] = b[j][i] = 1;
	}

	for(int i = 0; i < n; ++i) if(!chk[i] && i == fnd(i)) {
		vector<int> v;
		for(int j = i + 1; j < n; ++j) if(p[i][j] == 2)	v.eb(fnd(j));
		sort(all(v));
		v.erase(unique(all(v)), v.end());

		if(v.empty())		continue;
		if(v.size() == 1)	return 0;

		chk[i] = true;
		int prev = i;
		for(auto& j : v) {
			chk[j] = true;
			b[prev][j] = b[j][prev] = 1;
			prev = j;
		}
		b[prev][i] = b[i][prev] = 1;
	}

	for(int i = 0; i < n; ++i) for(int j = i + 1; j < n; ++j) {
		if(p[i][j] && fnd(i) != fnd(j))		return 0;
		if(!p[i][j] && fnd(i) == fnd(j))	return 0;
	}
	build(b);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 110 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5756 KB Output is correct
21 Correct 242 ms 22136 KB Output is correct
22 Correct 235 ms 22228 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 245 ms 22100 KB Output is correct
25 Correct 95 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 232 ms 22136 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 110 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5756 KB Output is correct
21 Correct 242 ms 22136 KB Output is correct
22 Correct 235 ms 22228 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 245 ms 22100 KB Output is correct
25 Correct 95 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 232 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 110 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5756 KB Output is correct
21 Correct 242 ms 22136 KB Output is correct
22 Correct 235 ms 22228 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 245 ms 22100 KB Output is correct
25 Correct 95 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 232 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -