oj.uz

Submission #779186

# Submission time Handle Problem Language Result Execution time Memory
779186 2023-07-11T08:48:13 Z andrej246 Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 210 ms 22464 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

#define FOR(i,N) for(long long i = 0; (i) < (N); (i)++)
#define FORS(i,v,N) for(long long i = v; (i) < (N); (i)++)
#define FORI(i,v,N,inc) for(long long i = v; (i) < (N); (i)+=(inc))

#define NL '\n'
#define EL cout << NL

#define PRINTV(v) for(auto a:(v)) {cout << a << " ";};EL
#define PRINTVV(v) for(auto a:(v)) {PRINTV(a);}

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VLL;
typedef pair<ll,ll> PL;
typedef vector<PL> VPL;
typedef vector<VPL> VVPL;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	vector<bool> visited(n,0);
	FOR(s,n) {
		if (!visited[s]) {
			vector<int> branch;
			vector<int> cycle;
			vector<int> comp;
			vector<bool> incycle(n,false);
			stack<int> st;
			st.push(s);
			while(!st.empty()) {
				int u = st.top();
				st.pop();
				if (visited[u]) continue;
				visited[u] = true;
				bool is_cycle = true;
				FOR(v,n) {
					if (v == u) continue;
					if (p[u][v] >= 1) {
                        is_cycle = is_cycle && (p[u][v] == 2);
						st.push(v);
					}
				}
				if (is_cycle)  {
					cycle.push_back(u);
					incycle[u] = true;
				}
				else branch.push_back(u);
				comp.push_back(u);
			}
			//PRINTV(branch);
			//PRINTV(cycle);
			for (auto u: comp) {
				for (auto v: comp) {
					if (p[u][v] == 0) return 0;
				}
			}
			for (auto u: branch) {
				FOR(v,n) {
					if (p[u][v] == 2 && !incycle[v]) {
                        return 0;
					}
				}
			}
			int prev_u = -1;
			for(auto u: branch) {
				if (prev_u >= 0) {
                    answer[u][prev_u] = answer[prev_u][u] = 1;
				}
				prev_u = u;
			}
			int prev_v = prev_u;
			int first_c  = prev_u;
			for (auto v: cycle) {
				if (prev_v >= 0) answer[v][prev_v] = answer[prev_v][v] = 1;
				prev_v = v;
				if (first_c == -1) first_c = v;
			}
			if (prev_v != first_c) answer[first_c][prev_v] = answer[prev_v][first_c] = 1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 161 ms 22464 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 161 ms 22464 KB Output is correct
8 Correct 1 ms 260 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1260 KB Output is correct
13 Correct 157 ms 22232 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 6 ms 820 KB Output is correct
17 Correct 73 ms 13276 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 5900 KB Output is correct
21 Correct 152 ms 22164 KB Output is correct
22 Correct 154 ms 22152 KB Output is correct
23 Correct 157 ms 22188 KB Output is correct
24 Correct 161 ms 22164 KB Output is correct
25 Correct 62 ms 12224 KB Output is correct
26 Correct 59 ms 12160 KB Output is correct
27 Correct 164 ms 22180 KB Output is correct
28 Correct 164 ms 22164 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 55 ms 5884 KB Output is correct
5 Correct 151 ms 22280 KB Output is correct
6 Correct 210 ms 22284 KB Output is correct
7 Correct 162 ms 22332 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 38 ms 5916 KB Output is correct
10 Correct 156 ms 22288 KB Output is correct
11 Correct 150 ms 22240 KB Output is correct
12 Correct 161 ms 22308 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Incorrect 15 ms 3528 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 161 ms 22464 KB Output is correct
8 Correct 1 ms 260 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1260 KB Output is correct
13 Correct 157 ms 22232 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 6 ms 820 KB Output is correct
17 Correct 73 ms 13276 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 5900 KB Output is correct
21 Correct 152 ms 22164 KB Output is correct
22 Correct 154 ms 22152 KB Output is correct
23 Correct 157 ms 22188 KB Output is correct
24 Correct 161 ms 22164 KB Output is correct
25 Correct 62 ms 12224 KB Output is correct
26 Correct 59 ms 12160 KB Output is correct
27 Correct 164 ms 22180 KB Output is correct
28 Correct 164 ms 22164 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 161 ms 22464 KB Output is correct
8 Correct 1 ms 260 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1260 KB Output is correct
13 Correct 157 ms 22232 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 6 ms 820 KB Output is correct
17 Correct 73 ms 13276 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 5900 KB Output is correct
21 Correct 152 ms 22164 KB Output is correct
22 Correct 154 ms 22152 KB Output is correct
23 Correct 157 ms 22188 KB Output is correct
24 Correct 161 ms 22164 KB Output is correct
25 Correct 62 ms 12224 KB Output is correct
26 Correct 59 ms 12160 KB Output is correct
27 Correct 164 ms 22180 KB Output is correct
28 Correct 164 ms 22164 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -