oj.uz

답안 #895505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895505 2023-12-30T06:45:38 Z Muhammad_Aneeq 분수 공원 (IOI21_parks) C++17
30 / 100
 2210 ms 43684 KB 
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include "parks.h"
using namespace std;
map<pair<int,int>,int>d,vis;
vector<pair<int,int>>z;
queue<pair<int,int>>Q;
int x1=0,y11=0;
void check(int x,int y)
{
	if (d.find({x,y})!=d.end()&&!vis[{x,y}])
	{
		Q.push({x,y});
		vis[{x,y}]=1;
		z.push_back({d[{x1,y11}],d[{x,y}]});
	}
}
vector<pair<int,int>>i={{0,-2},{0,2},{2,0},{-2,0}};
void bfs(int x,int y)
{
	Q.push({x,y});
	vis[{x,y}]=1;
	while (Q.size())
	{
		x,y;
		tie(x,y)=Q.front();
		x1=x,y11=y;
		Q.pop();
		for (int j=0;j<4;j++)
			check(x+i[j].first,y+i[j].second);
	}
}
int construct_roads(vector<int> x, vector<int> y)
{
	int n=x.size();
	for (int i=0;i<n;i++)
		d[{x[i],y[i]}]=i;
	int reqx=1e9+10,reqy=1e9+10;
	for (int i=0;i<n;i++)
	{
		if (x[i]<reqx)
		{
			reqx=x[i];
			reqy=y[i];
		}
		else if (x[i]==reqx&&reqy>y[i])
			reqy=y[i];
	}
	sort(begin(i),end(i));
	do
	{
		vis={};
		z={};
		Q={};
		bfs(reqx,reqy);
		bool w=1;
		for (int i=0;i<n;i++)
		{
			if (!vis[{x[i],y[i]}])
				w=0;
		}
		vis={};
		vector<int>u,v,a,b;
		for (auto i:z)
		{
			u.push_back(i.first);
			v.push_back(i.second);
			pair<int,int>r,q;
			r.first=x[i.first],r.second=y[i.first];
			q.first=x[i.second],q.second=y[i.second];
			if (r.first-q.first==0)
			{
				a.push_back(r.first-1);
				b.push_back((r.second+q.second)/2);
				if (vis[{a.back(),b.back()}])
				{
					a.pop_back();
					a.push_back(r.first+1);
					if (vis[{a.back(),b.back()}])
						w=0;
					vis[{a.back(),b.back()}]=1;
				}
				else
					vis[{a.back(),b.back()}]=1;
			}
			else
			{
				a.push_back((r.first+q.first)/2);
				b.push_back(r.second-1);
				if (vis[{a.back(),b.back()}])
				{
					b.pop_back();
					b.push_back(r.second+1);
					if (vis[{a.back(),b.back()}])
						w=0;
					vis[{a.back(),b.back()}]=1;
				}
				else
					vis[{a.back(),b.back()}]=1;
			}
		}
		if (w==1)
		{
			build(u,v,a,b);
			return 1;
		}
	}
	while(next_permutation(begin(i),end(i)));
	return 0;
}

Compilation message

parks.cpp: In function 'void bfs(int, int)':
parks.cpp:27:3: warning: left operand of comma operator has no effect [-Wunused-value]
   27 |   x,y;
      |   ^
parks.cpp:27:6: warning: right operand of comma operator has no effect [-Wunused-value]
   27 |   x,y;
      |      ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 178 ms 21668 KB Output is correct
10 Correct 13 ms 2528 KB Output is correct
11 Correct 92 ms 11760 KB Output is correct
12 Correct 19 ms 3420 KB Output is correct
13 Correct 713 ms 6892 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 13 ms 712 KB Output is correct
16 Correct 184 ms 21508 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 178 ms 21668 KB Output is correct
10 Correct 13 ms 2528 KB Output is correct
11 Correct 92 ms 11760 KB Output is correct
12 Correct 19 ms 3420 KB Output is correct
13 Correct 713 ms 6892 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 13 ms 712 KB Output is correct
16 Correct 184 ms 21508 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 474 ms 42920 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 31 ms 864 KB Output is correct
27 Correct 25 ms 860 KB Output is correct
28 Correct 159 ms 17172 KB Output is correct
29 Correct 245 ms 25528 KB Output is correct
30 Correct 360 ms 34268 KB Output is correct
31 Correct 449 ms 43164 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 504 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 20 ms 604 KB Output is correct
44 Correct 20 ms 604 KB Output is correct
45 Correct 178 ms 21496 KB Output is correct
46 Correct 283 ms 31356 KB Output is correct
47 Correct 262 ms 31312 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 178 ms 21668 KB Output is correct
10 Correct 13 ms 2528 KB Output is correct
11 Correct 92 ms 11760 KB Output is correct
12 Correct 19 ms 3420 KB Output is correct
13 Correct 713 ms 6892 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 13 ms 712 KB Output is correct
16 Correct 184 ms 21508 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 474 ms 42920 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 31 ms 864 KB Output is correct
27 Correct 25 ms 860 KB Output is correct
28 Correct 159 ms 17172 KB Output is correct
29 Correct 245 ms 25528 KB Output is correct
30 Correct 360 ms 34268 KB Output is correct
31 Correct 449 ms 43164 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 504 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 20 ms 604 KB Output is correct
44 Correct 20 ms 604 KB Output is correct
45 Correct 178 ms 21496 KB Output is correct
46 Correct 283 ms 31356 KB Output is correct
47 Correct 262 ms 31312 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 450 ms 42748 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 8 ms 1628 KB Output is correct
59 Correct 77 ms 1628 KB Output is correct
60 Correct 204 ms 21428 KB Output is correct
61 Correct 285 ms 29648 KB Output is correct
62 Correct 404 ms 35432 KB Output is correct
63 Correct 470 ms 42908 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 411 ms 42776 KB Output is correct
68 Correct 445 ms 42776 KB Output is correct
69 Correct 463 ms 42684 KB Output is correct
70 Correct 55 ms 860 KB Output is correct
71 Correct 66 ms 1368 KB Output is correct
72 Correct 174 ms 21468 KB Output is correct
73 Correct 309 ms 32176 KB Output is correct
74 Correct 421 ms 42860 KB Output is correct
75 Correct 437 ms 42936 KB Output is correct
76 Correct 441 ms 42936 KB Output is correct
77 Correct 62 ms 1360 KB Output is correct
78 Correct 68 ms 1628 KB Output is correct
79 Correct 204 ms 21504 KB Output is correct
80 Correct 284 ms 32056 KB Output is correct
81 Correct 470 ms 42864 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 178 ms 21668 KB Output is correct
10 Correct 13 ms 2528 KB Output is correct
11 Correct 92 ms 11760 KB Output is correct
12 Correct 19 ms 3420 KB Output is correct
13 Correct 713 ms 6892 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 13 ms 712 KB Output is correct
16 Correct 184 ms 21508 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 443 ms 43684 KB Output is correct
21 Correct 421 ms 43680 KB Output is correct
22 Correct 427 ms 43676 KB Output is correct
23 Correct 338 ms 36456 KB Output is correct
24 Correct 2210 ms 28596 KB Output is correct
25 Correct 1836 ms 28836 KB Output is correct
26 Correct 1837 ms 28816 KB Output is correct
27 Correct 552 ms 42908 KB Output is correct
28 Correct 558 ms 42756 KB Output is correct
29 Correct 627 ms 43064 KB Output is correct
30 Correct 584 ms 42908 KB Output is correct
31 Correct 0 ms 544 KB Output is correct
32 Incorrect 416 ms 2756 KB Solution announced impossible, but it is possible.
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 178 ms 21668 KB Output is correct
10 Correct 13 ms 2528 KB Output is correct
11 Correct 92 ms 11760 KB Output is correct
12 Correct 19 ms 3420 KB Output is correct
13 Correct 713 ms 6892 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 13 ms 712 KB Output is correct
16 Correct 184 ms 21508 KB Output is correct
17 Correct 452 ms 43396 KB Output is correct
18 Correct 442 ms 43420 KB Output is correct
19 Correct 403 ms 43680 KB Output is correct
20 Correct 553 ms 41668 KB Output is correct
21 Correct 538 ms 37416 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 978 ms 5524 KB Solution announced impossible, but it is possible.
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 178 ms 21668 KB Output is correct
10 Correct 13 ms 2528 KB Output is correct
11 Correct 92 ms 11760 KB Output is correct
12 Correct 19 ms 3420 KB Output is correct
13 Correct 713 ms 6892 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 13 ms 712 KB Output is correct
16 Correct 184 ms 21508 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 474 ms 42920 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 31 ms 864 KB Output is correct
27 Correct 25 ms 860 KB Output is correct
28 Correct 159 ms 17172 KB Output is correct
29 Correct 245 ms 25528 KB Output is correct
30 Correct 360 ms 34268 KB Output is correct
31 Correct 449 ms 43164 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 504 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 20 ms 604 KB Output is correct
44 Correct 20 ms 604 KB Output is correct
45 Correct 178 ms 21496 KB Output is correct
46 Correct 283 ms 31356 KB Output is correct
47 Correct 262 ms 31312 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 450 ms 42748 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 8 ms 1628 KB Output is correct
59 Correct 77 ms 1628 KB Output is correct
60 Correct 204 ms 21428 KB Output is correct
61 Correct 285 ms 29648 KB Output is correct
62 Correct 404 ms 35432 KB Output is correct
63 Correct 470 ms 42908 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 411 ms 42776 KB Output is correct
68 Correct 445 ms 42776 KB Output is correct
69 Correct 463 ms 42684 KB Output is correct
70 Correct 55 ms 860 KB Output is correct
71 Correct 66 ms 1368 KB Output is correct
72 Correct 174 ms 21468 KB Output is correct
73 Correct 309 ms 32176 KB Output is correct
74 Correct 421 ms 42860 KB Output is correct
75 Correct 437 ms 42936 KB Output is correct
76 Correct 441 ms 42936 KB Output is correct
77 Correct 62 ms 1360 KB Output is correct
78 Correct 68 ms 1628 KB Output is correct
79 Correct 204 ms 21504 KB Output is correct
80 Correct 284 ms 32056 KB Output is correct
81 Correct 470 ms 42864 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 443 ms 43684 KB Output is correct
86 Correct 421 ms 43680 KB Output is correct
87 Correct 427 ms 43676 KB Output is correct
88 Correct 338 ms 36456 KB Output is correct
89 Correct 2210 ms 28596 KB Output is correct
90 Correct 1836 ms 28836 KB Output is correct
91 Correct 1837 ms 28816 KB Output is correct
92 Correct 552 ms 42908 KB Output is correct
93 Correct 558 ms 42756 KB Output is correct
94 Correct 627 ms 43064 KB Output is correct
95 Correct 584 ms 42908 KB Output is correct
96 Correct 0 ms 544 KB Output is correct
97 Incorrect 416 ms 2756 KB Solution announced impossible, but it is possible.
98 Halted 0 ms 0 KB -