답안 #300437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300437	2020-09-17T07:15:42 Z	mohammad	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	289 ms	22392 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll ;

int root[1020] , de[1020] , use[1020] , r[1020];

ll find(int u){
	if(root[u] == u) return u;
	return root[u] = find(root[u]);
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n , vector<int>(n , 0));
	for(int i = 0 ; i < n ; ++i){
		if(p[i][i] != 1) return 0 ;
		root[i] = i ; 
	}
	for(int i = 0 ; i < n; ++i)
		for(int j = 0 ; j < n; ++j){
			if(!p[i][j]) continue ;
			if(p[i][j] == 2 || p[i][j] == 0) r[i]++ ;
			root[find(i)] = find(j);
		}
	for(int i = 0 ; i < n ; ++i) {
		if(r[i] == n - 1) de[i] = 1;
		else de[i] = 0 ;
		find(i);
	}
	set<int> s[1020][3];
	for(int i = 0 ; i < n; ++i)
		for(int j = i + 1 ; j < n; ++j){
			if(p[i][j] == 0 && root[i] == root[j]) return 0 ;
			else if(p[i][j]){
				s[root[i]][de[i]].insert(i);
				s[root[i]][de[j]].insert(j);
			}
		}
	for(int i = 0 ; i < n; ++i){
		if(use[root[i]]) continue;
		use[root[i]] = 1;
		int ls = -1;
		if(!s[root[i]][1].size()){
			for(auto j : s[root[i]][0]){
				if(ls != -1){
					answer[ls][j] = 1;answer[j][ls] = 1;
				}else ls = j ;
			}
		}else if(!s[root[i]][0].size()){
			if(s[root[i]][1].size() <= 2) return 0;
			auto it = s[root[i]][1].begin();
			auto it1 = s[root[i]][1].begin(); it1++;
			auto it2 = s[root[i]][1].begin(); it2++;it2++;
			answer[*it][*it1] = 1;answer[*it1][*it] = 1;
			for(; it2 != s[root[i]][1].end(); it2++ , it1++)
				answer[*it2][*it1] = 1;answer[*it1][*it2] = 1;
			answer[*it][*it1] = 1;answer[*it1][*it] = 1;
		}else{
			if(s[root[i]][1].size() <= 1) return 0;
			for(auto j : s[root[i]][0]){
				if(ls != -1){
					answer[ls][j] = 1;answer[j][ls] = 1;
				}else ls = j ;
			}
			int it = ls;
			auto it1 = s[root[i]][1].begin();
			auto it2 = s[root[i]][1].begin(); it2++;
			answer[it][*it1] = 1;answer[*it1][it] = 1;
			for(; it2 != s[root[i]][1].end(); it2++ , it1++)
				answer[*it2][*it1] = 1;answer[*it1][*it2] = 1;
			answer[it][*it1] = 1;answer[*it1][it] = 1;
		}
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:57:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   57 |    for(; it2 != s[root[i]][1].end(); it2++ , it1++)
      |    ^~~
supertrees.cpp:58:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   58 |     answer[*it2][*it1] = 1;answer[*it1][*it2] = 1;
      |                            ^~~~~~
supertrees.cpp:71:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   71 |    for(; it2 != s[root[i]][1].end(); it2++ , it1++)
      |    ^~~
supertrees.cpp:72:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   72 |     answer[*it2][*it1] = 1;answer[*it1][*it2] = 1;
      |                            ^~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	640 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	640 KB	Output is correct
6	Correct	12 ms	1408 KB	Output is correct
7	Correct	289 ms	22264 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	640 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	640 KB	Output is correct
6	Correct	12 ms	1408 KB	Output is correct
7	Correct	289 ms	22264 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	10 ms	1408 KB	Output is correct
13	Correct	243 ms	22264 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	6 ms	896 KB	Output is correct
17	Correct	125 ms	12280 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	60 ms	6136 KB	Output is correct
21	Correct	246 ms	22392 KB	Output is correct
22	Correct	242 ms	22264 KB	Output is correct
23	Correct	276 ms	22264 KB	Output is correct
24	Correct	239 ms	22264 KB	Output is correct
25	Correct	108 ms	12388 KB	Output is correct
26	Correct	104 ms	12312 KB	Output is correct
27	Correct	283 ms	22264 KB	Output is correct
28	Correct	243 ms	22264 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Incorrect	1 ms	512 KB	b is not symmetric: b[1][2] (0) != b[2][1] (1)
6	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Incorrect	1 ms	512 KB	b is not symmetric: b[1][2] (0) != b[2][1] (1)
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	640 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	640 KB	Output is correct
6	Correct	12 ms	1408 KB	Output is correct
7	Correct	289 ms	22264 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	10 ms	1408 KB	Output is correct
13	Correct	243 ms	22264 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	6 ms	896 KB	Output is correct
17	Correct	125 ms	12280 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	60 ms	6136 KB	Output is correct
21	Correct	246 ms	22392 KB	Output is correct
22	Correct	242 ms	22264 KB	Output is correct
23	Correct	276 ms	22264 KB	Output is correct
24	Correct	239 ms	22264 KB	Output is correct
25	Correct	108 ms	12388 KB	Output is correct
26	Correct	104 ms	12312 KB	Output is correct
27	Correct	283 ms	22264 KB	Output is correct
28	Correct	243 ms	22264 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	512 KB	Output is correct
33	Incorrect	1 ms	512 KB	b is not symmetric: b[1][2] (0) != b[2][1] (1)
34	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	640 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	640 KB	Output is correct
6	Correct	12 ms	1408 KB	Output is correct
7	Correct	289 ms	22264 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	640 KB	Output is correct
12	Correct	10 ms	1408 KB	Output is correct
13	Correct	243 ms	22264 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	6 ms	896 KB	Output is correct
17	Correct	125 ms	12280 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	60 ms	6136 KB	Output is correct
21	Correct	246 ms	22392 KB	Output is correct
22	Correct	242 ms	22264 KB	Output is correct
23	Correct	276 ms	22264 KB	Output is correct
24	Correct	239 ms	22264 KB	Output is correct
25	Correct	108 ms	12388 KB	Output is correct
26	Correct	104 ms	12312 KB	Output is correct
27	Correct	283 ms	22264 KB	Output is correct
28	Correct	243 ms	22264 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	512 KB	Output is correct
33	Incorrect	1 ms	512 KB	b is not symmetric: b[1][2] (0) != b[2][1] (1)
34	Halted	0 ms	0 KB	-

답안 #300437

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0