oj.uz

Submission #1059746

# Submission time Handle Problem Language Result Execution time Memory
1059746 2024-08-15T07:44:17 Z pcc Fountain Parks (IOI21_parks) C++17
55 / 100
 515 ms 105288 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(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;
				}
			}
			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:192: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]
  192 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:198: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]
  198 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15192 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17616 KB Output is correct
5 Correct 8 ms 17500 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 7 ms 15088 KB Output is correct
9 Correct 179 ms 45356 KB Output is correct
10 Correct 18 ms 20444 KB Output is correct
11 Correct 70 ms 33140 KB Output is correct
12 Correct 23 ms 21980 KB Output is correct
13 Correct 33 ms 19412 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15316 KB Output is correct
16 Correct 186 ms 45372 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15192 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17616 KB Output is correct
5 Correct 8 ms 17500 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 7 ms 15088 KB Output is correct
9 Correct 179 ms 45356 KB Output is correct
10 Correct 18 ms 20444 KB Output is correct
11 Correct 70 ms 33140 KB Output is correct
12 Correct 23 ms 21980 KB Output is correct
13 Correct 33 ms 19412 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15316 KB Output is correct
16 Correct 186 ms 45372 KB Output is correct
17 Correct 7 ms 17600 KB Output is correct
18 Correct 7 ms 17560 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 15196 KB Output is correct
22 Correct 7 ms 17552 KB Output is correct
23 Correct 464 ms 66480 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 9 ms 17756 KB Output is correct
26 Correct 8 ms 15452 KB Output is correct
27 Correct 8 ms 15640 KB Output is correct
28 Correct 167 ms 37072 KB Output is correct
29 Correct 254 ms 46932 KB Output is correct
30 Correct 349 ms 56604 KB Output is correct
31 Correct 475 ms 66484 KB Output is correct
32 Correct 8 ms 17496 KB Output is correct
33 Correct 7 ms 17496 KB Output is correct
34 Correct 7 ms 17500 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 7 ms 15240 KB Output is correct
37 Correct 7 ms 17620 KB Output is correct
38 Correct 7 ms 17500 KB Output is correct
39 Correct 7 ms 17612 KB Output is correct
40 Correct 7 ms 17496 KB Output is correct
41 Correct 7 ms 15196 KB Output is correct
42 Correct 7 ms 17500 KB Output is correct
43 Correct 8 ms 15452 KB Output is correct
44 Correct 8 ms 15452 KB Output is correct
45 Correct 197 ms 43304 KB Output is correct
46 Correct 305 ms 55088 KB Output is correct
47 Correct 301 ms 55220 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15192 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17616 KB Output is correct
5 Correct 8 ms 17500 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 7 ms 15088 KB Output is correct
9 Correct 179 ms 45356 KB Output is correct
10 Correct 18 ms 20444 KB Output is correct
11 Correct 70 ms 33140 KB Output is correct
12 Correct 23 ms 21980 KB Output is correct
13 Correct 33 ms 19412 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15316 KB Output is correct
16 Correct 186 ms 45372 KB Output is correct
17 Correct 7 ms 17600 KB Output is correct
18 Correct 7 ms 17560 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 15196 KB Output is correct
22 Correct 7 ms 17552 KB Output is correct
23 Correct 464 ms 66480 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 9 ms 17756 KB Output is correct
26 Correct 8 ms 15452 KB Output is correct
27 Correct 8 ms 15640 KB Output is correct
28 Correct 167 ms 37072 KB Output is correct
29 Correct 254 ms 46932 KB Output is correct
30 Correct 349 ms 56604 KB Output is correct
31 Correct 475 ms 66484 KB Output is correct
32 Correct 8 ms 17496 KB Output is correct
33 Correct 7 ms 17496 KB Output is correct
34 Correct 7 ms 17500 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 7 ms 15240 KB Output is correct
37 Correct 7 ms 17620 KB Output is correct
38 Correct 7 ms 17500 KB Output is correct
39 Correct 7 ms 17612 KB Output is correct
40 Correct 7 ms 17496 KB Output is correct
41 Correct 7 ms 15196 KB Output is correct
42 Correct 7 ms 17500 KB Output is correct
43 Correct 8 ms 15452 KB Output is correct
44 Correct 8 ms 15452 KB Output is correct
45 Correct 197 ms 43304 KB Output is correct
46 Correct 305 ms 55088 KB Output is correct
47 Correct 301 ms 55220 KB Output is correct
48 Correct 7 ms 17500 KB Output is correct
49 Correct 8 ms 17500 KB Output is correct
50 Correct 8 ms 17500 KB Output is correct
51 Correct 7 ms 17496 KB Output is correct
52 Correct 7 ms 17500 KB Output is correct
53 Correct 8 ms 17500 KB Output is correct
54 Correct 7 ms 17552 KB Output is correct
55 Runtime error 409 ms 105288 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 15192 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17616 KB Output is correct
5 Correct 8 ms 17500 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 7 ms 15088 KB Output is correct
9 Correct 179 ms 45356 KB Output is correct
10 Correct 18 ms 20444 KB Output is correct
11 Correct 70 ms 33140 KB Output is correct
12 Correct 23 ms 21980 KB Output is correct
13 Correct 33 ms 19412 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15316 KB Output is correct
16 Correct 186 ms 45372 KB Output is correct
17 Correct 7 ms 17500 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 6 ms 15196 KB Output is correct
20 Correct 462 ms 67508 KB Output is correct
21 Correct 452 ms 67100 KB Output is correct
22 Correct 437 ms 67100 KB Output is correct
23 Correct 364 ms 65816 KB Output is correct
24 Correct 195 ms 32596 KB Output is correct
25 Correct 257 ms 34124 KB Output is correct
26 Correct 229 ms 33984 KB Output is correct
27 Correct 460 ms 73336 KB Output is correct
28 Correct 453 ms 73356 KB Output is correct
29 Correct 503 ms 73072 KB Output is correct
30 Correct 494 ms 73084 KB Output is correct
31 Correct 7 ms 17500 KB Output is correct
32 Correct 35 ms 21412 KB Output is correct
33 Correct 87 ms 24180 KB Output is correct
34 Correct 451 ms 67520 KB Output is correct
35 Correct 14 ms 16252 KB Output is correct
36 Correct 57 ms 20040 KB Output is correct
37 Correct 121 ms 25028 KB Output is correct
38 Correct 181 ms 38348 KB Output is correct
39 Correct 246 ms 45556 KB Output is correct
40 Correct 334 ms 54236 KB Output is correct
41 Correct 409 ms 61704 KB Output is correct
42 Correct 501 ms 68888 KB Output is correct
43 Correct 8 ms 17500 KB Output is correct
44 Correct 8 ms 17500 KB Output is correct
45 Correct 8 ms 17500 KB Output is correct
46 Correct 7 ms 15196 KB Output is correct
47 Correct 7 ms 15196 KB Output is correct
48 Correct 7 ms 17496 KB Output is correct
49 Correct 7 ms 17500 KB Output is correct
50 Correct 8 ms 17496 KB Output is correct
51 Correct 7 ms 17500 KB Output is correct
52 Correct 7 ms 15196 KB Output is correct
53 Correct 7 ms 17500 KB Output is correct
54 Correct 7 ms 15448 KB Output is correct
55 Correct 8 ms 15428 KB Output is correct
56 Correct 206 ms 43196 KB Output is correct
57 Correct 302 ms 55244 KB Output is correct
58 Correct 299 ms 55240 KB Output is correct
59 Correct 6 ms 15192 KB Output is correct
60 Correct 7 ms 17500 KB Output is correct
61 Correct 6 ms 15452 KB Output is correct
62 Correct 394 ms 73420 KB Output is correct
63 Correct 394 ms 73324 KB Output is correct
64 Correct 407 ms 73244 KB Output is correct
65 Correct 9 ms 15448 KB Output is correct
66 Correct 11 ms 15960 KB Output is correct
67 Correct 233 ms 43316 KB Output is correct
68 Correct 325 ms 56128 KB Output is correct
69 Correct 450 ms 69668 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15192 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17616 KB Output is correct
5 Correct 8 ms 17500 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 7 ms 15088 KB Output is correct
9 Correct 179 ms 45356 KB Output is correct
10 Correct 18 ms 20444 KB Output is correct
11 Correct 70 ms 33140 KB Output is correct
12 Correct 23 ms 21980 KB Output is correct
13 Correct 33 ms 19412 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15316 KB Output is correct
16 Correct 186 ms 45372 KB Output is correct
17 Correct 417 ms 74156 KB Output is correct
18 Correct 416 ms 74520 KB Output is correct
19 Correct 442 ms 67096 KB Output is correct
20 Correct 510 ms 66172 KB Output is correct
21 Correct 442 ms 64468 KB Output is correct
22 Correct 8 ms 17496 KB Output is correct
23 Correct 70 ms 26016 KB Output is correct
24 Correct 25 ms 17200 KB Output is correct
25 Correct 86 ms 22516 KB Output is correct
26 Correct 148 ms 27112 KB Output is correct
27 Correct 222 ms 44052 KB Output is correct
28 Correct 294 ms 50540 KB Output is correct
29 Correct 373 ms 57120 KB Output is correct
30 Correct 429 ms 62840 KB Output is correct
31 Correct 515 ms 70428 KB Output is correct
32 Correct 448 ms 69656 KB Output is correct
33 Correct 404 ms 73496 KB Output is correct
34 Correct 13 ms 15704 KB Output is correct
35 Correct 12 ms 15960 KB Output is correct
36 Correct 205 ms 43060 KB Output is correct
37 Correct 339 ms 56216 KB Output is correct
38 Correct 463 ms 68380 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15192 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 17616 KB Output is correct
5 Correct 8 ms 17500 KB Output is correct
6 Correct 6 ms 15196 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 7 ms 15088 KB Output is correct
9 Correct 179 ms 45356 KB Output is correct
10 Correct 18 ms 20444 KB Output is correct
11 Correct 70 ms 33140 KB Output is correct
12 Correct 23 ms 21980 KB Output is correct
13 Correct 33 ms 19412 KB Output is correct
14 Correct 7 ms 15196 KB Output is correct
15 Correct 7 ms 15316 KB Output is correct
16 Correct 186 ms 45372 KB Output is correct
17 Correct 7 ms 17600 KB Output is correct
18 Correct 7 ms 17560 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 15196 KB Output is correct
22 Correct 7 ms 17552 KB Output is correct
23 Correct 464 ms 66480 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 9 ms 17756 KB Output is correct
26 Correct 8 ms 15452 KB Output is correct
27 Correct 8 ms 15640 KB Output is correct
28 Correct 167 ms 37072 KB Output is correct
29 Correct 254 ms 46932 KB Output is correct
30 Correct 349 ms 56604 KB Output is correct
31 Correct 475 ms 66484 KB Output is correct
32 Correct 8 ms 17496 KB Output is correct
33 Correct 7 ms 17496 KB Output is correct
34 Correct 7 ms 17500 KB Output is correct
35 Correct 6 ms 15192 KB Output is correct
36 Correct 7 ms 15240 KB Output is correct
37 Correct 7 ms 17620 KB Output is correct
38 Correct 7 ms 17500 KB Output is correct
39 Correct 7 ms 17612 KB Output is correct
40 Correct 7 ms 17496 KB Output is correct
41 Correct 7 ms 15196 KB Output is correct
42 Correct 7 ms 17500 KB Output is correct
43 Correct 8 ms 15452 KB Output is correct
44 Correct 8 ms 15452 KB Output is correct
45 Correct 197 ms 43304 KB Output is correct
46 Correct 305 ms 55088 KB Output is correct
47 Correct 301 ms 55220 KB Output is correct
48 Correct 7 ms 17500 KB Output is correct
49 Correct 8 ms 17500 KB Output is correct
50 Correct 8 ms 17500 KB Output is correct
51 Correct 7 ms 17496 KB Output is correct
52 Correct 7 ms 17500 KB Output is correct
53 Correct 8 ms 17500 KB Output is correct
54 Correct 7 ms 17552 KB Output is correct
55 Runtime error 409 ms 105288 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -