oj.uz

답안 #362715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362715 2021-02-04T07:55:53 Z abra_stone 슈퍼트리 잇기 (IOI20_supertrees) C++14
56 / 100
 292 ms 26436 KB 
#include "supertrees.h"
#include <vector>
#define N 1005
using namespace std;

int n, gc, gr[N], pa[N], a[N][N];
bool v[N];
vector<int> rt, ve;
vector<vector<int> > answer;

int uni(int p) {
	if (pa[p] == p) return p;
	else return pa[p] = uni(pa[p]);
}

void make_tree(int p) {
	int i;
	gr[p] = gc;
	for (i = 0; i < n; i++) {
		if (a[p][i] != 1 || gr[i]) continue;
		answer[p][i] = answer[i][p] = 1;
		pa[uni(i)] = uni(p);
		make_tree(i);
	}
}

void make_cy(int p) {
	int i;
	if (v[p]) return;
	v[p] = 1;
	ve.push_back(p);
	for (i = 0; i < rt.size(); i++) {
		int ne = rt[i];
		if (a[p][ne] == 2) make_cy(ne);
	}
}

int construct(std::vector<std::vector<int> > P) {
	n = P.size();
	int i, j;
	vector<int> t;
	t.clear();
	for (i = 0; i < n; i++) t.push_back(0);
	for (i = 0; i < n; i++) answer.push_back(t);
	for (i = 0; i < n; i++) {
		for (j = 0; j < n; j++) {
			a[i][j] = P[i][j];
			if (a[i][j] == 3) return 0;
		}
	}
	for (i = 0; i < n; i++) pa[i] = i;

	for (i = 0; i < n; i++) {
		if (!gr[i]) {
			gc++;
			rt.push_back(i);
			make_tree(i);
		}
	}
	for (i = 0; i < n; i++) {
		for (j = i + 1; j < n; j++) {
			if (gr[i] == gr[j] && a[i][j] != 1) return 0;
			if (gr[i] != gr[j] && a[i][j] == 1) return 0;
		}
	}

	for (i = 0; i < rt.size(); i++) {
		if (!v[rt[i]]) {
			ve.clear();
			make_cy(rt[i]);
			for (i = 1; i < ve.size(); i++) {
				int t1 = ve[i - 1], t2 = ve[i];
				pa[uni(t1)] = uni(t2);
				answer[t1][t2] = answer[t2][t1] = 1;
			}
			if (ve.size() > 1) {
				int t1 = ve[ve.size() - 1], t2 = ve[0];
				pa[uni(t1)] = uni(t2);
				answer[t1][t2] = answer[t2][t1] = 1;
			}
		}
	}
	for (i = 0; i < n; i++) {
		for (j = i + 1; j < n; j++) {
			if (uni(i) == uni(j) && a[i][j] == 0) return 0;
			if (uni(i) != uni(j) && a[i][j] != 0) return 0;
		}
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'void make_cy(int)':
supertrees.cpp:32:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for (i = 0; i < rt.size(); i++) {
      |              ~~^~~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:67:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for (i = 0; i < rt.size(); i++) {
      |              ~~^~~~~~~~~~~
supertrees.cpp:71:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |    for (i = 1; i < ve.size(); i++) {
      |                ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 380 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 2028 KB Output is correct
7 Correct 257 ms 26220 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 380 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 2028 KB Output is correct
7 Correct 257 ms 26220 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 16 ms 2028 KB Output is correct
13 Correct 260 ms 26092 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 7 ms 1644 KB Output is correct
17 Correct 122 ms 16364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 74 ms 8044 KB Output is correct
21 Correct 254 ms 26220 KB Output is correct
22 Correct 249 ms 26336 KB Output is correct
23 Correct 274 ms 26436 KB Output is correct
24 Correct 267 ms 26220 KB Output is correct
25 Correct 113 ms 16236 KB Output is correct
26 Correct 111 ms 16236 KB Output is correct
27 Correct 279 ms 26220 KB Output is correct
28 Correct 263 ms 26220 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 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 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 65 ms 7788 KB Output is correct
5 Correct 260 ms 26092 KB Output is correct
6 Correct 263 ms 26068 KB Output is correct
7 Correct 292 ms 26092 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 65 ms 7788 KB Output is correct
10 Correct 276 ms 26092 KB Output is correct
11 Correct 283 ms 26092 KB Output is correct
12 Correct 272 ms 26092 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 64 ms 7916 KB Output is correct
17 Correct 280 ms 26208 KB Output is correct
18 Correct 254 ms 26092 KB Output is correct
19 Correct 265 ms 26092 KB Output is correct
20 Correct 255 ms 26044 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 380 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 2028 KB Output is correct
7 Correct 257 ms 26220 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 16 ms 2028 KB Output is correct
13 Correct 260 ms 26092 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 7 ms 1644 KB Output is correct
17 Correct 122 ms 16364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 74 ms 8044 KB Output is correct
21 Correct 254 ms 26220 KB Output is correct
22 Correct 249 ms 26336 KB Output is correct
23 Correct 274 ms 26436 KB Output is correct
24 Correct 267 ms 26220 KB Output is correct
25 Correct 113 ms 16236 KB Output is correct
26 Correct 111 ms 16236 KB Output is correct
27 Correct 279 ms 26220 KB Output is correct
28 Correct 263 ms 26220 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Incorrect 0 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 380 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 2028 KB Output is correct
7 Correct 257 ms 26220 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 16 ms 2028 KB Output is correct
13 Correct 260 ms 26092 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 7 ms 1644 KB Output is correct
17 Correct 122 ms 16364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 74 ms 8044 KB Output is correct
21 Correct 254 ms 26220 KB Output is correct
22 Correct 249 ms 26336 KB Output is correct
23 Correct 274 ms 26436 KB Output is correct
24 Correct 267 ms 26220 KB Output is correct
25 Correct 113 ms 16236 KB Output is correct
26 Correct 111 ms 16236 KB Output is correct
27 Correct 279 ms 26220 KB Output is correct
28 Correct 263 ms 26220 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Incorrect 0 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -