oj.uz

Submission #1059750

# Submission time Handle Problem Language Result Execution time Memory
1059750 2024-08-15T07:46:31 Z pcc Fountain Parks (IOI21_parks) C++17
55 / 100
 523 ms 105448 KB 
#include "parks.h"
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")

#define pii pair<int,int>
#define fs first
#define sc second
#define _all(T) T.begin(),T.end()

const int mxn = 2e5+10;
int N;
int S;

struct DSU{
	int dsu[mxn];
	DSU(){
		iota(dsu,dsu+mxn,0);
	}
	int root(int k){
		return k == dsu[k]?k:dsu[k] = root(dsu[k]);
	}
	void onion(int a,int b){
		dsu[root(a)] = root(b);
	}
};

DSU dsu;

vector<int> ans[4];

void addans(int s,int e,int x,int y){
	dsu.onion(s,e);
	ans[0].push_back(s);
	ans[1].push_back(e);
	ans[2].push_back(x);
	ans[3].push_back(y);
	return;
}

map<pii,int> mp;
vector<pii> edges;
vector<pii> all;

void check(int a,int b){
	if(dsu.root(a) == dsu.root(b))return;
	edges.push_back(pii(a,b));
	dsu.onion(a,b);
	return;
}

vector<int> lef[mxn],rig[mxn*2];
int mx[mxn],my[mxn*2];
int deg[mxn*6];
bitset<mxn> done;

