답안 #903348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
903348	2024-01-11T07:15:04 Z	ByeWorld	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	221 ms	24172 KB

supertrees

#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[A.f(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){ // udh pernah connect
			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[A.f(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;
			}
		}

		vector <int> s;
		for(auto in : vec){
			s.pb(A.f(in));
		}
		sort(s.begin(), s.end());
		s.resize(unique(s.begin(), s.end()) - s.begin());

		//for(auto in : s) cout << in << " s\n";
		
		for(int i=0; i+1<s.size(); i++){ // build
			bd(s[i], s[i+1]);
		}
		bd(s[0], s.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:123:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |   for(int i=0; i+1<s.size(); i++){ // build
      |                ~~~^~~~~~~~~

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	1 ms	604 KB	Output is correct
6	Correct	7 ms	1376 KB	Output is correct
7	Correct	170 ms	22076 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	1 ms	604 KB	Output is correct
6	Correct	7 ms	1376 KB	Output is correct
7	Correct	170 ms	22076 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	596 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	188 ms	22032 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	856 KB	Output is correct
17	Correct	76 ms	12328 KB	Output is correct
18	Correct	1 ms	360 KB	Output is correct
19	Correct	1 ms	356 KB	Output is correct
20	Correct	40 ms	5836 KB	Output is correct
21	Correct	166 ms	22084 KB	Output is correct
22	Correct	170 ms	22100 KB	Output is correct
23	Correct	162 ms	22196 KB	Output is correct
24	Correct	168 ms	22052 KB	Output is correct
25	Correct	69 ms	12332 KB	Output is correct
26	Correct	64 ms	12324 KB	Output is correct
27	Correct	163 ms	22232 KB	Output is correct
28	Correct	166 ms	22056 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	500 KB	Output is correct
8	Correct	10 ms	1240 KB	Output is correct
9	Correct	177 ms	24076 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	7 ms	1404 KB	Output is correct
13	Correct	164 ms	24000 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	4 ms	860 KB	Output is correct
17	Correct	70 ms	14104 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	464 KB	Output is correct
21	Correct	41 ms	6372 KB	Output is correct
22	Correct	161 ms	24104 KB	Output is correct
23	Correct	158 ms	23976 KB	Output is correct
24	Correct	176 ms	24012 KB	Output is correct
25	Correct	68 ms	14104 KB	Output is correct
26	Correct	70 ms	14284 KB	Output is correct
27	Correct	174 ms	24028 KB	Output is correct
28	Correct	182 ms	24172 KB	Output is correct
29	Correct	70 ms	14232 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	43 ms	5724 KB	Output is correct
5	Correct	221 ms	22060 KB	Output is correct
6	Correct	155 ms	22056 KB	Output is correct
7	Correct	158 ms	22096 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	44 ms	5816 KB	Output is correct
10	Correct	167 ms	22100 KB	Output is correct
11	Correct	172 ms	22216 KB	Output is correct
12	Correct	183 ms	22100 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	500 KB	Output is correct
15	Incorrect	1 ms	344 KB	Answer gives possible 0 while actual possible 1
16	Halted	0 ms	0 KB	-

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	1 ms	604 KB	Output is correct
6	Correct	7 ms	1376 KB	Output is correct
7	Correct	170 ms	22076 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	596 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	188 ms	22032 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	856 KB	Output is correct
17	Correct	76 ms	12328 KB	Output is correct
18	Correct	1 ms	360 KB	Output is correct
19	Correct	1 ms	356 KB	Output is correct
20	Correct	40 ms	5836 KB	Output is correct
21	Correct	166 ms	22084 KB	Output is correct
22	Correct	170 ms	22100 KB	Output is correct
23	Correct	162 ms	22196 KB	Output is correct
24	Correct	168 ms	22052 KB	Output is correct
25	Correct	69 ms	12332 KB	Output is correct
26	Correct	64 ms	12324 KB	Output is correct
27	Correct	163 ms	22232 KB	Output is correct
28	Correct	166 ms	22056 KB	Output is correct
29	Correct	0 ms	352 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	468 KB	Output is correct
35	Correct	1 ms	500 KB	Output is correct
36	Correct	10 ms	1240 KB	Output is correct
37	Correct	177 ms	24076 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	7 ms	1404 KB	Output is correct
41	Correct	164 ms	24000 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	1 ms	344 KB	Output is correct
44	Correct	4 ms	860 KB	Output is correct
45	Correct	70 ms	14104 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	1 ms	344 KB	Output is correct
48	Correct	1 ms	464 KB	Output is correct
49	Correct	41 ms	6372 KB	Output is correct
50	Correct	161 ms	24104 KB	Output is correct
51	Correct	158 ms	23976 KB	Output is correct
52	Correct	176 ms	24012 KB	Output is correct
53	Correct	68 ms	14104 KB	Output is correct
54	Correct	70 ms	14284 KB	Output is correct
55	Correct	174 ms	24028 KB	Output is correct
56	Correct	182 ms	24172 KB	Output is correct
57	Correct	70 ms	14232 KB	Output is correct
58	Correct	0 ms	764 KB	Output is correct
59	Correct	1 ms	344 KB	Output is correct
60	Correct	3 ms	992 KB	Output is correct
61	Correct	86 ms	14164 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	1 ms	344 KB	Output is correct
65	Incorrect	20 ms	3732 KB	Answer gives possible 0 while actual possible 1
66	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	1 ms	604 KB	Output is correct
6	Correct	7 ms	1376 KB	Output is correct
7	Correct	170 ms	22076 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	596 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	188 ms	22032 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	856 KB	Output is correct
17	Correct	76 ms	12328 KB	Output is correct
18	Correct	1 ms	360 KB	Output is correct
19	Correct	1 ms	356 KB	Output is correct
20	Correct	40 ms	5836 KB	Output is correct
21	Correct	166 ms	22084 KB	Output is correct
22	Correct	170 ms	22100 KB	Output is correct
23	Correct	162 ms	22196 KB	Output is correct
24	Correct	168 ms	22052 KB	Output is correct
25	Correct	69 ms	12332 KB	Output is correct
26	Correct	64 ms	12324 KB	Output is correct
27	Correct	163 ms	22232 KB	Output is correct
28	Correct	166 ms	22056 KB	Output is correct
29	Correct	0 ms	352 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	468 KB	Output is correct
35	Correct	1 ms	500 KB	Output is correct
36	Correct	10 ms	1240 KB	Output is correct
37	Correct	177 ms	24076 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	7 ms	1404 KB	Output is correct
41	Correct	164 ms	24000 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	1 ms	344 KB	Output is correct
44	Correct	4 ms	860 KB	Output is correct
45	Correct	70 ms	14104 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	1 ms	344 KB	Output is correct
48	Correct	1 ms	464 KB	Output is correct
49	Correct	41 ms	6372 KB	Output is correct
50	Correct	161 ms	24104 KB	Output is correct
51	Correct	158 ms	23976 KB	Output is correct
52	Correct	176 ms	24012 KB	Output is correct
53	Correct	68 ms	14104 KB	Output is correct
54	Correct	70 ms	14284 KB	Output is correct
55	Correct	174 ms	24028 KB	Output is correct
56	Correct	182 ms	24172 KB	Output is correct
57	Correct	70 ms	14232 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	43 ms	5724 KB	Output is correct
62	Correct	221 ms	22060 KB	Output is correct
63	Correct	155 ms	22056 KB	Output is correct
64	Correct	158 ms	22096 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	44 ms	5816 KB	Output is correct
67	Correct	167 ms	22100 KB	Output is correct
68	Correct	172 ms	22216 KB	Output is correct
69	Correct	183 ms	22100 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	1 ms	500 KB	Output is correct
72	Incorrect	1 ms	344 KB	Answer gives possible 0 while actual possible 1
73	Halted	0 ms	0 KB	-

답안 #903348

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 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
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0