oj.uz

답안 #440885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440885 2021-07-03T12:34:18 Z roseanne_pcy 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 244 ms 24132 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long long ll;

#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int md = 1e9+7;
const ll inf = 1e18;
const int maxn = 1e3+5;

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

vector<int> par;
vector<int> subpar;
vector< vector<int> > res;
vector<int> bucks[maxn];

void init(vector<int> &p)
{
	for(int i = 0; i< (int) p.size(); i++) p[i] = i;
}

int findset(vector<int> &p, int x)
{
	if(p[x] == x) return x;
	return p[x] = findset(p, p[x]);
}

void unionset(vector<int> &p, int x, int y)
{
	int a = findset(p, x);
	int b = findset(p, y);
	if(a == b) return;
	p[a] = b;
}

void addedge(int u, int v)
{
	res[u][v] = res[v][u] = 1;
}

int construct(std::vector<std::vector<int>> p) 
{
	int n = p.size();

	par = vector<int>(n, 0);
	subpar = vector<int>(n, 0);
	res.assign(n, vector<int>(n, 0));

	init(par); init(subpar);

	bool good = true;

	for(int i = 0; i< n; i++)
	{
		for(int j = i+1; j< n; j++)
		{
			if(p[i][j] == 2 || p[i][j] == 1)
			{
				unionset(par, i, j);
			}
		}
	}

	for(int i = 0; i< n; i++)
	{
		for(int j = i+1; j< n; j++)
		{
			if(p[i][j] == 0)
			{
				if(findset(par, i) == findset(par, j))
				{
					return 0;
				}
			}
		}
	}

	for(int i = 0; i< n; i++)
	{
		for(int j = i+1; j< n; j++)
		{
			if(p[i][j] == 1)
			{
				unionset(subpar, i, j);
			}
		}
	}

	for(int i = 0; i< n; i++)
	{
		for(int j = i+1; j< n; j++)
		{
			if(p[i][j] == 2)
			{
				if(findset(subpar, i) == findset(subpar, j))
				{
					return 0;
				}
			}
		}
	}

	for(int i = 0; i< n; i++)
	{
		if(findset(subpar, i) != i) addedge(findset(subpar, i), i);
		else bucks[findset(par, i)].pb(i);
	}

	for(int i = 0; i< n; i++)
	{
		if((int) bucks[i].size() <= 1) continue;
		if((int) bucks[i].size() == 2) return 0;
		for(int j = 0; j+1< (int) bucks[i].size(); j++)
		{
			addedge(bucks[i][j], bucks[i][j+1]);
		}
		addedge(bucks[i][0], bucks[i].back());
	}

	build(res);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:68:7: warning: unused variable 'good' [-Wunused-variable]
   68 |  bool good = true;
      |       ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 225 ms 22044 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 225 ms 22044 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1140 KB Output is correct
13 Correct 226 ms 22032 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 736 KB Output is correct
17 Correct 103 ms 12052 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 292 KB Output is correct
20 Correct 57 ms 5724 KB Output is correct
21 Correct 236 ms 22076 KB Output is correct
22 Correct 235 ms 22048 KB Output is correct
23 Correct 237 ms 22032 KB Output is correct
24 Correct 226 ms 22084 KB Output is correct
25 Correct 100 ms 12048 KB Output is correct
26 Correct 92 ms 12064 KB Output is correct
27 Correct 244 ms 22032 KB Output is correct
28 Correct 222 ms 22084 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 9 ms 1112 KB Output is correct
9 Correct 223 ms 22084 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1100 KB Output is correct
13 Correct 227 ms 22048 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 105 ms 12100 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 58 ms 5784 KB Output is correct
22 Correct 229 ms 24004 KB Output is correct
23 Correct 230 ms 23952 KB Output is correct
24 Correct 236 ms 23956 KB Output is correct
25 Correct 96 ms 14084 KB Output is correct
26 Correct 97 ms 14100 KB Output is correct
27 Correct 228 ms 24016 KB Output is correct
28 Correct 233 ms 24004 KB Output is correct
29 Correct 101 ms 14148 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 57 ms 5708 KB Output is correct
5 Correct 231 ms 22032 KB Output is correct
6 Correct 225 ms 21960 KB Output is correct
7 Correct 234 ms 21956 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 59 ms 5736 KB Output is correct
10 Correct 228 ms 23956 KB Output is correct
11 Correct 230 ms 24128 KB Output is correct
12 Correct 239 ms 24004 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 58 ms 6184 KB Output is correct
17 Correct 233 ms 23952 KB Output is correct
18 Correct 228 ms 24004 KB Output is correct
19 Correct 231 ms 23944 KB Output is correct
20 Correct 223 ms 24132 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 225 ms 22044 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1140 KB Output is correct
13 Correct 226 ms 22032 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 736 KB Output is correct
17 Correct 103 ms 12052 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 292 KB Output is correct
20 Correct 57 ms 5724 KB Output is correct
21 Correct 236 ms 22076 KB Output is correct
22 Correct 235 ms 22048 KB Output is correct
23 Correct 237 ms 22032 KB Output is correct
24 Correct 226 ms 22084 KB Output is correct
25 Correct 100 ms 12048 KB Output is correct
26 Correct 92 ms 12064 KB Output is correct
27 Correct 244 ms 22032 KB Output is correct
28 Correct 222 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1112 KB Output is correct
37 Correct 223 ms 22084 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 12 ms 1100 KB Output is correct
41 Correct 227 ms 22048 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 105 ms 12100 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 58 ms 5784 KB Output is correct
50 Correct 229 ms 24004 KB Output is correct
51 Correct 230 ms 23952 KB Output is correct
52 Correct 236 ms 23956 KB Output is correct
53 Correct 96 ms 14084 KB Output is correct
54 Correct 97 ms 14100 KB Output is correct
55 Correct 228 ms 24016 KB Output is correct
56 Correct 233 ms 24004 KB Output is correct
57 Correct 101 ms 14148 KB Output is correct
58 Correct 1 ms 316 KB Output is correct
59 Correct 1 ms 312 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 108 ms 14032 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 59 ms 6276 KB Output is correct
66 Correct 96 ms 14088 KB Output is correct
67 Correct 96 ms 14212 KB Output is correct
68 Correct 101 ms 14148 KB Output is correct
69 Correct 97 ms 14148 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 225 ms 22044 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1140 KB Output is correct
13 Correct 226 ms 22032 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 736 KB Output is correct
17 Correct 103 ms 12052 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 292 KB Output is correct
20 Correct 57 ms 5724 KB Output is correct
21 Correct 236 ms 22076 KB Output is correct
22 Correct 235 ms 22048 KB Output is correct
23 Correct 237 ms 22032 KB Output is correct
24 Correct 226 ms 22084 KB Output is correct
25 Correct 100 ms 12048 KB Output is correct
26 Correct 92 ms 12064 KB Output is correct
27 Correct 244 ms 22032 KB Output is correct
28 Correct 222 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1112 KB Output is correct
37 Correct 223 ms 22084 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 12 ms 1100 KB Output is correct
41 Correct 227 ms 22048 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 105 ms 12100 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 58 ms 5784 KB Output is correct
50 Correct 229 ms 24004 KB Output is correct
51 Correct 230 ms 23952 KB Output is correct
52 Correct 236 ms 23956 KB Output is correct
53 Correct 96 ms 14084 KB Output is correct
54 Correct 97 ms 14100 KB Output is correct
55 Correct 228 ms 24016 KB Output is correct
56 Correct 233 ms 24004 KB Output is correct
57 Correct 101 ms 14148 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 57 ms 5708 KB Output is correct
62 Correct 231 ms 22032 KB Output is correct
63 Correct 225 ms 21960 KB Output is correct
64 Correct 234 ms 21956 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 59 ms 5736 KB Output is correct
67 Correct 228 ms 23956 KB Output is correct
68 Correct 230 ms 24128 KB Output is correct
69 Correct 239 ms 24004 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 0 ms 204 KB Output is correct
73 Correct 58 ms 6184 KB Output is correct
74 Correct 233 ms 23952 KB Output is correct
75 Correct 228 ms 24004 KB Output is correct
76 Correct 231 ms 23944 KB Output is correct
77 Correct 223 ms 24132 KB Output is correct
78 Correct 1 ms 316 KB Output is correct
79 Correct 1 ms 312 KB Output is correct
80 Correct 5 ms 844 KB Output is correct
81 Correct 108 ms 14032 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 0 ms 204 KB Output is correct
85 Correct 59 ms 6276 KB Output is correct
86 Correct 96 ms 14088 KB Output is correct
87 Correct 96 ms 14212 KB Output is correct
88 Correct 101 ms 14148 KB Output is correct
89 Correct 97 ms 14148 KB Output is correct
90 Correct 1 ms 316 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 5 ms 844 KB Output is correct
93 Correct 101 ms 14020 KB Output is correct
94 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -