oj.uz

Submission #740219

# Submission time Handle Problem Language Result Execution time Memory
740219 2023-05-12T07:26:36 Z vjudge1 Fountain Parks (IOI21_parks) C++17
15 / 100
 661 ms 153220 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();
	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;
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94152 KB Output is correct
2 Correct 50 ms 94168 KB Output is correct
3 Correct 50 ms 94156 KB Output is correct
4 Correct 51 ms 94284 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 50 ms 94176 KB Output is correct
7 Correct 49 ms 94156 KB Output is correct
8 Correct 43 ms 94180 KB Output is correct
9 Correct 218 ms 120052 KB Output is correct
10 Correct 55 ms 97088 KB Output is correct
11 Correct 114 ms 108428 KB Output is correct
12 Correct 62 ms 98436 KB Output is correct
13 Correct 76 ms 101704 KB Output is correct
14 Correct 53 ms 94292 KB Output is correct
15 Correct 45 ms 94412 KB Output is correct
16 Correct 228 ms 116236 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94152 KB Output is correct
2 Correct 50 ms 94168 KB Output is correct
3 Correct 50 ms 94156 KB Output is correct
4 Correct 51 ms 94284 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 50 ms 94176 KB Output is correct
7 Correct 49 ms 94156 KB Output is correct
8 Correct 43 ms 94180 KB Output is correct
9 Correct 218 ms 120052 KB Output is correct
10 Correct 55 ms 97088 KB Output is correct
11 Correct 114 ms 108428 KB Output is correct
12 Correct 62 ms 98436 KB Output is correct
13 Correct 76 ms 101704 KB Output is correct
14 Correct 53 ms 94292 KB Output is correct
15 Correct 45 ms 94412 KB Output is correct
16 Correct 228 ms 116236 KB Output is correct
17 Correct 47 ms 94180 KB Output is correct
18 Correct 44 ms 94220 KB Output is correct
19 Correct 45 ms 94208 KB Output is correct
20 Correct 45 ms 94136 KB Output is correct
21 Correct 55 ms 94180 KB Output is correct
22 Correct 47 ms 94152 KB Output is correct
23 Correct 588 ms 153112 KB Output is correct
24 Correct 44 ms 94168 KB Output is correct
25 Correct 45 ms 94584 KB Output is correct
26 Correct 48 ms 94576 KB Output is correct
27 Correct 45 ms 94668 KB Output is correct
28 Correct 223 ms 117908 KB Output is correct
29 Correct 322 ms 129704 KB Output is correct
30 Correct 477 ms 141580 KB Output is correct
31 Correct 661 ms 153220 KB Output is correct
32 Correct 43 ms 94188 KB Output is correct
33 Correct 42 ms 94204 KB Output is correct
34 Correct 43 ms 94236 KB Output is correct
35 Correct 45 ms 94240 KB Output is correct
36 Correct 42 ms 94180 KB Output is correct
37 Correct 42 ms 94152 KB Output is correct
38 Correct 43 ms 94148 KB Output is correct
39 Correct 45 ms 94156 KB Output is correct
40 Correct 41 ms 94188 KB Output is correct
41 Correct 45 ms 94240 KB Output is correct
42 Correct 44 ms 94156 KB Output is correct
43 Correct 50 ms 94520 KB Output is correct
44 Correct 51 ms 94520 KB Output is correct
45 Correct 266 ms 118000 KB Output is correct
46 Correct 424 ms 129864 KB Output is correct
47 Correct 426 ms 129264 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94152 KB Output is correct
2 Correct 50 ms 94168 KB Output is correct
3 Correct 50 ms 94156 KB Output is correct
4 Correct 51 ms 94284 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 50 ms 94176 KB Output is correct
7 Correct 49 ms 94156 KB Output is correct
8 Correct 43 ms 94180 KB Output is correct
9 Correct 218 ms 120052 KB Output is correct
10 Correct 55 ms 97088 KB Output is correct
11 Correct 114 ms 108428 KB Output is correct
12 Correct 62 ms 98436 KB Output is correct
13 Correct 76 ms 101704 KB Output is correct
14 Correct 53 ms 94292 KB Output is correct
15 Correct 45 ms 94412 KB Output is correct
16 Correct 228 ms 116236 KB Output is correct
17 Correct 47 ms 94180 KB Output is correct
18 Correct 44 ms 94220 KB Output is correct
19 Correct 45 ms 94208 KB Output is correct
20 Correct 45 ms 94136 KB Output is correct
21 Correct 55 ms 94180 KB Output is correct
22 Correct 47 ms 94152 KB Output is correct
23 Correct 588 ms 153112 KB Output is correct
24 Correct 44 ms 94168 KB Output is correct
25 Correct 45 ms 94584 KB Output is correct
26 Correct 48 ms 94576 KB Output is correct
27 Correct 45 ms 94668 KB Output is correct
28 Correct 223 ms 117908 KB Output is correct
29 Correct 322 ms 129704 KB Output is correct
30 Correct 477 ms 141580 KB Output is correct
31 Correct 661 ms 153220 KB Output is correct
32 Correct 43 ms 94188 KB Output is correct
33 Correct 42 ms 94204 KB Output is correct
34 Correct 43 ms 94236 KB Output is correct
35 Correct 45 ms 94240 KB Output is correct
36 Correct 42 ms 94180 KB Output is correct
37 Correct 42 ms 94152 KB Output is correct
38 Correct 43 ms 94148 KB Output is correct
39 Correct 45 ms 94156 KB Output is correct
40 Correct 41 ms 94188 KB Output is correct
41 Correct 45 ms 94240 KB Output is correct
42 Correct 44 ms 94156 KB Output is correct
43 Correct 50 ms 94520 KB Output is correct
44 Correct 51 ms 94520 KB Output is correct
45 Correct 266 ms 118000 KB Output is correct
46 Correct 424 ms 129864 KB Output is correct
47 Correct 426 ms 129264 KB Output is correct
48 Incorrect 53 ms 94232 KB Solution announced impossible, but it is possible.
49 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94152 KB Output is correct
2 Correct 50 ms 94168 KB Output is correct
3 Correct 50 ms 94156 KB Output is correct
4 Correct 51 ms 94284 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 50 ms 94176 KB Output is correct
7 Correct 49 ms 94156 KB Output is correct
8 Correct 43 ms 94180 KB Output is correct
9 Correct 218 ms 120052 KB Output is correct
10 Correct 55 ms 97088 KB Output is correct
11 Correct 114 ms 108428 KB Output is correct
12 Correct 62 ms 98436 KB Output is correct
13 Correct 76 ms 101704 KB Output is correct
14 Correct 53 ms 94292 KB Output is correct
15 Correct 45 ms 94412 KB Output is correct
16 Correct 228 ms 116236 KB Output is correct
17 Incorrect 56 ms 94932 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94152 KB Output is correct
2 Correct 50 ms 94168 KB Output is correct
3 Correct 50 ms 94156 KB Output is correct
4 Correct 51 ms 94284 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 50 ms 94176 KB Output is correct
7 Correct 49 ms 94156 KB Output is correct
8 Correct 43 ms 94180 KB Output is correct
9 Correct 218 ms 120052 KB Output is correct
10 Correct 55 ms 97088 KB Output is correct
11 Correct 114 ms 108428 KB Output is correct
12 Correct 62 ms 98436 KB Output is correct
13 Correct 76 ms 101704 KB Output is correct
14 Correct 53 ms 94292 KB Output is correct
15 Correct 45 ms 94412 KB Output is correct
16 Correct 228 ms 116236 KB Output is correct
17 Incorrect 326 ms 138092 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94152 KB Output is correct
2 Correct 50 ms 94168 KB Output is correct
3 Correct 50 ms 94156 KB Output is correct
4 Correct 51 ms 94284 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 50 ms 94176 KB Output is correct
7 Correct 49 ms 94156 KB Output is correct
8 Correct 43 ms 94180 KB Output is correct
9 Correct 218 ms 120052 KB Output is correct
10 Correct 55 ms 97088 KB Output is correct
11 Correct 114 ms 108428 KB Output is correct
12 Correct 62 ms 98436 KB Output is correct
13 Correct 76 ms 101704 KB Output is correct
14 Correct 53 ms 94292 KB Output is correct
15 Correct 45 ms 94412 KB Output is correct
16 Correct 228 ms 116236 KB Output is correct
17 Correct 47 ms 94180 KB Output is correct
18 Correct 44 ms 94220 KB Output is correct
19 Correct 45 ms 94208 KB Output is correct
20 Correct 45 ms 94136 KB Output is correct
21 Correct 55 ms 94180 KB Output is correct
22 Correct 47 ms 94152 KB Output is correct
23 Correct 588 ms 153112 KB Output is correct
24 Correct 44 ms 94168 KB Output is correct
25 Correct 45 ms 94584 KB Output is correct
26 Correct 48 ms 94576 KB Output is correct
27 Correct 45 ms 94668 KB Output is correct
28 Correct 223 ms 117908 KB Output is correct
29 Correct 322 ms 129704 KB Output is correct
30 Correct 477 ms 141580 KB Output is correct
31 Correct 661 ms 153220 KB Output is correct
32 Correct 43 ms 94188 KB Output is correct
33 Correct 42 ms 94204 KB Output is correct
34 Correct 43 ms 94236 KB Output is correct
35 Correct 45 ms 94240 KB Output is correct
36 Correct 42 ms 94180 KB Output is correct
37 Correct 42 ms 94152 KB Output is correct
38 Correct 43 ms 94148 KB Output is correct
39 Correct 45 ms 94156 KB Output is correct
40 Correct 41 ms 94188 KB Output is correct
41 Correct 45 ms 94240 KB Output is correct
42 Correct 44 ms 94156 KB Output is correct
43 Correct 50 ms 94520 KB Output is correct
44 Correct 51 ms 94520 KB Output is correct
45 Correct 266 ms 118000 KB Output is correct
46 Correct 424 ms 129864 KB Output is correct
47 Correct 426 ms 129264 KB Output is correct
48 Incorrect 53 ms 94232 KB Solution announced impossible, but it is possible.
49 Halted 0 ms 0 KB -