oj.uz

Submission #305043

# Submission time Handle Problem Language Result Execution time Memory
305043 2020-09-22T13:01:36 Z srvlt Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 262 ms 26360 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define cps(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define cps2(x, y) sort(all(x), y), (x).erase(unique(all(x)), end(x))
#define mem(x, y) memset(& x, y, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int n0 = 1003;
int n, used[n0], g2[n0][n0];
vector <int> comp;
bitset <n0> g[n0], b;

void dfs(int v) {
	comp.pb(v);
	used[v] = 1;
	for (int to = 0; to < n; to++) {
		if (!g[v][to] || used[to]) continue;
		dfs(to);
	}
}

int construct(vector<vector<int>> p) {
	n = p.size();
	int type = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (p[i][j]) g[i][j] = 1;
			if (p[i][j] == 2) type = 1;
		}
	}
	//for (int i = 0; i < n; i++) {
		//for (int j = 0; j < n; j++) {
			//cerr << g[i][j];
		//}
		//cerr << '\n';
	//}
	//cerr << '\n';
	for (int i = 0; i < n; i++) {
		if (!used[i]) {
			comp.clear();
			dfs(i);
			b = g[comp[0]];
			for (int j : comp)
				if (b != g[j]) return 0;
			if (SZ(comp) == 1) continue;
			if (!type) {
				for (int j = 1; j < SZ(comp); j++)
					g2[comp[0]][comp[j]] = 1;
			}	else {
				if (SZ(comp) == 2) return 0;
				for (int j = 0; j < SZ(comp); j++)
					g2[comp[j]][comp[(j + 1) % SZ(comp)]] = 1;
			}
		}
	}
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		for (int j = 0; j < n; j++)
			if (g2[i][j] || g2[j][i]) row[j] = 1;
		answer.push_back(row);
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 261 ms 22392 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 261 ms 22392 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 245 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 640 KB Output is correct
17 Correct 120 ms 8440 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 63 ms 6008 KB Output is correct
21 Correct 244 ms 22264 KB Output is correct
22 Correct 248 ms 23928 KB Output is correct
23 Correct 256 ms 22264 KB Output is correct
24 Correct 243 ms 22252 KB Output is correct
25 Correct 99 ms 8440 KB Output is correct
26 Correct 94 ms 8440 KB Output is correct
27 Correct 252 ms 22264 KB Output is correct
28 Correct 239 ms 22336 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 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 240 ms 22392 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 2048 KB Output is correct
13 Correct 259 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 121 ms 8444 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 61 ms 7672 KB Output is correct
22 Correct 250 ms 26360 KB Output is correct
23 Correct 241 ms 25720 KB Output is correct
24 Correct 261 ms 26232 KB Output is correct
25 Correct 93 ms 8568 KB Output is correct
26 Correct 98 ms 9080 KB Output is correct
27 Correct 247 ms 25652 KB Output is correct
28 Correct 256 ms 26108 KB Output is correct
29 Correct 95 ms 8568 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 60 ms 6032 KB Output is correct
5 Correct 245 ms 22264 KB Output is correct
6 Correct 238 ms 23800 KB Output is correct
7 Correct 249 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 61 ms 7624 KB Output is correct
10 Correct 249 ms 26104 KB Output is correct
11 Correct 252 ms 25704 KB Output is correct
12 Correct 262 ms 26232 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Incorrect 1 ms 384 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 261 ms 22392 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 245 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 640 KB Output is correct
17 Correct 120 ms 8440 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 63 ms 6008 KB Output is correct
21 Correct 244 ms 22264 KB Output is correct
22 Correct 248 ms 23928 KB Output is correct
23 Correct 256 ms 22264 KB Output is correct
24 Correct 243 ms 22252 KB Output is correct
25 Correct 99 ms 8440 KB Output is correct
26 Correct 94 ms 8440 KB Output is correct
27 Correct 252 ms 22264 KB Output is correct
28 Correct 239 ms 22336 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 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 240 ms 22392 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 2048 KB Output is correct
41 Correct 259 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 121 ms 8444 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 7672 KB Output is correct
50 Correct 250 ms 26360 KB Output is correct
51 Correct 241 ms 25720 KB Output is correct
52 Correct 261 ms 26232 KB Output is correct
53 Correct 93 ms 8568 KB Output is correct
54 Correct 98 ms 9080 KB Output is correct
55 Correct 247 ms 25652 KB Output is correct
56 Correct 256 ms 26108 KB Output is correct
57 Correct 95 ms 8568 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 116 ms 8440 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Incorrect 0 ms 384 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 261 ms 22392 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 245 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 640 KB Output is correct
17 Correct 120 ms 8440 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 63 ms 6008 KB Output is correct
21 Correct 244 ms 22264 KB Output is correct
22 Correct 248 ms 23928 KB Output is correct
23 Correct 256 ms 22264 KB Output is correct
24 Correct 243 ms 22252 KB Output is correct
25 Correct 99 ms 8440 KB Output is correct
26 Correct 94 ms 8440 KB Output is correct
27 Correct 252 ms 22264 KB Output is correct
28 Correct 239 ms 22336 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 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 240 ms 22392 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 2048 KB Output is correct
41 Correct 259 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 121 ms 8444 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 7672 KB Output is correct
50 Correct 250 ms 26360 KB Output is correct
51 Correct 241 ms 25720 KB Output is correct
52 Correct 261 ms 26232 KB Output is correct
53 Correct 93 ms 8568 KB Output is correct
54 Correct 98 ms 9080 KB Output is correct
55 Correct 247 ms 25652 KB Output is correct
56 Correct 256 ms 26108 KB Output is correct
57 Correct 95 ms 8568 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 60 ms 6032 KB Output is correct
62 Correct 245 ms 22264 KB Output is correct
63 Correct 238 ms 23800 KB Output is correct
64 Correct 249 ms 22264 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 61 ms 7624 KB Output is correct
67 Correct 249 ms 26104 KB Output is correct
68 Correct 252 ms 25704 KB Output is correct
69 Correct 262 ms 26232 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Incorrect 1 ms 384 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -