oj.uz

Submission #977468

# Submission time Handle Problem Language Result Execution time Memory
977468 2024-05-08T03:16:29 Z Amaarsaa Connecting Supertrees (IOI20_supertrees) C++14
19 / 100
 195 ms 22172 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 ++) {
		for (j = 0; j < n; j ++) {
			if ( a[i][j] == 2 && i != j) Unite(i, j);
		}
	}
	for (i = 0; i < n; i ++) used[i] = 0;
	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
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 9 ms 1112 KB Output is correct
9 Correct 185 ms 22068 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 10 ms 1116 KB Output is correct
13 Correct 172 ms 22172 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 93 ms 12068 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 49 ms 5864 KB Output is correct
22 Correct 175 ms 22056 KB Output is correct
23 Correct 195 ms 22044 KB Output is correct
24 Correct 186 ms 22056 KB Output is correct
25 Correct 82 ms 12304 KB Output is correct
26 Correct 107 ms 12068 KB Output is correct
27 Correct 170 ms 22064 KB Output is correct
28 Correct 168 ms 22048 KB Output is correct
29 Correct 80 ms 12368 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Too many ways to get from 1 to 4, should be 1 found no less than 2
4 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 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 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 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -