답안 #994839

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
994839	2024-06-08T07:20:30 Z	Newtonabc	슈퍼트리 잇기 (IOI20_supertrees)	C++14	56 / 100	142 ms	22124 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
vector<int> v;
int pa[N];
bool cy[N][N];
vector<int> adj[N];
int cnt=0;
bool vs[N];
void dfs(int u){
	vs[u]=true;
	cnt++;
	if(adj[u].size()==1) v.push_back(u);
	for(int i=0;i<adj[u].size();i++){
		if(!vs[adj[u][i]]) dfs(adj[u][i]);
	}
}
int root(int x){
	if(pa[x]==x) return x;
	else return pa[x]=root(pa[x]);
}
int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	for (int i = 0; i < n; i++) {
		vector<int> row(n,0);
		answer.push_back(row);
	}
	for(int i=0;i<n;i++) pa[i]=i;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==1 && root(i)!=root(j)){
				answer[i][j]=1;
				answer[j][i]=1;
				pa[root(i)]=root(j);
			}
			if(p[i][j]==3) return 0;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==0){
				if(root(i)==root(j)) return 0;
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			int a,b;
			if(p[i][j]==2){
				a=root(i),b=root(j);
				if(a==b) continue;
				pa[a]=b;
				answer[a][b]=1;
				answer[b][a]=1;
				adj[a].push_back(b);
				adj[b].push_back(a);
			}
		}
	}
	for(int i=0;i<n;i++){
		cnt=0;
		if(!vs[i]) dfs(i);
		if(cnt==2) return 0;
		if(v.empty()) continue;
		answer[v[0]][v[1]]=1;
		answer[v[1]][v[0]]=1;
		v.clear();
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'void dfs(int)':
supertrees.cpp:15:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(int i=0;i<adj[u].size();i++){
      |              ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	122 ms	22124 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	122 ms	22124 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	141 ms	22056 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	63 ms	12084 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	32 ms	5716 KB	Output is correct
21	Correct	128 ms	22068 KB	Output is correct
22	Correct	132 ms	22072 KB	Output is correct
23	Correct	127 ms	22072 KB	Output is correct
24	Correct	121 ms	22100 KB	Output is correct
25	Correct	50 ms	12084 KB	Output is correct
26	Correct	53 ms	12072 KB	Output is correct
27	Correct	142 ms	22096 KB	Output is correct
28	Correct	118 ms	22096 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	5 ms	1116 KB	Output is correct
9	Correct	121 ms	22056 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	6 ms	1128 KB	Output is correct
13	Correct	126 ms	22100 KB	Output is correct
14	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	32 ms	5820 KB	Output is correct
5	Correct	129 ms	22072 KB	Output is correct
6	Correct	124 ms	22104 KB	Output is correct
7	Correct	130 ms	22100 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	35 ms	5824 KB	Output is correct
10	Correct	125 ms	22096 KB	Output is correct
11	Correct	124 ms	22100 KB	Output is correct
12	Correct	128 ms	22068 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	31 ms	5724 KB	Output is correct
17	Correct	127 ms	22096 KB	Output is correct
18	Correct	120 ms	22096 KB	Output is correct
19	Correct	122 ms	22096 KB	Output is correct
20	Correct	119 ms	22068 KB	Output is correct

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	122 ms	22124 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	141 ms	22056 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	63 ms	12084 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	32 ms	5716 KB	Output is correct
21	Correct	128 ms	22068 KB	Output is correct
22	Correct	132 ms	22072 KB	Output is correct
23	Correct	127 ms	22072 KB	Output is correct
24	Correct	121 ms	22100 KB	Output is correct
25	Correct	50 ms	12084 KB	Output is correct
26	Correct	53 ms	12072 KB	Output is correct
27	Correct	142 ms	22096 KB	Output is correct
28	Correct	118 ms	22096 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	5 ms	1116 KB	Output is correct
37	Correct	121 ms	22056 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	6 ms	1128 KB	Output is correct
41	Correct	126 ms	22100 KB	Output is correct
42	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
43	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	122 ms	22124 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	141 ms	22056 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	63 ms	12084 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	32 ms	5716 KB	Output is correct
21	Correct	128 ms	22068 KB	Output is correct
22	Correct	132 ms	22072 KB	Output is correct
23	Correct	127 ms	22072 KB	Output is correct
24	Correct	121 ms	22100 KB	Output is correct
25	Correct	50 ms	12084 KB	Output is correct
26	Correct	53 ms	12072 KB	Output is correct
27	Correct	142 ms	22096 KB	Output is correct
28	Correct	118 ms	22096 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	5 ms	1116 KB	Output is correct
37	Correct	121 ms	22056 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	6 ms	1128 KB	Output is correct
41	Correct	126 ms	22100 KB	Output is correct
42	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
43	Halted	0 ms	0 KB	-

답안 #994839

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 35.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
35.0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0