oj.uz

Submission #617822

# Submission time Handle Problem Language Result Execution time Memory
617822 2022-08-01T14:56:14 Z amunduzbaev Fountain Parks (IOI21_parks) C++17
25 / 100
 1146 ms 60532 KB 
#include "parks.h"

#include "bits/stdc++.h"
using namespace std;

#ifndef EVAL
#include "grader.cpp"
#endif

#define ar array
typedef long long ll;

const int N = 2e5 + 5;
vector<ar<int, 3>> edges[N];

int construct_roads(vector<int> x, vector<int> y) {
	int n = x.size();
	map<ar<int, 2>, int> ss, mm;
	for(int i=0;i<n;i++){
		ss[{x[i], y[i]}] = i;
	}
	
	vector<ar<int, 2>> e, p;
	
	auto add = [&](int a, int b, int p1, int p2){
		edges[a].push_back({b, p1, p2});
		edges[b].push_back({a, p1, p2});
	};
	
	vector<int> par(n), sz(n, 1);
	iota(par.begin(), par.end(), 0);
	function<int(int)> f = [&](int x) { return (par[x] == x ? x : par[x] = f(par[x])); };
	auto merge = [&](int a, int b){
		a = f(a), b = f(b);
		if(a == b) return false;
		if(sz[a] < sz[b]) swap(a, b);
		par[b] = a, sz[a] += sz[b];
		return true;
	};
	
	for(int i=0;i<n;i++){
		if(ss.count({x[i] - 2, y[i]})){
			int j = ss[{x[i] - 2, y[i]}];
			if(!merge(i, j)) continue;
			e.push_back({i, j});
			p.push_back({-1, -1});
			int u = e.size() - 1;
			if(mm.count({x[i] - 1, y[i] - 1})){
				int v = mm[{x[i] - 1, y[i] - 1}];
				add(u, v, x[i] - 1, y[i] - 1);
				mm.erase({x[i] - 1, y[i] - 1});
			} else {
				mm[{x[i] - 1, y[i] - 1}] = u;
			}
			if(mm.count({x[i] - 1, y[i] + 1})){
				int v = mm[{x[i] - 1, y[i] + 1}];
				add(u, v, x[i] - 1, y[i] + 1);
				mm.erase({x[i] - 1, y[i] + 1});
			} else {
				mm[{x[i] - 1, y[i] + 1}] = u;
			}
		}
		
		if(ss.count({x[i], y[i] - 2})){
			int j = ss[{x[i], y[i] - 2}];
			if(!merge(i, j)) continue;
			e.push_back({i, j});
			p.push_back({-1, -1});
			int u = e.size() - 1;
			if(mm.count({x[i] - 1, y[i] - 1})){
				int v = mm[{x[i] - 1, y[i] - 1}];
				add(u, v, x[i] - 1, y[i] - 1);
				mm.erase({x[i] - 1, y[i] - 1});
			} else {
				mm[{x[i] - 1, y[i] - 1}] = u;
			}
			if(mm.count({x[i] + 1, y[i] - 1})){
				int v = mm[{x[i] + 1, y[i] - 1}];
				add(u, v, x[i] + 1, y[i] - 1);
				mm.erase({x[i] + 1, y[i] - 1});
			} else {
				mm[{x[i] + 1, y[i] - 1}] = u;
			}
		}
	}
	
	if(sz[f(0)] != n) return 0;
	int m = e.size();
	
	vector<int> used(m);
	function<void(int)> dfs = [&](int i){
		used[i] = 1;
		for(auto [x, p1, p2] : edges[i]){
			if(used[x]) continue;
			p[x] = {p1, p2};
			dfs(x);
		}
	};
	for(auto [x, i] : mm){
		if(used[i]) continue;
		p[i] = x;
		dfs(i);
	}
	
	for(int i=0;i<m;i++){
		if(used[i]) continue;
		p[i] = {edges[i].back()[1], edges[i].back()[2]};
		edges[i].pop_back();
		
		dfs(i);
	}
	
	vector<int> u(m), v(m), A(m), B(m);
	for(int i=0;i<m;i++){
		u[i] = e[i][0], v[i] = e[i][1];
		A[i] = p[i][0], B[i] = p[i][1];
	}
	
	build(u, v, A, B);
	return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 7 ms 4952 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 371 ms 32780 KB Output is correct
10 Correct 21 ms 7764 KB Output is correct
11 Correct 123 ms 19876 KB Output is correct
12 Correct 32 ms 9120 KB Output is correct
13 Correct 73 ms 15004 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 403 ms 32720 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 7 ms 4952 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 371 ms 32780 KB Output is correct
10 Correct 21 ms 7764 KB Output is correct
11 Correct 123 ms 19876 KB Output is correct
12 Correct 32 ms 9120 KB Output is correct
13 Correct 73 ms 15004 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 403 ms 32720 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Incorrect 4 ms 4948 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 7 ms 4952 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 371 ms 32780 KB Output is correct
10 Correct 21 ms 7764 KB Output is correct
11 Correct 123 ms 19876 KB Output is correct
12 Correct 32 ms 9120 KB Output is correct
13 Correct 73 ms 15004 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 403 ms 32720 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Incorrect 4 ms 4948 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 7 ms 4952 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 371 ms 32780 KB Output is correct
10 Correct 21 ms 7764 KB Output is correct
11 Correct 123 ms 19876 KB Output is correct
12 Correct 32 ms 9120 KB Output is correct
13 Correct 73 ms 15004 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 403 ms 32720 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 4 ms 4948 KB Output is correct
20 Correct 924 ms 55216 KB Output is correct
21 Correct 1006 ms 51060 KB Output is correct
22 Correct 842 ms 48808 KB Output is correct
23 Correct 743 ms 52156 KB Output is correct
24 Correct 400 ms 22220 KB Output is correct
25 Correct 898 ms 50316 KB Output is correct
26 Correct 862 ms 50248 KB Output is correct
27 Correct 1008 ms 60420 KB Output is correct
28 Correct 1038 ms 60500 KB Output is correct
29 Correct 1146 ms 60476 KB Output is correct
30 Correct 1046 ms 60484 KB Output is correct
31 Correct 4 ms 4948 KB Output is correct
32 Correct 52 ms 8152 KB Output is correct
33 Correct 111 ms 13484 KB Output is correct
34 Correct 998 ms 57336 KB Output is correct
35 Correct 20 ms 6612 KB Output is correct
36 Correct 162 ms 12764 KB Output is correct
37 Correct 395 ms 20748 KB Output is correct
38 Correct 278 ms 21688 KB Output is correct
39 Correct 454 ms 27788 KB Output is correct
40 Correct 643 ms 34072 KB Output is correct
41 Correct 901 ms 40260 KB Output is correct
42 Correct 1010 ms 46456 KB Output is correct
43 Correct 3 ms 4948 KB Output is correct
44 Correct 3 ms 4948 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 3 ms 4948 KB Output is correct
47 Correct 3 ms 4948 KB Output is correct
48 Correct 2 ms 4948 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 4 ms 4948 KB Output is correct
52 Correct 4 ms 4948 KB Output is correct
53 Correct 4 ms 4948 KB Output is correct
54 Correct 8 ms 5336 KB Output is correct
55 Correct 9 ms 5508 KB Output is correct
56 Correct 434 ms 27940 KB Output is correct
57 Correct 675 ms 38172 KB Output is correct
58 Correct 650 ms 38216 KB Output is correct
59 Correct 3 ms 5000 KB Output is correct
60 Correct 3 ms 4948 KB Output is correct
61 Correct 2 ms 4948 KB Output is correct
62 Correct 835 ms 60468 KB Output is correct
63 Correct 931 ms 60532 KB Output is correct
64 Correct 903 ms 60284 KB Output is correct
65 Correct 9 ms 5588 KB Output is correct
66 Correct 16 ms 6300 KB Output is correct
67 Correct 484 ms 27196 KB Output is correct
68 Correct 658 ms 38172 KB Output is correct
69 Correct 914 ms 49384 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 7 ms 4952 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 371 ms 32780 KB Output is correct
10 Correct 21 ms 7764 KB Output is correct
11 Correct 123 ms 19876 KB Output is correct
12 Correct 32 ms 9120 KB Output is correct
13 Correct 73 ms 15004 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 403 ms 32720 KB Output is correct
17 Correct 942 ms 60484 KB Output is correct
18 Correct 924 ms 60476 KB Output is correct
19 Correct 913 ms 56208 KB Output is correct
20 Correct 958 ms 46048 KB Output is correct
21 Correct 866 ms 47796 KB Output is correct
22 Correct 4 ms 4948 KB Output is correct
23 Incorrect 79 ms 10060 KB Solution announced impossible, but it is possible.
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 7 ms 4952 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 371 ms 32780 KB Output is correct
10 Correct 21 ms 7764 KB Output is correct
11 Correct 123 ms 19876 KB Output is correct
12 Correct 32 ms 9120 KB Output is correct
13 Correct 73 ms 15004 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5332 KB Output is correct
16 Correct 403 ms 32720 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Incorrect 4 ms 4948 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -