oj.uz

답안 #1059677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059677 2024-08-15T06:59:50 Z pcc 분수 공원 (IOI21_parks) C++17
55 / 100
 516 ms 105276 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){
	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<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:92: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]
   92 |  if(edges.size() != N-1)return 0;
      |     ~~~~~~~~~~~~~^~~~~~
parks.cpp:93: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]
   93 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:108: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]
  108 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:133: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]
  133 |  for(int i = 0;i<all.size();i++){
      |                ~^~~~~~~~~~~
parks.cpp:156: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]
  156 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~
parks.cpp:161: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]
  161 |  for(int i = 0;i<edges.size();i++){
      |                ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15196 KB Output is correct
2 Correct 7 ms 17616 KB Output is correct
3 Correct 6 ms 15240 KB Output is correct
4 Correct 9 ms 17592 KB Output is correct
5 Correct 7 ms 17592 KB Output is correct
6 Correct 9 ms 15296 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 236 ms 45304 KB Output is correct
10 Correct 17 ms 20448 KB Output is correct
11 Correct 94 ms 33304 KB Output is correct
12 Correct 23 ms 22128 KB Output is correct
13 Correct 47 ms 19660 KB Output is correct
14 Correct 11 ms 15192 KB Output is correct
15 Correct 10 ms 15328 KB Output is correct
16 Correct 221 ms 45236 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15196 KB Output is correct
2 Correct 7 ms 17616 KB Output is correct
3 Correct 6 ms 15240 KB Output is correct
4 Correct 9 ms 17592 KB Output is correct
5 Correct 7 ms 17592 KB Output is correct
6 Correct 9 ms 15296 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 236 ms 45304 KB Output is correct
10 Correct 17 ms 20448 KB Output is correct
11 Correct 94 ms 33304 KB Output is correct
12 Correct 23 ms 22128 KB Output is correct
13 Correct 47 ms 19660 KB Output is correct
14 Correct 11 ms 15192 KB Output is correct
15 Correct 10 ms 15328 KB Output is correct
16 Correct 221 ms 45236 KB Output is correct
17 Correct 11 ms 17616 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 11 ms 17496 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 6 ms 15208 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 478 ms 66372 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 10 ms 17756 KB Output is correct
26 Correct 10 ms 15480 KB Output is correct
27 Correct 9 ms 15584 KB Output is correct
28 Correct 189 ms 37140 KB Output is correct
29 Correct 282 ms 46996 KB Output is correct
30 Correct 360 ms 56664 KB Output is correct
31 Correct 485 ms 66332 KB Output is correct
32 Correct 10 ms 17496 KB Output is correct
33 Correct 8 ms 17500 KB Output is correct
34 Correct 11 ms 17496 KB Output is correct
35 Correct 10 ms 15196 KB Output is correct
36 Correct 9 ms 15312 KB Output is correct
37 Correct 7 ms 17500 KB Output is correct
38 Correct 8 ms 17496 KB Output is correct
39 Correct 7 ms 17500 KB Output is correct
40 Correct 8 ms 17500 KB Output is correct
41 Correct 6 ms 15160 KB Output is correct
42 Correct 8 ms 17500 KB Output is correct
43 Correct 7 ms 15328 KB Output is correct
44 Correct 9 ms 15452 KB Output is correct
45 Correct 194 ms 43312 KB Output is correct
46 Correct 309 ms 55244 KB Output is correct
47 Correct 333 ms 55148 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15196 KB Output is correct
2 Correct 7 ms 17616 KB Output is correct
3 Correct 6 ms 15240 KB Output is correct
4 Correct 9 ms 17592 KB Output is correct
5 Correct 7 ms 17592 KB Output is correct
6 Correct 9 ms 15296 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 236 ms 45304 KB Output is correct
10 Correct 17 ms 20448 KB Output is correct
11 Correct 94 ms 33304 KB Output is correct
12 Correct 23 ms 22128 KB Output is correct
13 Correct 47 ms 19660 KB Output is correct
14 Correct 11 ms 15192 KB Output is correct
15 Correct 10 ms 15328 KB Output is correct
16 Correct 221 ms 45236 KB Output is correct
17 Correct 11 ms 17616 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 11 ms 17496 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 6 ms 15208 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 478 ms 66372 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 10 ms 17756 KB Output is correct
26 Correct 10 ms 15480 KB Output is correct
27 Correct 9 ms 15584 KB Output is correct
28 Correct 189 ms 37140 KB Output is correct
29 Correct 282 ms 46996 KB Output is correct
30 Correct 360 ms 56664 KB Output is correct
31 Correct 485 ms 66332 KB Output is correct
32 Correct 10 ms 17496 KB Output is correct
33 Correct 8 ms 17500 KB Output is correct
34 Correct 11 ms 17496 KB Output is correct
35 Correct 10 ms 15196 KB Output is correct
36 Correct 9 ms 15312 KB Output is correct
37 Correct 7 ms 17500 KB Output is correct
38 Correct 8 ms 17496 KB Output is correct
39 Correct 7 ms 17500 KB Output is correct
40 Correct 8 ms 17500 KB Output is correct
41 Correct 6 ms 15160 KB Output is correct
42 Correct 8 ms 17500 KB Output is correct
43 Correct 7 ms 15328 KB Output is correct
44 Correct 9 ms 15452 KB Output is correct
45 Correct 194 ms 43312 KB Output is correct
46 Correct 309 ms 55244 KB Output is correct
47 Correct 333 ms 55148 KB Output is correct
48 Correct 7 ms 17500 KB Output is correct
49 Correct 12 ms 17620 KB Output is correct
50 Correct 9 ms 17620 KB Output is correct
51 Correct 7 ms 17500 KB Output is correct
52 Correct 10 ms 17556 KB Output is correct
53 Correct 7 ms 17496 KB Output is correct
54 Correct 7 ms 17500 KB Output is correct
55 Runtime error 461 ms 105276 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15196 KB Output is correct
2 Correct 7 ms 17616 KB Output is correct
3 Correct 6 ms 15240 KB Output is correct
4 Correct 9 ms 17592 KB Output is correct
5 Correct 7 ms 17592 KB Output is correct
6 Correct 9 ms 15296 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 236 ms 45304 KB Output is correct
10 Correct 17 ms 20448 KB Output is correct
11 Correct 94 ms 33304 KB Output is correct
12 Correct 23 ms 22128 KB Output is correct
13 Correct 47 ms 19660 KB Output is correct
14 Correct 11 ms 15192 KB Output is correct
15 Correct 10 ms 15328 KB Output is correct
16 Correct 221 ms 45236 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 451 ms 67456 KB Output is correct
21 Correct 433 ms 67100 KB Output is correct
22 Correct 458 ms 67124 KB Output is correct
23 Correct 383 ms 65624 KB Output is correct
24 Correct 195 ms 32532 KB Output is correct
25 Correct 285 ms 34116 KB Output is correct
26 Correct 248 ms 34136 KB Output is correct
27 Correct 513 ms 73384 KB Output is correct
28 Correct 516 ms 73212 KB Output is correct
29 Correct 498 ms 72984 KB Output is correct
30 Correct 504 ms 73496 KB Output is correct
31 Correct 9 ms 17500 KB Output is correct
32 Correct 32 ms 21364 KB Output is correct
33 Correct 79 ms 24388 KB Output is correct
34 Correct 472 ms 67612 KB Output is correct
35 Correct 17 ms 16216 KB Output is correct
36 Correct 60 ms 20032 KB Output is correct
37 Correct 121 ms 24992 KB Output is correct
38 Correct 170 ms 38420 KB Output is correct
39 Correct 244 ms 45620 KB Output is correct
40 Correct 332 ms 54388 KB Output is correct
41 Correct 433 ms 61612 KB Output is correct
42 Correct 503 ms 68924 KB Output is correct
43 Correct 7 ms 17496 KB Output is correct
44 Correct 7 ms 17500 KB Output is correct
45 Correct 10 ms 17500 KB Output is correct
46 Correct 6 ms 15208 KB Output is correct
47 Correct 6 ms 15224 KB Output is correct
48 Correct 7 ms 17632 KB Output is correct
49 Correct 7 ms 17500 KB Output is correct
50 Correct 7 ms 17644 KB Output is correct
51 Correct 7 ms 17500 KB Output is correct
52 Correct 6 ms 15196 KB Output is correct
53 Correct 7 ms 17500 KB Output is correct
54 Correct 7 ms 15340 KB Output is correct
55 Correct 8 ms 15452 KB Output is correct
56 Correct 199 ms 43312 KB Output is correct
57 Correct 315 ms 55244 KB Output is correct
58 Correct 303 ms 55244 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 15196 KB Output is correct
62 Correct 417 ms 73396 KB Output is correct
63 Correct 405 ms 73500 KB Output is correct
64 Correct 402 ms 73244 KB Output is correct
65 Correct 9 ms 15452 KB Output is correct
66 Correct 11 ms 16032 KB Output is correct
67 Correct 200 ms 43396 KB Output is correct
68 Correct 337 ms 56164 KB Output is correct
69 Correct 450 ms 69660 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15196 KB Output is correct
2 Correct 7 ms 17616 KB Output is correct
3 Correct 6 ms 15240 KB Output is correct
4 Correct 9 ms 17592 KB Output is correct
5 Correct 7 ms 17592 KB Output is correct
6 Correct 9 ms 15296 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 236 ms 45304 KB Output is correct
10 Correct 17 ms 20448 KB Output is correct
11 Correct 94 ms 33304 KB Output is correct
12 Correct 23 ms 22128 KB Output is correct
13 Correct 47 ms 19660 KB Output is correct
14 Correct 11 ms 15192 KB Output is correct
15 Correct 10 ms 15328 KB Output is correct
16 Correct 221 ms 45236 KB Output is correct
17 Correct 426 ms 74268 KB Output is correct
18 Correct 414 ms 74412 KB Output is correct
19 Correct 436 ms 67024 KB Output is correct
20 Correct 501 ms 66212 KB Output is correct
21 Correct 439 ms 64280 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 65 ms 25900 KB Output is correct
24 Correct 26 ms 17208 KB Output is correct
25 Correct 88 ms 22428 KB Output is correct
26 Correct 152 ms 27076 KB Output is correct
27 Correct 225 ms 43824 KB Output is correct
28 Correct 288 ms 50540 KB Output is correct
29 Correct 370 ms 57160 KB Output is correct
30 Correct 439 ms 62952 KB Output is correct
31 Correct 500 ms 70564 KB Output is correct
32 Correct 473 ms 69656 KB Output is correct
33 Correct 412 ms 73500 KB Output is correct
34 Correct 10 ms 15708 KB Output is correct
35 Correct 15 ms 16132 KB Output is correct
36 Correct 205 ms 43056 KB Output is correct
37 Correct 325 ms 56400 KB Output is correct
38 Correct 445 ms 68380 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15196 KB Output is correct
2 Correct 7 ms 17616 KB Output is correct
3 Correct 6 ms 15240 KB Output is correct
4 Correct 9 ms 17592 KB Output is correct
5 Correct 7 ms 17592 KB Output is correct
6 Correct 9 ms 15296 KB Output is correct
7 Correct 6 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 236 ms 45304 KB Output is correct
10 Correct 17 ms 20448 KB Output is correct
11 Correct 94 ms 33304 KB Output is correct
12 Correct 23 ms 22128 KB Output is correct
13 Correct 47 ms 19660 KB Output is correct
14 Correct 11 ms 15192 KB Output is correct
15 Correct 10 ms 15328 KB Output is correct
16 Correct 221 ms 45236 KB Output is correct
17 Correct 11 ms 17616 KB Output is correct
18 Correct 7 ms 17500 KB Output is correct
19 Correct 11 ms 17496 KB Output is correct
20 Correct 9 ms 17500 KB Output is correct
21 Correct 6 ms 15208 KB Output is correct
22 Correct 7 ms 17500 KB Output is correct
23 Correct 478 ms 66372 KB Output is correct
24 Correct 7 ms 17496 KB Output is correct
25 Correct 10 ms 17756 KB Output is correct
26 Correct 10 ms 15480 KB Output is correct
27 Correct 9 ms 15584 KB Output is correct
28 Correct 189 ms 37140 KB Output is correct
29 Correct 282 ms 46996 KB Output is correct
30 Correct 360 ms 56664 KB Output is correct
31 Correct 485 ms 66332 KB Output is correct
32 Correct 10 ms 17496 KB Output is correct
33 Correct 8 ms 17500 KB Output is correct
34 Correct 11 ms 17496 KB Output is correct
35 Correct 10 ms 15196 KB Output is correct
36 Correct 9 ms 15312 KB Output is correct
37 Correct 7 ms 17500 KB Output is correct
38 Correct 8 ms 17496 KB Output is correct
39 Correct 7 ms 17500 KB Output is correct
40 Correct 8 ms 17500 KB Output is correct
41 Correct 6 ms 15160 KB Output is correct
42 Correct 8 ms 17500 KB Output is correct
43 Correct 7 ms 15328 KB Output is correct
44 Correct 9 ms 15452 KB Output is correct
45 Correct 194 ms 43312 KB Output is correct
46 Correct 309 ms 55244 KB Output is correct
47 Correct 333 ms 55148 KB Output is correct
48 Correct 7 ms 17500 KB Output is correct
49 Correct 12 ms 17620 KB Output is correct
50 Correct 9 ms 17620 KB Output is correct
51 Correct 7 ms 17500 KB Output is correct
52 Correct 10 ms 17556 KB Output is correct
53 Correct 7 ms 17496 KB Output is correct
54 Correct 7 ms 17500 KB Output is correct
55 Runtime error 461 ms 105276 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -