oj.uz

답안 #441090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441090 2021-07-04T06:40:30 Z roseanne_pcy 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 267 ms 22232 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];
vector<int> subbucks[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] > 0)
			{
				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);

		subbucks[findset(subpar, 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;

		int val = -1;

		for(int j = 0; j< (int) bucks[i].size(); j++)
		{
			for(int k = j+1; k< (int) bucks[i].size(); k++)
			{
				int u = bucks[i][j], v = bucks[i][k];
				for(int su : subbucks[u])
				{
					for(int sv : subbucks[v])
					{
						if(val == -1) val = p[su][sv];
						else if(val != p[su][sv]) 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());
		if(val == 3 && bucks[i].size() == 3) return 0;
		if(val == 3) addedge(bucks[i][0], bucks[i][2]);
	}

	build(res);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 10 ms 1228 KB Output is correct
7 Correct 257 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 10 ms 1228 KB Output is correct
7 Correct 257 ms 22036 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 12 ms 1228 KB Output is correct
13 Correct 246 ms 22060 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 107 ms 12076 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 58 ms 5804 KB Output is correct
21 Correct 264 ms 22052 KB Output is correct
22 Correct 239 ms 22064 KB Output is correct
23 Correct 267 ms 22036 KB Output is correct
24 Correct 231 ms 22072 KB Output is correct
25 Correct 97 ms 12072 KB Output is correct
26 Correct 101 ms 12092 KB Output is correct
27 Correct 267 ms 22232 KB Output is correct
28 Correct 232 ms 22144 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 10 ms 1140 KB Output is correct
9 Correct 247 ms 22192 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 251 ms 22156 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 109 ms 12072 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 58 ms 5808 KB Output is correct
22 Correct 229 ms 22044 KB Output is correct
23 Correct 230 ms 22084 KB Output is correct
24 Correct 260 ms 22084 KB Output is correct
25 Correct 105 ms 12216 KB Output is correct
26 Correct 100 ms 12084 KB Output is correct
27 Correct 232 ms 22068 KB Output is correct
28 Correct 245 ms 22212 KB Output is correct
29 Correct 98 ms 12216 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 57 ms 5700 KB Output is correct
5 Correct 238 ms 22068 KB Output is correct
6 Correct 229 ms 22084 KB Output is correct
7 Correct 239 ms 22084 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 59 ms 5804 KB Output is correct
10 Correct 232 ms 22056 KB Output is correct
11 Correct 231 ms 22100 KB Output is correct
12 Correct 241 ms 22196 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 60 ms 5772 KB Output is correct
17 Correct 232 ms 22020 KB Output is correct
18 Correct 237 ms 22084 KB Output is correct
19 Correct 241 ms 22036 KB Output is correct
20 Correct 241 ms 22072 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 10 ms 1228 KB Output is correct
7 Correct 257 ms 22036 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 12 ms 1228 KB Output is correct
13 Correct 246 ms 22060 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 107 ms 12076 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 58 ms 5804 KB Output is correct
21 Correct 264 ms 22052 KB Output is correct
22 Correct 239 ms 22064 KB Output is correct
23 Correct 267 ms 22036 KB Output is correct
24 Correct 231 ms 22072 KB Output is correct
25 Correct 97 ms 12072 KB Output is correct
26 Correct 101 ms 12092 KB Output is correct
27 Correct 267 ms 22232 KB Output is correct
28 Correct 232 ms 22144 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 10 ms 1140 KB Output is correct
37 Correct 247 ms 22192 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 10 ms 1228 KB Output is correct
41 Correct 251 ms 22156 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 109 ms 12072 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 58 ms 5808 KB Output is correct
50 Correct 229 ms 22044 KB Output is correct
51 Correct 230 ms 22084 KB Output is correct
52 Correct 260 ms 22084 KB Output is correct
53 Correct 105 ms 12216 KB Output is correct
54 Correct 100 ms 12084 KB Output is correct
55 Correct 232 ms 22068 KB Output is correct
56 Correct 245 ms 22212 KB Output is correct
57 Correct 98 ms 12216 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 5 ms 716 KB Output is correct
61 Correct 105 ms 12088 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 61 ms 5832 KB Output is correct
66 Correct 102 ms 12076 KB Output is correct
67 Correct 101 ms 12072 KB Output is correct
68 Correct 98 ms 12100 KB Output is correct
69 Correct 100 ms 12204 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 10 ms 1228 KB Output is correct
7 Correct 257 ms 22036 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 12 ms 1228 KB Output is correct
13 Correct 246 ms 22060 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 107 ms 12076 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 58 ms 5804 KB Output is correct
21 Correct 264 ms 22052 KB Output is correct
22 Correct 239 ms 22064 KB Output is correct
23 Correct 267 ms 22036 KB Output is correct
24 Correct 231 ms 22072 KB Output is correct
25 Correct 97 ms 12072 KB Output is correct
26 Correct 101 ms 12092 KB Output is correct
27 Correct 267 ms 22232 KB Output is correct
28 Correct 232 ms 22144 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 10 ms 1140 KB Output is correct
37 Correct 247 ms 22192 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 10 ms 1228 KB Output is correct
41 Correct 251 ms 22156 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 109 ms 12072 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 58 ms 5808 KB Output is correct
50 Correct 229 ms 22044 KB Output is correct
51 Correct 230 ms 22084 KB Output is correct
52 Correct 260 ms 22084 KB Output is correct
53 Correct 105 ms 12216 KB Output is correct
54 Correct 100 ms 12084 KB Output is correct
55 Correct 232 ms 22068 KB Output is correct
56 Correct 245 ms 22212 KB Output is correct
57 Correct 98 ms 12216 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 0 ms 332 KB Output is correct
61 Correct 57 ms 5700 KB Output is correct
62 Correct 238 ms 22068 KB Output is correct
63 Correct 229 ms 22084 KB Output is correct
64 Correct 239 ms 22084 KB Output is correct
65 Correct 0 ms 332 KB Output is correct
66 Correct 59 ms 5804 KB Output is correct
67 Correct 232 ms 22056 KB Output is correct
68 Correct 231 ms 22100 KB Output is correct
69 Correct 241 ms 22196 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 60 ms 5772 KB Output is correct
74 Correct 232 ms 22020 KB Output is correct
75 Correct 237 ms 22084 KB Output is correct
76 Correct 241 ms 22036 KB Output is correct
77 Correct 241 ms 22072 KB Output is correct
78 Correct 0 ms 332 KB Output is correct
79 Correct 0 ms 332 KB Output is correct
80 Correct 5 ms 716 KB Output is correct
81 Correct 105 ms 12088 KB Output is correct
82 Correct 1 ms 332 KB Output is correct
83 Correct 0 ms 332 KB Output is correct
84 Correct 1 ms 332 KB Output is correct
85 Correct 61 ms 5832 KB Output is correct
86 Correct 102 ms 12076 KB Output is correct
87 Correct 101 ms 12072 KB Output is correct
88 Correct 98 ms 12100 KB Output is correct
89 Correct 100 ms 12204 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 1 ms 332 KB Output is correct
92 Correct 5 ms 716 KB Output is correct
93 Correct 107 ms 12076 KB Output is correct
94 Correct 1 ms 332 KB Output is correct
95 Correct 0 ms 332 KB Output is correct
96 Correct 1 ms 332 KB Output is correct
97 Correct 30 ms 3316 KB Output is correct
98 Correct 101 ms 12100 KB Output is correct
99 Correct 102 ms 12084 KB Output is correct
100 Correct 98 ms 12072 KB Output is correct
101 Correct 99 ms 12228 KB Output is correct
102 Incorrect 236 ms 22084 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -