oj.uz

답안 #468244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468244 2021-08-27T10:32:27 Z Soumya1 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 293 ms 22024 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
struct DisjointSetUnion {
	int n;
	vector<int> par;
	vector<int> sz;
	DisjointSetUnion(int n) {
		par.resize(n);
		sz.assign(n, 1);
		iota(par.begin(), par.end(), 0);
	}
	int find(int x) {
		return par[x] = (x == par[x] ? x : find(par[x]));
	}
	void unite(int u, int v) {
		u = find(u);
		v = find(v);
		if (u == v) return;
		if (sz[u] < sz[v]) swap(u, v);
		par[v] = u;
		sz[u] += sz[v];
	}
	bool same(int u, int v) {
		return (find(u) == find(v));
	}
};
int construct(vector<vector<int>> p) {
	int n = p.size();
	bool bad = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			bad |= (p[i][j] == 3);
		}
	}
	if (bad) return 0;
	vector<vector<int>> b(n, vector<int> (n, 0));
	DisjointSetUnion dsu(n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (p[i][j] == 1) {
				dsu.unite(i, j);
			}
		}
	}
	vector<int> roots;
	for (int i = 0; i < n; i++) {
		if (dsu.par[i] == i) {
			vector<int> nodes;
			for (int j = 0; j < n; j++) {
				if (dsu.par[j] == i) {
					nodes.push_back(j);
				}
			}
			for (int u : nodes) {
				for (int v : nodes) {
					bad |= (p[u][v] != 1);
				}
			}
			roots.push_back(i);
			for (int j = 1; j < (int) nodes.size(); j++) b[nodes[j]][nodes[j - 1]] = b[nodes[j - 1]][nodes[j]] = 1;
		}
	}
	if (bad) return 0;
	DisjointSetUnion rot(n);
	for (int u : roots) {
		for (int v : roots) {
			if (p[u][v] == 2) {
				rot.unite(u, v);
			}
		}
	}
	for (int u : roots) {
		if (u == rot.par[u] && rot.sz[u] > 3) {
			vector<int> nodes;
			for (int v : roots) {
				if (u == rot.par[v]) {
					nodes.push_back(v);
				}
			}
			for (int i : nodes) {
				for (int j : nodes) {
					if (i != j && p[i][j] != 2) bad = true;
				}
			}
			int sz = nodes.size();
			for (int i = 0; i < sz; i++) {
				b[nodes[i]][nodes[(i + 1) % sz]] = b[nodes[(i + 1) % sz]][nodes[i]] = 1;
			}
		} else if (u == rot.par[u] && rot.sz[u] == 2) {
			bad = true;
		}
	}
	if (bad) return 0;
	build(b);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1120 KB Output is correct
7 Correct 276 ms 21972 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1120 KB Output is correct
7 Correct 276 ms 21972 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 14 ms 1092 KB Output is correct
13 Correct 223 ms 22024 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 111 ms 12028 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 57 ms 5756 KB Output is correct
21 Correct 236 ms 21940 KB Output is correct
22 Correct 226 ms 22012 KB Output is correct
23 Correct 241 ms 22024 KB Output is correct
24 Correct 226 ms 21956 KB Output is correct
25 Correct 109 ms 12100 KB Output is correct
26 Correct 93 ms 12040 KB Output is correct
27 Correct 237 ms 21956 KB Output is correct
28 Correct 293 ms 21956 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 0
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1120 KB Output is correct
7 Correct 276 ms 21972 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 14 ms 1092 KB Output is correct
13 Correct 223 ms 22024 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 111 ms 12028 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 57 ms 5756 KB Output is correct
21 Correct 236 ms 21940 KB Output is correct
22 Correct 226 ms 22012 KB Output is correct
23 Correct 241 ms 22024 KB Output is correct
24 Correct 226 ms 21956 KB Output is correct
25 Correct 109 ms 12100 KB Output is correct
26 Correct 93 ms 12040 KB Output is correct
27 Correct 237 ms 21956 KB Output is correct
28 Correct 293 ms 21956 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Incorrect 1 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 0
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1120 KB Output is correct
7 Correct 276 ms 21972 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 14 ms 1092 KB Output is correct
13 Correct 223 ms 22024 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 111 ms 12028 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 57 ms 5756 KB Output is correct
21 Correct 236 ms 21940 KB Output is correct
22 Correct 226 ms 22012 KB Output is correct
23 Correct 241 ms 22024 KB Output is correct
24 Correct 226 ms 21956 KB Output is correct
25 Correct 109 ms 12100 KB Output is correct
26 Correct 93 ms 12040 KB Output is correct
27 Correct 237 ms 21956 KB Output is correct
28 Correct 293 ms 21956 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Incorrect 1 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 0
34 Halted 0 ms 0 KB -