void dfs(int now){
	if(mx[now] != -1)return;
	int tar = -1;
	for(auto nxt:lef[now]){
		if(my[nxt] == -1){
			if(tar == -1)tar = nxt;
			else if(tar != -1&&deg[nxt]>deg[tar])tar = nxt;
		}
	}
	assert(tar != -1);
	mx[now] = tar;
	my[tar] = now;
	for(auto nxt:rig[mx[now]]){
		if(mx[nxt] == -1)dfs(nxt);
	}
	return;
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
	S = clock();
    if (x.size() == 1) {
		build({}, {}, {}, {});
        return 1;
    }
	N = x.size();
	for(int i = 0;i<N;i++){
		pii pos = pii(x[i],y[i]);
		if(mp.find(pii(pos.fs-2,pos.sc)) != mp.end())check(mp[pii(pos.fs-2,pos.sc)],i);
		if(mp.find(pii(pos.fs+2,pos.sc)) != mp.end())check(mp[pii(pos.fs+2,pos.sc)],i);
		if(mp.find(pii(pos.fs,pos.sc-2)) != mp.end())check(mp[pii(pos.fs,pos.sc-2)],i);
		if(mp.find(pii(pos.fs,pos.sc+2)) != mp.end())check(mp[pii(pos.fs,pos.sc+2)],i);
		mp[pos] = i;
	}
	if(edges.size() != N-1)return 0;
	for(int i = 0;i<edges.size();i++){
		auto [s,e] = edges[i];
		if(x[s]>x[e])swap(s,e);
		if(x[s] == x[e]&&y[s]>y[e])swap(s,e);
		if(x[s] == x[e]){
			all.push_back(pii(x[s]-1,(y[s]+y[e])>>1));
			all.push_back(pii(x[s]+1,(y[s]+y[e])>>1));
		}
		else if(y[s] == y[e]){
			all.push_back(pii((x[s]+x[e])>>1,y[s]-1));
			all.push_back(pii((x[s]+x[e])>>1,y[s]+1));
		}
	}
	//cerr<<"EDGES: ";for(auto [s,e]:edges)cerr<<s<<' '<<e<<endl;
	sort(all.begin(),all.end());all.erase(unique(all.begin(),all.end()),all.end());
	for(int i = 0;i<edges.size();i++){
		auto [s,e] = edges[i];
		if(x[s] == x[e]){
			int p = lower_bound(_all(all),pii(x[s]-1,(y[s]+y[e])>>1))-all.begin();
			rig[p].push_back(i);
			deg[p]++;
			lef[i].push_back(p);
			p = lower_bound(_all(all),pii(x[s]+1,(y[s]+y[e])>>1))-all.begin();
			rig[p].push_back(i);
			deg[p]++;
			lef[i].push_back(p);
		}
		else if(y[s] == y[e]){
			int p = lower_bound(_all(all),pii((x[s]+x[e])>>1,y[s]-1))-all.begin();
			deg[p]++;
			rig[p].push_back(i);
			lef[i].push_back(p);
			p = lower_bound(_all(all),pii((x[s]+x[e])>>1,y[s]+1))-all.begin();
			rig[p].push_back(i);
			deg[p]++;
			lef[i].push_back(p);
		}
	}

	queue<int> q;
	for(int i = 0;i<all.size();i++){
		if(deg[i] == 1)q.push(i);
	}

	memset(mx,-1,sizeof(mx));
	memset(my,-1,sizeof(my));

	while(!q.empty()){
		auto now = q.front();
		q.pop();
		int tar = -1;
		for(auto nxt:rig[now]){
			if(mx[nxt] == -1)tar = nxt;
		}
		if(tar == -1)continue;
		mx[tar] = now;
		my[now] = tar;
		for(auto nxt:lef[tar]){
			deg[nxt]--;
			if(deg[nxt] == 1)q.push(nxt);
		}
	}

	for(int i = 0;i<all.size();i++){
		if(my[i] != -1)continue;
		if(deg[i] == 3){
			int tar = -1;
			vector<int> v;
			map<int,int> mp;
			for(auto &j:rig[i]){
				if(mx[j] != -1)continue;
				auto &[s,e]=edges[j];
				mp[s]++;
				mp[e]++;
				if(x[s]>x[e]||(x[s] == x[e]&&y[s]>y[e]))swap(s,e);
				v.push_back(j);
			}
			pii pos = pii(-1,-1);
			for(auto &j:mp){
				if(j.sc>1){
					if(pos.fs == -1)pos.fs = j.fs;
					else pos.sc = j.sc;
				}
			}
			if(v.size() != 3)exit(0);
			assert(v.size() == 3);
			for(auto &j:v){
				auto now = edges[j];
				if(now.fs == pos.fs&&now.sc == pos.sc)tar = j;
				else if(now.fs == pos.sc&&now.sc == pos.fs)tar = j;
			}
			assert(tar != -1);
			mx[tar] = i;
			my[i] = tar;
			for(auto &j:rig[i]){
				if(mx[j] == -1)dfs(j);
			}
		}
	}

	for(int i = 0;i<edges.size();i++){
		if(mx[i] != -1)continue;
		dfs(i);
	}
	

	for(int i = 0;i<edges.size();i++){
		if(mx[i] == -1)return 0;
		int tar = mx[i];
		addans(edges[i].fs,edges[i].sc,all[tar].fs,all[tar].sc);
	}

	build(ans[0],ans[1],ans[2],ans[3]);
	return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:93:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   93 |  if(edges.size() != N-1)return 0;
      |     ~~~~~~~~~~~~~^~~~~~
parks.cpp:94:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:109:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:134:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |  for(int i = 0;i<all.size();i++){
      |                ~^~~~~~~~~~~
parks.cpp:157:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |  for(int i = 0;i<all.size();i++){
      |                ~^~~~~~~~~~~
parks.cpp:194:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:200:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15312 KB Output is correct
2 Correct 7 ms 17480 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 7 ms 17496 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 176 ms 45360 KB Output is correct
10 Correct 17 ms 20444 KB Output is correct
11 Correct 71 ms 33188 KB Output is correct
12 Correct 22 ms 21972 KB Output is correct
13 Correct 32 ms 19404 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15452 KB Output is correct
16 Correct 177 ms 45292 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15312 KB Output is correct
2 Correct 7 ms 17480 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 7 ms 17496 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 176 ms 45360 KB Output is correct
10 Correct 17 ms 20444 KB Output is correct
11 Correct 71 ms 33188 KB Output is correct
12 Correct 22 ms 21972 KB Output is correct
13 Correct 32 ms 19404 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15452 KB Output is correct
16 Correct 177 ms 45292 KB Output is correct
17 Correct 10 ms 17752 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 7 ms 17500 KB Output is correct
20 Correct 7 ms 17500 KB Output is correct
21 Correct 6 ms 15248 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 447 ms 66464 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 9 ms 17756 KB Output is correct
26 Correct 7 ms 15452 KB Output is correct
27 Correct 8 ms 15452 KB Output is correct
28 Correct 153 ms 36924 KB Output is correct
29 Correct 249 ms 46996 KB Output is correct
30 Correct 345 ms 56660 KB Output is correct
31 Correct 443 ms 66328 KB Output is correct
32 Correct 10 ms 17496 KB Output is correct
33 Correct 7 ms 17500 KB Output is correct
34 Correct 7 ms 17448 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 7 ms 15316 KB Output is correct
37 Correct 8 ms 17500 KB Output is correct
38 Correct 7 ms 17500 KB Output is correct
39 Correct 7 ms 17500 KB Output is correct
40 Correct 7 ms 17500 KB Output is correct
41 Correct 6 ms 15196 KB Output is correct
42 Correct 7 ms 17484 KB Output is correct
43 Correct 7 ms 15448 KB Output is correct
44 Correct 8 ms 15452 KB Output is correct
45 Correct 197 ms 43328 KB Output is correct
46 Correct 309 ms 55244 KB Output is correct
47 Correct 303 ms 54692 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15312 KB Output is correct
2 Correct 7 ms 17480 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 7 ms 17496 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 176 ms 45360 KB Output is correct
10 Correct 17 ms 20444 KB Output is correct
11 Correct 71 ms 33188 KB Output is correct
12 Correct 22 ms 21972 KB Output is correct
13 Correct 32 ms 19404 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15452 KB Output is correct
16 Correct 177 ms 45292 KB Output is correct
17 Correct 10 ms 17752 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 7 ms 17500 KB Output is correct
20 Correct 7 ms 17500 KB Output is correct
21 Correct 6 ms 15248 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 447 ms 66464 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 9 ms 17756 KB Output is correct
26 Correct 7 ms 15452 KB Output is correct
27 Correct 8 ms 15452 KB Output is correct
28 Correct 153 ms 36924 KB Output is correct
29 Correct 249 ms 46996 KB Output is correct
30 Correct 345 ms 56660 KB Output is correct
31 Correct 443 ms 66328 KB Output is correct
32 Correct 10 ms 17496 KB Output is correct
33 Correct 7 ms 17500 KB Output is correct
34 Correct 7 ms 17448 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 7 ms 15316 KB Output is correct
37 Correct 8 ms 17500 KB Output is correct
38 Correct 7 ms 17500 KB Output is correct
39 Correct 7 ms 17500 KB Output is correct
40 Correct 7 ms 17500 KB Output is correct
41 Correct 6 ms 15196 KB Output is correct
42 Correct 7 ms 17484 KB Output is correct
43 Correct 7 ms 15448 KB Output is correct
44 Correct 8 ms 15452 KB Output is correct
45 Correct 197 ms 43328 KB Output is correct
46 Correct 309 ms 55244 KB Output is correct
47 Correct 303 ms 54692 KB Output is correct
48 Correct 7 ms 17500 KB Output is correct
49 Correct 7 ms 17500 KB Output is correct
50 Correct 7 ms 17496 KB Output is correct
51 Correct 10 ms 17500 KB Output is correct
52 Correct 7 ms 17500 KB Output is correct
53 Correct 7 ms 17500 KB Output is correct
54 Correct 7 ms 17500 KB Output is correct
55 Runtime error 404 ms 105448 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15312 KB Output is correct
2 Correct 7 ms 17480 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 7 ms 17496 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 176 ms 45360 KB Output is correct
10 Correct 17 ms 20444 KB Output is correct
11 Correct 71 ms 33188 KB Output is correct
12 Correct 22 ms 21972 KB Output is correct
13 Correct 32 ms 19404 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15452 KB Output is correct
16 Correct 177 ms 45292 KB Output is correct
17 Correct 7 ms 17496 KB Output is correct
18 Correct 9 ms 17500 KB Output is correct
19 Correct 6 ms 15208 KB Output is correct
20 Correct 424 ms 67324 KB Output is correct
21 Correct 414 ms 66844 KB Output is correct
22 Correct 435 ms 66692 KB Output is correct
23 Correct 370 ms 65640 KB Output is correct
24 Correct 180 ms 32596 KB Output is correct
25 Correct 259 ms 34000 KB Output is correct
26 Correct 223 ms 33984 KB Output is correct
27 Correct 448 ms 73380 KB Output is correct
28 Correct 469 ms 73216 KB Output is correct
29 Correct 486 ms 72964 KB Output is correct
30 Correct 505 ms 73240 KB Output is correct
31 Correct 7 ms 17500 KB Output is correct
32 Correct 32 ms 21364 KB Output is correct
33 Correct 82 ms 24268 KB Output is correct
34 Correct 418 ms 67100 KB Output is correct
35 Correct 14 ms 16220 KB Output is correct
36 Correct 61 ms 20000 KB Output is correct
37 Correct 124 ms 25032 KB Output is correct
38 Correct 177 ms 38644 KB Output is correct
39 Correct 247 ms 45540 KB Output is correct
40 Correct 335 ms 54388 KB Output is correct
41 Correct 400 ms 61456 KB Output is correct
42 Correct 488 ms 68640 KB Output is correct
43 Correct 7 ms 17496 KB Output is correct
44 Correct 7 ms 17500 KB Output is correct
45 Correct 7 ms 17500 KB Output is correct
46 Correct 6 ms 15316 KB Output is correct
47 Correct 7 ms 15192 KB Output is correct
48 Correct 8 ms 17496 KB Output is correct
49 Correct 8 ms 17496 KB Output is correct
50 Correct 8 ms 17620 KB Output is correct
51 Correct 10 ms 17500 KB Output is correct
52 Correct 10 ms 15200 KB Output is correct
53 Correct 7 ms 17492 KB Output is correct
54 Correct 7 ms 15452 KB Output is correct
55 Correct 8 ms 15448 KB Output is correct
56 Correct 203 ms 43312 KB Output is correct
57 Correct 318 ms 55244 KB Output is correct
58 Correct 297 ms 55236 KB Output is correct
59 Correct 7 ms 15192 KB Output is correct
60 Correct 7 ms 17500 KB Output is correct
61 Correct 6 ms 15196 KB Output is correct
62 Correct 414 ms 73524 KB Output is correct
63 Correct 415 ms 73388 KB Output is correct
64 Correct 411 ms 73196 KB Output is correct
65 Correct 9 ms 15452 KB Output is correct
66 Correct 11 ms 15972 KB Output is correct
67 Correct 198 ms 43316 KB Output is correct
68 Correct 321 ms 56232 KB Output is correct
69 Correct 455 ms 69660 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15312 KB Output is correct
2 Correct 7 ms 17480 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 7 ms 17496 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 176 ms 45360 KB Output is correct
10 Correct 17 ms 20444 KB Output is correct
11 Correct 71 ms 33188 KB Output is correct
12 Correct 22 ms 21972 KB Output is correct
13 Correct 32 ms 19404 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15452 KB Output is correct
16 Correct 177 ms 45292 KB Output is correct
17 Correct 424 ms 74012 KB Output is correct
18 Correct 417 ms 74356 KB Output is correct
19 Correct 433 ms 66840 KB Output is correct
20 Correct 511 ms 66240 KB Output is correct
21 Correct 431 ms 64324 KB Output is correct
22 Correct 8 ms 17500 KB Output is correct
23 Correct 65 ms 25892 KB Output is correct
24 Correct 25 ms 17112 KB Output is correct
25 Correct 87 ms 22284 KB Output is correct
26 Correct 150 ms 27040 KB Output is correct
27 Correct 234 ms 43824 KB Output is correct
28 Correct 295 ms 50612 KB Output is correct
29 Correct 368 ms 56996 KB Output is correct
30 Correct 441 ms 62676 KB Output is correct
31 Correct 512 ms 70376 KB Output is correct
32 Correct 483 ms 69660 KB Output is correct
33 Correct 455 ms 73500 KB Output is correct
34 Correct 10 ms 15584 KB Output is correct
35 Correct 14 ms 15964 KB Output is correct
36 Correct 238 ms 42996 KB Output is correct
37 Correct 362 ms 56228 KB Output is correct
38 Correct 523 ms 68296 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15312 KB Output is correct
2 Correct 7 ms 17480 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 7 ms 17496 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 6 ms 15192 KB Output is correct
9 Correct 176 ms 45360 KB Output is correct
10 Correct 17 ms 20444 KB Output is correct
11 Correct 71 ms 33188 KB Output is correct
12 Correct 22 ms 21972 KB Output is correct
13 Correct 32 ms 19404 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15452 KB Output is correct
16 Correct 177 ms 45292 KB Output is correct
17 Correct 10 ms 17752 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 7 ms 17500 KB Output is correct
20 Correct 7 ms 17500 KB Output is correct
21 Correct 6 ms 15248 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 447 ms 66464 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 9 ms 17756 KB Output is correct
26 Correct 7 ms 15452 KB Output is correct
27 Correct 8 ms 15452 KB Output is correct
28 Correct 153 ms 36924 KB Output is correct
29 Correct 249 ms 46996 KB Output is correct
30 Correct 345 ms 56660 KB Output is correct
31 Correct 443 ms 66328 KB Output is correct
32 Correct 10 ms 17496 KB Output is correct
33 Correct 7 ms 17500 KB Output is correct
34 Correct 7 ms 17448 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 7 ms 15316 KB Output is correct
37 Correct 8 ms 17500 KB Output is correct
38 Correct 7 ms 17500 KB Output is correct
39 Correct 7 ms 17500 KB Output is correct
40 Correct 7 ms 17500 KB Output is correct
41 Correct 6 ms 15196 KB Output is correct
42 Correct 7 ms 17484 KB Output is correct
43 Correct 7 ms 15448 KB Output is correct
44 Correct 8 ms 15452 KB Output is correct
45 Correct 197 ms 43328 KB Output is correct
46 Correct 309 ms 55244 KB Output is correct
47 Correct 303 ms 54692 KB Output is correct
48 Correct 7 ms 17500 KB Output is correct
49 Correct 7 ms 17500 KB Output is correct
50 Correct 7 ms 17496 KB Output is correct
51 Correct 10 ms 17500 KB Output is correct
52 Correct 7 ms 17500 KB Output is correct
53 Correct 7 ms 17500 KB Output is correct
54 Correct 7 ms 17500 KB Output is correct
55 Runtime error 404 ms 105448 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -