oj.uz

Submission #779407

# Submission time Handle Problem Language Result Execution time Memory
779407 2023-07-11T11:36:04 Z andrej246 Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 167 ms 22460 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);
			vector<int> adress(n,-1);
			stack<pair<int,int>> st;
			int bnum = 1;
			st.push({s,1});
			while(!st.empty()) {
				int u = st.top().first;
				int t = st.top().second;
				st.pop();
				if (visited[u]) continue;
				//cout << u << " " << t << NL;
				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);
						int type = 0;
						if (p[u][v] == 2) t = 0;
						if (p[u][v] == 1) {
                            if (adress[v] > 0 && adress[v] < t) type = t = adress[v];
                            if (t > 0) type = t;
							else if (adress[v] > 0) type = t = adress[v];
							else t = type = ++bnum;
						}
						st.push({v,type});
					}
				}
				is_cycle = (t == 0);
				if (is_cycle)  {
					cycle.push_back(u);
					incycle[u] = true;
				}
				else branch.push_back(u);
				adress[u] = t;
				comp.push_back(u);
			}
			//PRINTV(branch);
			//PRINTV(cycle);
			//PRINTV(adress);
			//PRINTV(incycle);
			for (auto u: comp) {
				for (auto v: comp) {
					int expected = 2;
					if (u == v) expected = 1;
					if ((adress[u] == adress[v]) && (adress[u] != 0)) expected = 1;
					if (expected != p[u][v]) return 0;
				}
			}
			//PRINTV(cycle);
			if (cycle.size() >= 1 && cycle.size() + bnum-1 <= 3) 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 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 157 ms 22460 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 157 ms 22460 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 155 ms 22404 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 908 KB Output is correct
17 Correct 72 ms 14600 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 42 ms 6092 KB Output is correct
21 Correct 167 ms 22344 KB Output is correct
22 Correct 157 ms 22372 KB Output is correct
23 Correct 157 ms 22404 KB Output is correct
24 Correct 147 ms 22404 KB Output is correct
25 Correct 60 ms 12556 KB Output is correct
26 Correct 63 ms 12432 KB Output is correct
27 Correct 152 ms 22360 KB Output is correct
28 Correct 158 ms 22404 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 300 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 157 ms 22460 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 155 ms 22404 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 908 KB Output is correct
17 Correct 72 ms 14600 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 42 ms 6092 KB Output is correct
21 Correct 167 ms 22344 KB Output is correct
22 Correct 157 ms 22372 KB Output is correct
23 Correct 157 ms 22404 KB Output is correct
24 Correct 147 ms 22404 KB Output is correct
25 Correct 60 ms 12556 KB Output is correct
26 Correct 63 ms 12432 KB Output is correct
27 Correct 152 ms 22360 KB Output is correct
28 Correct 158 ms 22404 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Incorrect 0 ms 300 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 157 ms 22460 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 155 ms 22404 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 908 KB Output is correct
17 Correct 72 ms 14600 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 42 ms 6092 KB Output is correct
21 Correct 167 ms 22344 KB Output is correct
22 Correct 157 ms 22372 KB Output is correct
23 Correct 157 ms 22404 KB Output is correct
24 Correct 147 ms 22404 KB Output is correct
25 Correct 60 ms 12556 KB Output is correct
26 Correct 63 ms 12432 KB Output is correct
27 Correct 152 ms 22360 KB Output is correct
28 Correct 158 ms 22404 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Incorrect 0 ms 300 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -