oj.uz

Submission #305826

# Submission time Handle Problem Language Result Execution time Memory
305826 2020-09-24T02:14:48 Z tincan Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 285 ms 22264 KB 
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<deque>
#include<string>
#include<unordered_map>
#include<bitset>
#include<random>
#include<chrono>
//Eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee
using namespace std;
const int MAXN = 1005;
bool vis[MAXN];
vector<int> ds1[MAXN], ds2[MAXN];
struct dsu {
	int arr[MAXN];
	dsu() { for (int i = 1; i < MAXN; i++) arr[i] = i; }
	int find(int s) { return arr[s] == s ? s : arr[s] = find(arr[s]); }
	void join(int a, int b) { if (find(a) != find(b)) arr[find(a)] = find(b); }
} st1, st2;
vector<int> thng[MAXN];
void build(vector<vector<int>> b);
inline void make(int i, int i2, vector<vector<int>> &ans) {
	ans[i][i2] = ans[i2][i] = 1;
}
int construct(vector<vector<int>> p) {
	int N = p.size();
	for (int i = 0; i < N; i++) for (int i2 = 0; i2 < N; i2++) if (p[i][i2] == 3) return 0;
	vector<vector<int>> ans(N, vector<int>(N, 0));
	for (int i = 0; i < N; i++) {
		for (int i2 = i + 1; i2 < N; i2++) {
			if (p[i][i2]) {
				if(p[i][i2] == 1) st1.join(i, i2);
				st2.join(i, i2);
			}
		}
	}

	for (int i = 0; i < N; i++) for (int i2 = i + 1; i2 < N; i2++)
		if ((p[i][i2] == 0 && st2.find(i) == st2.find(i2)) || (p[i][i2] == 2 && st1.find(i) == st1.find(i2))) return 0;
	for (int i = 0; i < N; i++) {
		ds1[st1.find(i)].push_back(i);
		ds2[st2.find(i)].push_back(st1.find(i));
	}
	for (int i = 0; i < N; i++) {
		sort(ds2[i].begin(), ds2[i].end());
		auto end = unique(ds2[i].begin(), ds2[i].end());
		ds2[i].resize((int)(end - ds2[i].begin()));
		if (ds2[i].size() == 2) return 0;
	}

	for (int i = 0; i < N; i++) {
		for (int i2 = 1; i2 < ds1[i].size(); i2++) make(ds1[i][i2], ds1[i][i2 - 1], ans);
		for (int i2 = 1; i2 < ds2[i].size(); i2++) make(ds2[i][i2], ds2[i][i2 - 1], ans);
		if(ds2[i].size() > 1) make(ds2[i].front(), ds2[i].back(), ans);
	}
	build(ans); return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:59:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for (int i2 = 1; i2 < ds1[i].size(); i2++) make(ds1[i][i2], ds1[i][i2 - 1], ans);
      |                    ~~~^~~~~~~~~~~~~~~
supertrees.cpp:60:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for (int i2 = 1; i2 < ds2[i].size(); i2++) make(ds2[i][i2], ds2[i][i2 - 1], ans);
      |                    ~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 253 ms 22176 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 253 ms 22176 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 237 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 115 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 65 ms 5904 KB Output is correct
21 Correct 240 ms 22264 KB Output is correct
22 Correct 285 ms 22264 KB Output is correct
23 Correct 254 ms 22136 KB Output is correct
24 Correct 241 ms 22196 KB Output is correct
25 Correct 101 ms 12280 KB Output is correct
26 Correct 96 ms 12200 KB Output is correct
27 Correct 259 ms 22136 KB Output is correct
28 Correct 234 ms 22208 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 237 ms 22264 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 252 ms 22188 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 111 ms 12204 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 61 ms 5848 KB Output is correct
22 Correct 240 ms 22136 KB Output is correct
23 Correct 244 ms 22264 KB Output is correct
24 Correct 257 ms 22264 KB Output is correct
25 Correct 98 ms 12280 KB Output is correct
26 Correct 100 ms 12280 KB Output is correct
27 Correct 238 ms 22264 KB Output is correct
28 Correct 253 ms 22264 KB Output is correct
29 Correct 98 ms 12408 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 244 ms 22136 KB Output is correct
6 Correct 238 ms 22264 KB Output is correct
7 Correct 256 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 61 ms 5880 KB Output is correct
10 Correct 236 ms 22136 KB Output is correct
11 Correct 237 ms 22136 KB Output is correct
12 Correct 258 ms 22140 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 60 ms 5880 KB Output is correct
17 Correct 248 ms 22136 KB Output is correct
18 Correct 244 ms 22264 KB Output is correct
19 Correct 242 ms 22136 KB Output is correct
20 Correct 238 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 253 ms 22176 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 237 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 115 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 65 ms 5904 KB Output is correct
21 Correct 240 ms 22264 KB Output is correct
22 Correct 285 ms 22264 KB Output is correct
23 Correct 254 ms 22136 KB Output is correct
24 Correct 241 ms 22196 KB Output is correct
25 Correct 101 ms 12280 KB Output is correct
26 Correct 96 ms 12200 KB Output is correct
27 Correct 259 ms 22136 KB Output is correct
28 Correct 234 ms 22208 KB Output is correct
29 Correct 1 ms 452 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 237 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 252 ms 22188 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 111 ms 12204 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5848 KB Output is correct
50 Correct 240 ms 22136 KB Output is correct
51 Correct 244 ms 22264 KB Output is correct
52 Correct 257 ms 22264 KB Output is correct
53 Correct 98 ms 12280 KB Output is correct
54 Correct 100 ms 12280 KB Output is correct
55 Correct 238 ms 22264 KB Output is correct
56 Correct 253 ms 22264 KB Output is correct
57 Correct 98 ms 12408 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 115 ms 12196 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 62 ms 5880 KB Output is correct
66 Correct 106 ms 12280 KB Output is correct
67 Correct 104 ms 12284 KB Output is correct
68 Correct 109 ms 12280 KB Output is correct
69 Correct 105 ms 12324 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 253 ms 22176 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 237 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 115 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 65 ms 5904 KB Output is correct
21 Correct 240 ms 22264 KB Output is correct
22 Correct 285 ms 22264 KB Output is correct
23 Correct 254 ms 22136 KB Output is correct
24 Correct 241 ms 22196 KB Output is correct
25 Correct 101 ms 12280 KB Output is correct
26 Correct 96 ms 12200 KB Output is correct
27 Correct 259 ms 22136 KB Output is correct
28 Correct 234 ms 22208 KB Output is correct
29 Correct 1 ms 452 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 237 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 252 ms 22188 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 111 ms 12204 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5848 KB Output is correct
50 Correct 240 ms 22136 KB Output is correct
51 Correct 244 ms 22264 KB Output is correct
52 Correct 257 ms 22264 KB Output is correct
53 Correct 98 ms 12280 KB Output is correct
54 Correct 100 ms 12280 KB Output is correct
55 Correct 238 ms 22264 KB Output is correct
56 Correct 253 ms 22264 KB Output is correct
57 Correct 98 ms 12408 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 244 ms 22136 KB Output is correct
63 Correct 238 ms 22264 KB Output is correct
64 Correct 256 ms 22136 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 61 ms 5880 KB Output is correct
67 Correct 236 ms 22136 KB Output is correct
68 Correct 237 ms 22136 KB Output is correct
69 Correct 258 ms 22140 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 60 ms 5880 KB Output is correct
74 Correct 248 ms 22136 KB Output is correct
75 Correct 244 ms 22264 KB Output is correct
76 Correct 242 ms 22136 KB Output is correct
77 Correct 238 ms 22264 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 896 KB Output is correct
81 Correct 115 ms 12196 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 62 ms 5880 KB Output is correct
86 Correct 106 ms 12280 KB Output is correct
87 Correct 104 ms 12284 KB Output is correct
88 Correct 109 ms 12280 KB Output is correct
89 Correct 105 ms 12324 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 106 ms 8232 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 25 ms 2432 KB Output is correct
98 Correct 95 ms 8228 KB Output is correct
99 Correct 99 ms 8312 KB Output is correct
100 Correct 102 ms 8312 KB Output is correct
101 Correct 97 ms 8312 KB Output is correct
102 Correct 107 ms 8312 KB Output is correct
103 Correct 106 ms 8356 KB Output is correct
104 Correct 105 ms 8312 KB Output is correct
105 Correct 108 ms 8228 KB Output is correct