oj.uz

Submission #977449

# Submission time Handle Problem Language Result Execution time Memory
977449 2024-05-08T02:21:34 Z Amaarsaa Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 193 ms 22188 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
vector < int > adj[1002];
int ataman[10002], used[1002];
int Get(int x) {
	if ( x == ataman[x]) return x;
	return ataman[x] = Get(ataman[x]);
}
void Unite(int x, int y) {
	x = Get(x);
	y = Get(y);
	if (x == y) return ;
	if ( x < y) swap(x, y);
	ataman[x]= y;
}
int construct(vector<vector<int>> a) {
	int n = a.size(), i, j;
	vector < vector < int > > ans(n, vector<int>(n, 0));
	for (i = 0; i < n; i ++) ataman[i]= i;
	int s = 1;
	for ( i = 0; i < n; i++) {
		for ( j = 0; j < n; j ++) {
			if ( a[i][j] == 1 && i != j) Unite(i, j);
		}
	}
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			if ( i == j) continue;
			if ( (a[i][j] == 0 || a[i][j] == 3) && Get(i) == Get(j)) s= 0;
			if ( a[i][j] == 1 && Get(i) != Get(j)) s = 0; 
		}
	}
	
	for (i = 0; i < n; i ++) {
		vector < int > v;
		v.push_back(i);
		for (j = i + 1; j < n; j ++) {
			if ( Get(j) == Get(i) && !used[j]) v.push_back(j);
		}
		used[i] = 1;
		for (j = 1; j < v.size(); j ++) {
			used[v[j]] = 1;
			ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 1;
		}
		
	}
	for (i = 0; i < n; i ++) ataman[i] = i;
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			if ( a[i][j] == 2 && i != j) Unite(i, j);
		}
	}
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			if ( i == j) continue;
			if ( (a[i][j] == 0 || a[i][j] == 3) && Get(i) == Get(j)) s= 0;
			if ( a[i][j] == 2 && Get(i) != Get(j)) s = 0; 
		}
	}
	
	for (i = 0; i < n; i ++) {
		vector < int > v;
		v.push_back(i);
		for (j = i + 1; j < n; j ++) {
			if ( Get(j) == Get(i) && !used[j]) v.push_back(j);
		}
		if(v.size() == 1) continue;
		if ( v.size() == 2){
			s = 0;
			break;
		}
		used[i] = 1;
		for (j = 1; j < v.size(); j ++) {
			used[v[j]] = 1;
			ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 1;
		}
		ans[v[0]][v[v.size() -1]] = ans[v[v.size() -1]][v[0]] = 1;
		
	}
	if ( s == 0) return 0;
	build(ans);
	return s;
}
/*
vector < vector < int > > b;
inp() {
	int n, i, j, x;
	cin >>n;
	b.resize(n);
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			cin >> x;
			b[i].push_back(x);
		}
	}
}
int main() {
	inp();
	cout << construct(b) << endl;
}
*/

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:42:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for (j = 1; j < v.size(); j ++) {
      |               ~~^~~~~~~~~~
supertrees.cpp:74:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for (j = 1; j < v.size(); j ++) {
      |               ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22100 KB Output is correct
8 Correct 1 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 193 ms 21988 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 93 ms 12116 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 43 ms 5716 KB Output is correct
21 Correct 177 ms 22140 KB Output is correct
22 Correct 184 ms 22052 KB Output is correct
23 Correct 180 ms 22028 KB Output is correct
24 Correct 171 ms 22188 KB Output is correct
25 Correct 90 ms 12300 KB Output is correct
26 Correct 75 ms 12112 KB Output is correct
27 Correct 167 ms 22096 KB Output is correct
28 Correct 169 ms 22096 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 344 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22100 KB Output is correct
8 Correct 1 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 193 ms 21988 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 93 ms 12116 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 43 ms 5716 KB Output is correct
21 Correct 177 ms 22140 KB Output is correct
22 Correct 184 ms 22052 KB Output is correct
23 Correct 180 ms 22028 KB Output is correct
24 Correct 171 ms 22188 KB Output is correct
25 Correct 90 ms 12300 KB Output is correct
26 Correct 75 ms 12112 KB Output is correct
27 Correct 167 ms 22096 KB Output is correct
28 Correct 169 ms 22096 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 344 KB Output is correct
32 Incorrect 0 ms 348 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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 165 ms 22100 KB Output is correct
8 Correct 1 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 193 ms 21988 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 93 ms 12116 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 43 ms 5716 KB Output is correct
21 Correct 177 ms 22140 KB Output is correct
22 Correct 184 ms 22052 KB Output is correct
23 Correct 180 ms 22028 KB Output is correct
24 Correct 171 ms 22188 KB Output is correct
25 Correct 90 ms 12300 KB Output is correct
26 Correct 75 ms 12112 KB Output is correct
27 Correct 167 ms 22096 KB Output is correct
28 Correct 169 ms 22096 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 344 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -