oj.uz

답안 #740235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740235 2023-05-12T07:55:09 Z vjudge1 분수 공원 (IOI21_parks) C++17
15 / 100
 729 ms 158732 KB 
#include "parks.h"
#include <bits/stdc++.h>
#define f first
#define s second 
#define ent '\n'
//#define int long long

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

//typedef long double ld;
typedef long long ll;
using namespace std;
 
struct node{double x,y;};
//double len(node a,node b)
//{return sqrt((a.x-b.x)*(a.x-b.y)+(a.y-b.y)*(a.x-b.y));}

struct seg{
	int l,r,id;
};

const string out[2]={"NO\n","YES\n"};
const ll dx[]={-1,-1,1,1};  
const ll dy[]={-1,1,-1,1};
const ll dxx[]={0,0,2,-2};
const ll dyy[]={2,-2,0,0};
const int md=998244353;
const int mod=1e9+7;
const int mx=8e5+12; 
const int tst=1e5;
const bool T=0;

pair<int,pair<int,int>> p[mx];
map<int,bool> used[mx];
map<int,int> pos[mx];
vector<int> g[mx];
int ma[mx];
int mi[mx];

void dfs(int x,int y){
	used[x][y]=1;
	ma[x]=max(ma[x],y);
	mi[x]=min(mi[x],y);
	for(int k=0;k<4;k++){
		int x1=x+dxx[k];
		int y1=y+dyy[k];
		if(!used[x1].count(y1) && pos[x1].count(y1))dfs(x1,y1);
	}
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
	int n=x.size();
	if(n==1){
		build({},{},{},{});
		return 1;
	}
	for(int i=1;i<=n;i++){
		p[i]={x[i-1],{y[i-1],i}};
	}
	sort(p+1,p+n+1);
	int mx=0;
	reverse(x.begin(),x.end());
	reverse(y.begin(),y.end());
	x.push_back(0);
	y.push_back(0);
	reverse(x.begin(),x.end());
	reverse(y.begin(),y.end());
	for(int i=1;i<=n;i++){
		mx=max(mx,x[i]);
		pos[x[i]][y[i]]=i-1;
	}
	for(int i=0;i<=mx;i++)mi[i]=1e9;
	dfs(x[1],y[1]);
	for(int i=1;i<=n;i++){
		if(!used[x[i]][y[i]]){
			return 0;
		}
	}
	vector<int> u,v,a,b;
	if(mx==2){
		for(int i=mi[2];i<ma[2];i+=2){
			u.push_back(pos[2][i]);
			v.push_back(pos[2][i+2]);
			a.push_back(1);
			b.push_back(i+1);
		}
		build(u,v,a,b);
		return 1;
	}
	if(mx==4){
		if(!ma[2]){
			for(int i=mi[4];i<ma[4];i+=2){
				u.push_back(pos[4][i]);
				v.push_back(pos[4][i+2]);
				a.push_back(3);
				b.push_back(i+1);
			}
			build(u,v,a,b);
			return 1;
		}
		for(int i=1;i<=n;i++){
			if(pos[x[i]].count(y[i]+2)){
				u.push_back(i-1);
				v.push_back(pos[x[i]][y[i]+2]);
				if(x[i]==2)a.push_back(1);
				else a.push_back(5);
				b.push_back(y[i]+1);
			}
		}
		for(int i=1;i<=n;i++){
			if(x[i]!=2)continue;
			if(pos[4].count(y[i])){
				u.push_back(i-1);
				v.push_back(pos[4][y[i]]);
				a.push_back(3);
				b.push_back(y[i]-1);
			}
		}
		build(u,v,a,b);
		return 1;
	}
	bool ok=0;
	for(int i=1;i<=n;i++){
		if(pos[x[i]].count(y[i]+2)){
			u.push_back(i-1);
			v.push_back(pos[x[i]][y[i]+2]);
			b.push_back(y[i]+1);
			if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1]=1;
				a.push_back(x[i]+1);
			}
			else if(!used[x[i]-1][y[i]+1]){
				used[x[i]-1][y[i]+1];
				a.push_back(x[i]-1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
		if(pos[x[i]+2].count(y[i])){
			u.push_back(i-1);
			v.push_back(pos[x[i]+2][y[i]]);
			a.push_back(x[i]+1);
			if(!used[x[i]+1][y[i]-1]){
				used[x[i]+1][y[i]-1]=1;
				b.push_back(y[i]-1);
			}
			else if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1]=1;
				b.push_back(y[i]+1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
	}
	if(u.size()>0){
		build(u,v,a,b);
		return 1;
	}
	for(int i=0;i<=mx;i++)used[i].clear();
	for(int i=1;i<=n;i++){
		if(pos[x[i]].count(y[i]+2)){
			u.push_back(i-1);
			v.push_back(pos[x[i]][y[i]+2]);
			b.push_back(y[i]+1);
			if(!used[x[i]-1][y[i]+1]){
				used[x[i]-1][y[i]+1]=1;
				a.push_back(x[i]-1);
			}
			else if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1];
				a.push_back(x[i]+1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
		if(pos[x[i]+2].count(y[i])){
			u.push_back(i-1);
			v.push_back(pos[x[i]+2][y[i]]);
			a.push_back(x[i]+1);
			if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1]=1;
				b.push_back(y[i]+1);
			}
			else if(!used[x[i]+1][y[i]-1]){
				used[x[i]+1][y[i]-1]=1;
				b.push_back(y[i]-1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
	}
	for(int i=0;i<=mx;i++)used[i].clear();
	if(u.size()>0){
		build(u,v,a,b);
		return 1;
	}
	for(int i=1;i<=n;i++){
		if(pos[x[i]].count(y[i]+2)){
			u.push_back(i-1);
			v.push_back(pos[x[i]][y[i]+2]);
			b.push_back(y[i]+1);
			if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1]=1;
				a.push_back(x[i]+1);
			}
			else if(!used[x[i]-1][y[i]+1]){
				used[x[i]-1][y[i]+1];
				a.push_back(x[i]-1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
		if(pos[x[i]+2].count(y[i])){
			u.push_back(i-1);
			v.push_back(pos[x[i]+2][y[i]]);
			a.push_back(x[i]+1);
			if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1]=1;
				b.push_back(y[i]+1);
			}
			else if(!used[x[i]+1][y[i]-1]){
				used[x[i]+1][y[i]-1]=1;
				b.push_back(y[i]-1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
	}
	for(int i=0;i<=mx;i++)used[i].clear();
	if(u.size()>0){
		build(u,v,a,b);
		return 1;
	}
	for(int i=1;i<=n;i++){
		if(pos[x[i]].count(y[i]+2)){
			u.push_back(i-1);
			v.push_back(pos[x[i]][y[i]+2]);
			b.push_back(y[i]+1);
			if(!used[x[i]-1][y[i]+1]){
				used[x[i]-1][y[i]+1]=1;
				a.push_back(x[i]-1);
			}
			else if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1];
				a.push_back(x[i]+1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
		if(pos[x[i]+2].count(y[i])){
			u.push_back(i-1);
			v.push_back(pos[x[i]+2][y[i]]);
			a.push_back(x[i]+1);
			if(!used[x[i]+1][y[i]-1]){
				used[x[i]+1][y[i]-1]=1;
				b.push_back(y[i]-1);
			}
			else if(!used[x[i]+1][y[i]+1]){
				used[x[i]+1][y[i]+1]=1;
				b.push_back(y[i]+1);
			}
			else{
				u.clear();
				v.clear();
				a.clear();
				b.clear();
				break;
			}
		}
	}
	for(int i=0;i<=mx;i++)used[i].clear();
	if(u.size()>0){
		build(u,v,a,b);
		return 1;
	}
	return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:123:7: warning: unused variable 'ok' [-Wunused-variable]
  123 |  bool ok=0;
      |       ^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94156 KB Output is correct
2 Correct 47 ms 94256 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 48 ms 94212 KB Output is correct
5 Correct 46 ms 94156 KB Output is correct
6 Correct 46 ms 94192 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 46 ms 94148 KB Output is correct
9 Correct 247 ms 120020 KB Output is correct
10 Correct 73 ms 97016 KB Output is correct
11 Correct 119 ms 108452 KB Output is correct
12 Correct 61 ms 98500 KB Output is correct
13 Correct 78 ms 101688 KB Output is correct
14 Correct 47 ms 94264 KB Output is correct
15 Correct 54 ms 94420 KB Output is correct
16 Correct 240 ms 116216 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94156 KB Output is correct
2 Correct 47 ms 94256 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 48 ms 94212 KB Output is correct
5 Correct 46 ms 94156 KB Output is correct
6 Correct 46 ms 94192 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 46 ms 94148 KB Output is correct
9 Correct 247 ms 120020 KB Output is correct
10 Correct 73 ms 97016 KB Output is correct
11 Correct 119 ms 108452 KB Output is correct
12 Correct 61 ms 98500 KB Output is correct
13 Correct 78 ms 101688 KB Output is correct
14 Correct 47 ms 94264 KB Output is correct
15 Correct 54 ms 94420 KB Output is correct
16 Correct 240 ms 116216 KB Output is correct
17 Correct 54 ms 94228 KB Output is correct
18 Correct 47 ms 94168 KB Output is correct
19 Correct 49 ms 94220 KB Output is correct
20 Correct 47 ms 94184 KB Output is correct
21 Correct 47 ms 94208 KB Output is correct
22 Correct 54 ms 94128 KB Output is correct
23 Correct 641 ms 151656 KB Output is correct
24 Correct 50 ms 94176 KB Output is correct
25 Correct 50 ms 94528 KB Output is correct
26 Correct 47 ms 94616 KB Output is correct
27 Correct 48 ms 94616 KB Output is correct
28 Correct 237 ms 117376 KB Output is correct
29 Correct 350 ms 128684 KB Output is correct
30 Correct 483 ms 140192 KB Output is correct
31 Correct 682 ms 151552 KB Output is correct
32 Correct 49 ms 94312 KB Output is correct
33 Correct 51 ms 94156 KB Output is correct
34 Correct 49 ms 94164 KB Output is correct
35 Correct 46 ms 94240 KB Output is correct
36 Correct 45 ms 94152 KB Output is correct
37 Correct 48 ms 94180 KB Output is correct
38 Correct 51 ms 94156 KB Output is correct
39 Correct 45 ms 94164 KB Output is correct
40 Correct 46 ms 94156 KB Output is correct
41 Correct 45 ms 94168 KB Output is correct
42 Correct 44 ms 94204 KB Output is correct
43 Correct 45 ms 94400 KB Output is correct
44 Correct 47 ms 94432 KB Output is correct
45 Correct 246 ms 117232 KB Output is correct
46 Correct 419 ms 128692 KB Output is correct
47 Correct 374 ms 128060 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94156 KB Output is correct
2 Correct 47 ms 94256 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 48 ms 94212 KB Output is correct
5 Correct 46 ms 94156 KB Output is correct
6 Correct 46 ms 94192 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 46 ms 94148 KB Output is correct
9 Correct 247 ms 120020 KB Output is correct
10 Correct 73 ms 97016 KB Output is correct
11 Correct 119 ms 108452 KB Output is correct
12 Correct 61 ms 98500 KB Output is correct
13 Correct 78 ms 101688 KB Output is correct
14 Correct 47 ms 94264 KB Output is correct
15 Correct 54 ms 94420 KB Output is correct
16 Correct 240 ms 116216 KB Output is correct
17 Correct 54 ms 94228 KB Output is correct
18 Correct 47 ms 94168 KB Output is correct
19 Correct 49 ms 94220 KB Output is correct
20 Correct 47 ms 94184 KB Output is correct
21 Correct 47 ms 94208 KB Output is correct
22 Correct 54 ms 94128 KB Output is correct
23 Correct 641 ms 151656 KB Output is correct
24 Correct 50 ms 94176 KB Output is correct
25 Correct 50 ms 94528 KB Output is correct
26 Correct 47 ms 94616 KB Output is correct
27 Correct 48 ms 94616 KB Output is correct
28 Correct 237 ms 117376 KB Output is correct
29 Correct 350 ms 128684 KB Output is correct
30 Correct 483 ms 140192 KB Output is correct
31 Correct 682 ms 151552 KB Output is correct
32 Correct 49 ms 94312 KB Output is correct
33 Correct 51 ms 94156 KB Output is correct
34 Correct 49 ms 94164 KB Output is correct
35 Correct 46 ms 94240 KB Output is correct
36 Correct 45 ms 94152 KB Output is correct
37 Correct 48 ms 94180 KB Output is correct
38 Correct 51 ms 94156 KB Output is correct
39 Correct 45 ms 94164 KB Output is correct
40 Correct 46 ms 94156 KB Output is correct
41 Correct 45 ms 94168 KB Output is correct
42 Correct 44 ms 94204 KB Output is correct
43 Correct 45 ms 94400 KB Output is correct
44 Correct 47 ms 94432 KB Output is correct
45 Correct 246 ms 117232 KB Output is correct
46 Correct 419 ms 128692 KB Output is correct
47 Correct 374 ms 128060 KB Output is correct
48 Correct 46 ms 94156 KB Output is correct
49 Correct 59 ms 94132 KB Output is correct
50 Correct 58 ms 94128 KB Output is correct
51 Incorrect 48 ms 94216 KB Solution announced impossible, but it is possible.
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94156 KB Output is correct
2 Correct 47 ms 94256 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 48 ms 94212 KB Output is correct
5 Correct 46 ms 94156 KB Output is correct
6 Correct 46 ms 94192 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 46 ms 94148 KB Output is correct
9 Correct 247 ms 120020 KB Output is correct
10 Correct 73 ms 97016 KB Output is correct
11 Correct 119 ms 108452 KB Output is correct
12 Correct 61 ms 98500 KB Output is correct
13 Correct 78 ms 101688 KB Output is correct
14 Correct 47 ms 94264 KB Output is correct
15 Correct 54 ms 94420 KB Output is correct
16 Correct 240 ms 116216 KB Output is correct
17 Correct 47 ms 94932 KB Output is correct
18 Correct 45 ms 94944 KB Output is correct
19 Correct 46 ms 95004 KB Output is correct
20 Correct 359 ms 158732 KB Output is correct
21 Correct 439 ms 140828 KB Output is correct
22 Correct 362 ms 152004 KB Output is correct
23 Correct 431 ms 142916 KB Output is correct
24 Correct 169 ms 109096 KB Output is correct
25 Correct 174 ms 109140 KB Output is correct
26 Correct 168 ms 109088 KB Output is correct
27 Correct 550 ms 138048 KB Output is correct
28 Correct 567 ms 127496 KB Output is correct
29 Correct 704 ms 124368 KB Output is correct
30 Correct 654 ms 139732 KB Output is correct
31 Correct 47 ms 94924 KB Output is correct
32 Incorrect 64 ms 97464 KB Solution announced impossible, but it is possible.
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94156 KB Output is correct
2 Correct 47 ms 94256 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 48 ms 94212 KB Output is correct
5 Correct 46 ms 94156 KB Output is correct
6 Correct 46 ms 94192 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 46 ms 94148 KB Output is correct
9 Correct 247 ms 120020 KB Output is correct
10 Correct 73 ms 97016 KB Output is correct
11 Correct 119 ms 108452 KB Output is correct
12 Correct 61 ms 98500 KB Output is correct
13 Correct 78 ms 101688 KB Output is correct
14 Correct 47 ms 94264 KB Output is correct
15 Correct 54 ms 94420 KB Output is correct
16 Correct 240 ms 116216 KB Output is correct
17 Correct 552 ms 157940 KB Output is correct
18 Incorrect 729 ms 143436 KB Tree @(50003, 50003) appears more than once: for edges on positions 183490 and 183491
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 94156 KB Output is correct
2 Correct 47 ms 94256 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 48 ms 94212 KB Output is correct
5 Correct 46 ms 94156 KB Output is correct
6 Correct 46 ms 94192 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 46 ms 94148 KB Output is correct
9 Correct 247 ms 120020 KB Output is correct
10 Correct 73 ms 97016 KB Output is correct
11 Correct 119 ms 108452 KB Output is correct
12 Correct 61 ms 98500 KB Output is correct
13 Correct 78 ms 101688 KB Output is correct
14 Correct 47 ms 94264 KB Output is correct
15 Correct 54 ms 94420 KB Output is correct
16 Correct 240 ms 116216 KB Output is correct
17 Correct 54 ms 94228 KB Output is correct
18 Correct 47 ms 94168 KB Output is correct
19 Correct 49 ms 94220 KB Output is correct
20 Correct 47 ms 94184 KB Output is correct
21 Correct 47 ms 94208 KB Output is correct
22 Correct 54 ms 94128 KB Output is correct
23 Correct 641 ms 151656 KB Output is correct
24 Correct 50 ms 94176 KB Output is correct
25 Correct 50 ms 94528 KB Output is correct
26 Correct 47 ms 94616 KB Output is correct
27 Correct 48 ms 94616 KB Output is correct
28 Correct 237 ms 117376 KB Output is correct
29 Correct 350 ms 128684 KB Output is correct
30 Correct 483 ms 140192 KB Output is correct
31 Correct 682 ms 151552 KB Output is correct
32 Correct 49 ms 94312 KB Output is correct
33 Correct 51 ms 94156 KB Output is correct
34 Correct 49 ms 94164 KB Output is correct
35 Correct 46 ms 94240 KB Output is correct
36 Correct 45 ms 94152 KB Output is correct
37 Correct 48 ms 94180 KB Output is correct
38 Correct 51 ms 94156 KB Output is correct
39 Correct 45 ms 94164 KB Output is correct
40 Correct 46 ms 94156 KB Output is correct
41 Correct 45 ms 94168 KB Output is correct
42 Correct 44 ms 94204 KB Output is correct
43 Correct 45 ms 94400 KB Output is correct
44 Correct 47 ms 94432 KB Output is correct
45 Correct 246 ms 117232 KB Output is correct
46 Correct 419 ms 128692 KB Output is correct
47 Correct 374 ms 128060 KB Output is correct
48 Correct 46 ms 94156 KB Output is correct
49 Correct 59 ms 94132 KB Output is correct
50 Correct 58 ms 94128 KB Output is correct
51 Incorrect 48 ms 94216 KB Solution announced impossible, but it is possible.
52 Halted 0 ms 0 KB -