oj.uz

Submission #903260

# Submission time Handle Problem Language Result Execution time Memory
903260 2024-01-11T06:37:41 Z ByeWorld Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 232 ms 24272 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
using namespace std;
const int MAXN = 1e3+10;
const double SMALL = 1e-6;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;

int n;
bool tag[MAXN], done[MAXN];
vector <vector<int>> adj;
vector <int> cc[MAXN];

void bd(int x, int y){
	adj[x][y] = 1; adj[y][x] = 1;
}

struct DSU {
	int par[MAXN], siz[MAXN];
	void bd(){
		for(int i=0; i<n; i++){
			par[i] = i; siz[i] = 1;
			cc[i].pb(i);
		}
	}
	int f(int x){
		if(x == par[x]) return x;
		return par[x] = f(par[x]);
	}
	bool con(int x, int y){
		return f(x) == f(y);
	}
	void mer(int x, int y){
		if(con(x, y)) return;
		x = f(x); y = f(y);
		if(siz[x] > siz[y]) swap(x, y);
		par[x] = y; siz[y] += siz[x];
		for(auto in : cc[x]) cc[y].pb(in);
	}
} A;

int construct(vector<vector<int>> p) {
	n = p.size();
	vector <int> te(n);
	for(int i=0; i<n; i++) adj.pb(te);
	A.bd();

	for(int i = 0; i < n; i++) {
		if(done[i]) continue;
		for(int x=0; x<n; x++) tag[x] = 0;

		vector <int> vec; vec.pb(i); tag[i] = 1;
		for(int j=i+1; j < n; j++){
			if(p[i][j] == 1){
				vec.pb(j); tag[j] = 1;
			}	
		}
		//for(auto in : vec) cout << in << "pp\n";
		for(auto in : vec){
			//cout << in << " in\n";
			done[in] = 1;
			for(int x=0; x<n; x++){
				if(tag[x] && p[in][x] != 1) return 0; //harusnya 1
				if(!tag[x] && p[in][x] == 1) return 0;
			}
		}
		for(int i=0; i+1<vec.size(); i++){ // build
			bd(vec[i], vec[i+1]);
			A.mer(vec[i], vec[i+1]);
		}
	}
	// for(int i=0; i<n; i++){
	// 	for(int j=0; j<n; j++) cout << adj[i][j] << ' ';
	// 	cout << '\n';
	// }

	for(int i=0; i<n; i++) done[i] = 0;
	for(int i = 0; i < n; i++) {
		if(done[i]) continue;
		for(int x=0; x<n; x++) tag[x] = 0;

		vector <int> vec; vec.pb(i); tag[i] = 1;
		for(int j=i+1; j < n; j++){
			if(p[i][j] == 2){
				vec.pb(j); tag[j] = 1;
			}	
		}

		if(vec.size() == 1) continue;
		if(vec.size() == 2) return 0;

		for(auto x : vec){
			for(auto y : vec){
				if(x==y) continue; 
				if(A.con(x, y)) return 0;
			}
		}
		//for(auto in : vec) cout << in << "pp\n";
		for(auto in : vec){
			//cout << in << " in\n";
			done[in] = 1;
			for(int x=0; x<n; x++){
				if(x==in) continue;
				if(tag[x] && p[in][x] != 2) return 0; //harusnya 1
				if(!tag[x] && p[in][x] == 2) return 0;
			}
		}
		for(int i=0; i+1<vec.size(); i++){ // build
			bd(vec[i], vec[i+1]);
		}
		bd(vec[0], vec.back());
	}

	for(int i=0; i<n; i++) adj[i][i] = 0;
	build(adj);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:72:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |   for(int i=0; i+1<vec.size(); i++){ // build
      |                ~~~^~~~~~~~~~~
supertrees.cpp:113:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for(int i=0; i+1<vec.size(); i++){ // build
      |                ~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 368 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 6 ms 1384 KB Output is correct
7 Correct 159 ms 24036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 368 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 6 ms 1384 KB Output is correct
7 Correct 159 ms 24036 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 9 ms 1432 KB Output is correct
13 Correct 165 ms 23968 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 3 ms 1000 KB Output is correct
17 Correct 96 ms 14104 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 58 ms 6340 KB Output is correct
21 Correct 175 ms 24000 KB Output is correct
22 Correct 179 ms 24212 KB Output is correct
23 Correct 209 ms 24272 KB Output is correct
24 Correct 206 ms 24048 KB Output is correct
25 Correct 63 ms 14228 KB Output is correct
26 Correct 76 ms 14236 KB Output is correct
27 Correct 172 ms 24144 KB Output is correct
28 Correct 154 ms 24104 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 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 1372 KB Output is correct
9 Correct 171 ms 24096 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 9 ms 1384 KB Output is correct
13 Correct 232 ms 24148 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 75 ms 14288 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 42 ms 6228 KB Output is correct
22 Correct 218 ms 23980 KB Output is correct
23 Correct 195 ms 24104 KB Output is correct
24 Correct 157 ms 24148 KB Output is correct
25 Correct 93 ms 14164 KB Output is correct
26 Correct 71 ms 14292 KB Output is correct
27 Correct 161 ms 24148 KB Output is correct
28 Correct 162 ms 24184 KB Output is correct
29 Correct 65 ms 14164 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 55 ms 6228 KB Output is correct
5 Correct 190 ms 24148 KB Output is correct
6 Correct 153 ms 24148 KB Output is correct
7 Correct 156 ms 24216 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 47 ms 6200 KB Output is correct
10 Correct 156 ms 24108 KB Output is correct
11 Correct 166 ms 24196 KB Output is correct
12 Correct 161 ms 24148 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 368 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 6 ms 1384 KB Output is correct
7 Correct 159 ms 24036 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 9 ms 1432 KB Output is correct
13 Correct 165 ms 23968 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 3 ms 1000 KB Output is correct
17 Correct 96 ms 14104 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 58 ms 6340 KB Output is correct
21 Correct 175 ms 24000 KB Output is correct
22 Correct 179 ms 24212 KB Output is correct
23 Correct 209 ms 24272 KB Output is correct
24 Correct 206 ms 24048 KB Output is correct
25 Correct 63 ms 14228 KB Output is correct
26 Correct 76 ms 14236 KB Output is correct
27 Correct 172 ms 24144 KB Output is correct
28 Correct 154 ms 24104 KB Output is correct
29 Correct 1 ms 500 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 9 ms 1372 KB Output is correct
37 Correct 171 ms 24096 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 9 ms 1384 KB Output is correct
41 Correct 232 ms 24148 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 75 ms 14288 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 42 ms 6228 KB Output is correct
50 Correct 218 ms 23980 KB Output is correct
51 Correct 195 ms 24104 KB Output is correct
52 Correct 157 ms 24148 KB Output is correct
53 Correct 93 ms 14164 KB Output is correct
54 Correct 71 ms 14292 KB Output is correct
55 Correct 161 ms 24148 KB Output is correct
56 Correct 162 ms 24184 KB Output is correct
57 Correct 65 ms 14164 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 4 ms 860 KB Output is correct
61 Correct 63 ms 14112 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Incorrect 16 ms 3812 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 368 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 6 ms 1384 KB Output is correct
7 Correct 159 ms 24036 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 9 ms 1432 KB Output is correct
13 Correct 165 ms 23968 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 3 ms 1000 KB Output is correct
17 Correct 96 ms 14104 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 58 ms 6340 KB Output is correct
21 Correct 175 ms 24000 KB Output is correct
22 Correct 179 ms 24212 KB Output is correct
23 Correct 209 ms 24272 KB Output is correct
24 Correct 206 ms 24048 KB Output is correct
25 Correct 63 ms 14228 KB Output is correct
26 Correct 76 ms 14236 KB Output is correct
27 Correct 172 ms 24144 KB Output is correct
28 Correct 154 ms 24104 KB Output is correct
29 Correct 1 ms 500 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 9 ms 1372 KB Output is correct
37 Correct 171 ms 24096 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 9 ms 1384 KB Output is correct
41 Correct 232 ms 24148 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 75 ms 14288 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 42 ms 6228 KB Output is correct
50 Correct 218 ms 23980 KB Output is correct
51 Correct 195 ms 24104 KB Output is correct
52 Correct 157 ms 24148 KB Output is correct
53 Correct 93 ms 14164 KB Output is correct
54 Correct 71 ms 14292 KB Output is correct
55 Correct 161 ms 24148 KB Output is correct
56 Correct 162 ms 24184 KB Output is correct
57 Correct 65 ms 14164 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 55 ms 6228 KB Output is correct
62 Correct 190 ms 24148 KB Output is correct
63 Correct 153 ms 24148 KB Output is correct
64 Correct 156 ms 24216 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 47 ms 6200 KB Output is correct
67 Correct 156 ms 24108 KB Output is correct
68 Correct 166 ms 24196 KB Output is correct
69 Correct 161 ms 24148 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
73 Halted 0 ms 0 KB -