oj.uz

Submission #994836

# Submission time Handle Problem Language Result Execution time Memory
994836 2024-06-08T07:16:38 Z Newtonabc Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 144 ms 22356 KB 
#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

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 118 ms 22064 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 118 ms 22064 KB Output is correct
8 Correct 1 ms 344 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 133 ms 22100 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 65 ms 12072 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 34 ms 5812 KB Output is correct
21 Correct 116 ms 22096 KB Output is correct
22 Correct 121 ms 22096 KB Output is correct
23 Correct 136 ms 22072 KB Output is correct
24 Correct 119 ms 22100 KB Output is correct
25 Correct 55 ms 12068 KB Output is correct
26 Correct 49 ms 12120 KB Output is correct
27 Correct 135 ms 22308 KB Output is correct
28 Correct 120 ms 22072 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 Incorrect 1 ms 600 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory 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 34 ms 5808 KB Output is correct
5 Correct 126 ms 22104 KB Output is correct
6 Correct 123 ms 22060 KB Output is correct
7 Correct 128 ms 22112 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 31 ms 5724 KB Output is correct
10 Correct 128 ms 22100 KB Output is correct
11 Correct 119 ms 22052 KB Output is correct
12 Correct 125 ms 22216 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 31 ms 5724 KB Output is correct
17 Correct 118 ms 22052 KB Output is correct
18 Correct 126 ms 22100 KB Output is correct
19 Correct 127 ms 22100 KB Output is correct
20 Correct 144 ms 22356 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 118 ms 22064 KB Output is correct
8 Correct 1 ms 344 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 133 ms 22100 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 65 ms 12072 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 34 ms 5812 KB Output is correct
21 Correct 116 ms 22096 KB Output is correct
22 Correct 121 ms 22096 KB Output is correct
23 Correct 136 ms 22072 KB Output is correct
24 Correct 119 ms 22100 KB Output is correct
25 Correct 55 ms 12068 KB Output is correct
26 Correct 49 ms 12120 KB Output is correct
27 Correct 135 ms 22308 KB Output is correct
28 Correct 120 ms 22072 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 600 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 118 ms 22064 KB Output is correct
8 Correct 1 ms 344 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 133 ms 22100 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 65 ms 12072 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 34 ms 5812 KB Output is correct
21 Correct 116 ms 22096 KB Output is correct
22 Correct 121 ms 22096 KB Output is correct
23 Correct 136 ms 22072 KB Output is correct
24 Correct 119 ms 22100 KB Output is correct
25 Correct 55 ms 12068 KB Output is correct
26 Correct 49 ms 12120 KB Output is correct
27 Correct 135 ms 22308 KB Output is correct
28 Correct 120 ms 22072 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 600 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -