oj.uz

Submission #773141

# Submission time Handle Problem Language Result Execution time Memory
773141 2023-07-04T15:43:17 Z xetrk Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 35068 KB 
#pragma warning(disable:4996)

#include<bits/stdc++.h>
using namespace std;


typedef long long ll;
typedef long double ld;

int n;

vector<vector<ll>> circle;

vector<pair<ll, int>> sortRadius, sortX, sortY;

int ans[301000];

inline ll GetDist(ll x1, ll y1, ll x2, ll y2)
{
	// 아 좌표값 마이너스도 들어오네
	ll xx = max(x1, x2) - min(x1, x2);
	ll yy = max(y1, y2) - min(y1, y2);
	return (xx * xx) + (yy * yy);
}



bool comp(const pair<ll,int>& a, const pair<ll,int>& b)
{
	if (a.first == b.first)
		return a.second < b.second;
	return a.first < b.first;
}

bool compSort(const pair<ll, int>& a, const pair<ll, int>& b)
{
	if (a.first == b.first)
		return a.second < b.second;
	
	return a.first > b.first;
}

int main()
{
	ll x, y, r, r2;
	scanf("%d", &n);

	for (int i = 0; i < n; i++)
	{
		scanf("%lld %lld %lld", &x, &y, &r);
		//x = 1, y = 1, r = 3;
		circle.push_back({ x,y,r });
		sortRadius.push_back({ r,i });
		sortX.push_back({ x,i });
		sortY.push_back({ y,i });
	}

	sort(sortRadius.begin(), sortRadius.end(), compSort);
	sort(sortX.begin(), sortX.end());
	sort(sortY.begin(), sortY.end());


	int cur, curcmp;
	int xMin, xMax, yMin, yMax;
	ll rr;

	fill(ans, ans + n + 2, -1);

	for (int curDelete = 0; curDelete < n; curDelete++)
	{
		cur = sortRadius[curDelete].second;
		if (ans[cur] != -1)
			continue;


		x = circle[cur][0], y = circle[cur][1], r = circle[cur][2];
		if (curDelete < n - 1)
			r2 = r + sortRadius[curDelete + 1].first + 1;
		else
			r2 = r * 2 + 1;
		
		// a이하를 찾아야하는데 lower bound는  a이상인걸 찾으니까.. 근데 그 이하인걸 찾아야하니 1빼줌
		xMin = lower_bound(sortX.begin(), sortX.end(), pair<ll, int>(x - r2, -1), comp) - sortX.begin();
		xMax = upper_bound(sortX.begin(), sortX.end(), pair<ll, int>(x + r2, 301000), comp) - sortX.begin();

		yMin = lower_bound(sortY.begin(), sortY.end(), pair<ll, int>(y - r2, -1), comp) - sortY.begin();
		yMax = upper_bound(sortY.begin(), sortY.end(), pair<ll, int>(y + r2, 301000), comp) - sortY.begin();

		xMin--;
		yMin--;

		if (xMin < 0) xMin = 0;
		if (yMin < 0) yMin = 0;

		if (xMin >= sortX.size()) xMin = sortX.size() - 1;
		if (yMin >= sortY.size()) yMin = sortY.size() - 1;
		if (xMax >= sortX.size()) xMax = sortX.size() - 1;
		if (yMax >= sortY.size()) yMax = sortY.size() - 1;

		//xMin = 0, yMin = 0, xMax = n - 1, yMax = n - 1;


		ans[cur] = cur;

		if (xMax - xMin < yMax - yMin)
		{

			/*
			for (int i = xMin; i >= 0; i--)
			{
				curcmp = sortX[i].second;
				if (beforeX > circle[curcmp][0])
					break;
				if (ans[curcmp] != -1) continue;
				if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= (ll)(((r + circle[curcmp][2]) * (r + circle[curcmp][2]))))
					ans[curcmp] = cur;

			}*/
			for (int i = xMax; i >= xMin; i--)
			{
				curcmp = sortX[i].second;
				if (ans[curcmp] != -1) continue;
				rr = r + circle[curcmp][2];
				if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
				{
					ans[curcmp] = cur;
					//sortX.erase(sortX.begin() + i);
				}
			}
		}
		else
		{


			//for (int i = yMin; i >= 0; i--)
			//{
			//	curcmp = sortY[i].second;
			//	if (beforeY > circle[curcmp][1])
			//		break;
			//	if (ans[curcmp] != -1) continue;
			//	if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= (ll)(((r + circle[curcmp][2]) * (r + circle[curcmp][2]))))
			//		ans[curcmp] = cur;

			//}


			for (int i = yMax; i >= yMin; i--)
			{
				curcmp = sortY[i].second;
				if (ans[curcmp]!= -1) continue;
				rr = r + circle[curcmp][2];
				if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
				{
					ans[curcmp] = cur;
					//sortY.erase(sortY.begin() + i);
				}
			}
		}
	}

	for (int i = 0; i < n; i++)
		printf("%d ", ans[i]+1);

	return 0;
}

Compilation message

circle_selection.cpp:1: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    1 | #pragma warning(disable:4996)
      | 
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:95:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |   if (xMin >= sortX.size()) xMin = sortX.size() - 1;
      |       ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:96:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |   if (yMin >= sortY.size()) yMin = sortY.size() - 1;
      |       ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:97:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |   if (xMax >= sortX.size()) xMax = sortX.size() - 1;
      |       ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:98:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   if (yMax >= sortY.size()) yMax = sortY.size() - 1;
      |       ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   scanf("%lld %lld %lld", &x, &y, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 4 ms 1152 KB Output is correct
20 Correct 4 ms 1212 KB Output is correct
21 Correct 4 ms 1252 KB Output is correct
22 Correct 6 ms 1140 KB Output is correct
23 Correct 6 ms 1124 KB Output is correct
24 Correct 6 ms 1216 KB Output is correct
25 Correct 5 ms 1216 KB Output is correct
26 Correct 6 ms 1108 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 34092 KB Output is correct
2 Correct 210 ms 35040 KB Output is correct
3 Correct 226 ms 34808 KB Output is correct
4 Correct 194 ms 34980 KB Output is correct
5 Correct 215 ms 34772 KB Output is correct
6 Correct 266 ms 34804 KB Output is correct
7 Correct 234 ms 35068 KB Output is correct
8 Correct 226 ms 34868 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 199 ms 11504 KB Output is correct
3 Correct 935 ms 34912 KB Output is correct
4 Correct 913 ms 34984 KB Output is correct
5 Correct 1160 ms 34084 KB Output is correct
6 Correct 319 ms 18708 KB Output is correct
7 Correct 102 ms 10404 KB Output is correct
8 Correct 16 ms 2764 KB Output is correct
9 Correct 981 ms 34444 KB Output is correct
10 Correct 1629 ms 34520 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 34068 KB Output is correct
2 Correct 523 ms 33944 KB Output is correct
3 Correct 1042 ms 33560 KB Output is correct
4 Correct 507 ms 34460 KB Output is correct
5 Correct 470 ms 34492 KB Output is correct
6 Correct 462 ms 33800 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 4 ms 1152 KB Output is correct
20 Correct 4 ms 1212 KB Output is correct
21 Correct 4 ms 1252 KB Output is correct
22 Correct 6 ms 1140 KB Output is correct
23 Correct 6 ms 1124 KB Output is correct
24 Correct 6 ms 1216 KB Output is correct
25 Correct 5 ms 1216 KB Output is correct
26 Correct 6 ms 1108 KB Output is correct
27 Correct 7 ms 1780 KB Output is correct
28 Correct 7 ms 1800 KB Output is correct
29 Correct 7 ms 1712 KB Output is correct
30 Correct 11 ms 1748 KB Output is correct
31 Correct 13 ms 1780 KB Output is correct
32 Correct 11 ms 1776 KB Output is correct
33 Correct 70 ms 11736 KB Output is correct
34 Correct 73 ms 11620 KB Output is correct
35 Correct 72 ms 11672 KB Output is correct
36 Correct 140 ms 11628 KB Output is correct
37 Correct 139 ms 11660 KB Output is correct
38 Correct 154 ms 11644 KB Output is correct
39 Correct 451 ms 11660 KB Output is correct
40 Correct 440 ms 11656 KB Output is correct
41 Correct 459 ms 11652 KB Output is correct
42 Correct 232 ms 11580 KB Output is correct
43 Correct 111 ms 11676 KB Output is correct
44 Correct 118 ms 11652 KB Output is correct
45 Correct 114 ms 11780 KB Output is correct
46 Correct 115 ms 11704 KB Output is correct
47 Correct 111 ms 11652 KB Output is correct
48 Correct 117 ms 11644 KB Output is correct
49 Correct 121 ms 11648 KB Output is correct
50 Correct 120 ms 11656 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 4 ms 1152 KB Output is correct
20 Correct 4 ms 1212 KB Output is correct
21 Correct 4 ms 1252 KB Output is correct
22 Correct 6 ms 1140 KB Output is correct
23 Correct 6 ms 1124 KB Output is correct
24 Correct 6 ms 1216 KB Output is correct
25 Correct 5 ms 1216 KB Output is correct
26 Correct 6 ms 1108 KB Output is correct
27 Correct 199 ms 34092 KB Output is correct
28 Correct 210 ms 35040 KB Output is correct
29 Correct 226 ms 34808 KB Output is correct
30 Correct 194 ms 34980 KB Output is correct
31 Correct 215 ms 34772 KB Output is correct
32 Correct 266 ms 34804 KB Output is correct
33 Correct 234 ms 35068 KB Output is correct
34 Correct 226 ms 34868 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 199 ms 11504 KB Output is correct
37 Correct 935 ms 34912 KB Output is correct
38 Correct 913 ms 34984 KB Output is correct
39 Correct 1160 ms 34084 KB Output is correct
40 Correct 319 ms 18708 KB Output is correct
41 Correct 102 ms 10404 KB Output is correct
42 Correct 16 ms 2764 KB Output is correct
43 Correct 981 ms 34444 KB Output is correct
44 Correct 1629 ms 34520 KB Output is correct
45 Correct 582 ms 34068 KB Output is correct
46 Correct 523 ms 33944 KB Output is correct
47 Correct 1042 ms 33560 KB Output is correct
48 Correct 507 ms 34460 KB Output is correct
49 Correct 470 ms 34492 KB Output is correct
50 Correct 462 ms 33800 KB Output is correct
51 Correct 7 ms 1780 KB Output is correct
52 Correct 7 ms 1800 KB Output is correct
53 Correct 7 ms 1712 KB Output is correct
54 Correct 11 ms 1748 KB Output is correct
55 Correct 13 ms 1780 KB Output is correct
56 Correct 11 ms 1776 KB Output is correct
57 Correct 70 ms 11736 KB Output is correct
58 Correct 73 ms 11620 KB Output is correct
59 Correct 72 ms 11672 KB Output is correct
60 Correct 140 ms 11628 KB Output is correct
61 Correct 139 ms 11660 KB Output is correct
62 Correct 154 ms 11644 KB Output is correct
63 Correct 451 ms 11660 KB Output is correct
64 Correct 440 ms 11656 KB Output is correct
65 Correct 459 ms 11652 KB Output is correct
66 Correct 232 ms 11580 KB Output is correct
67 Correct 111 ms 11676 KB Output is correct
68 Correct 118 ms 11652 KB Output is correct
69 Correct 114 ms 11780 KB Output is correct
70 Correct 115 ms 11704 KB Output is correct
71 Correct 111 ms 11652 KB Output is correct
72 Correct 117 ms 11644 KB Output is correct
73 Correct 121 ms 11648 KB Output is correct
74 Correct 120 ms 11656 KB Output is correct
75 Correct 266 ms 34352 KB Output is correct
76 Correct 231 ms 34568 KB Output is correct
77 Correct 234 ms 34688 KB Output is correct
78 Correct 229 ms 34240 KB Output is correct
79 Correct 294 ms 34484 KB Output is correct
80 Correct 236 ms 34244 KB Output is correct
81 Correct 780 ms 34560 KB Output is correct
82 Correct 718 ms 34448 KB Output is correct
83 Correct 737 ms 34456 KB Output is correct
84 Correct 1192 ms 34476 KB Output is correct
85 Correct 750 ms 34520 KB Output is correct
86 Correct 708 ms 34488 KB Output is correct
87 Correct 850 ms 34440 KB Output is correct
88 Execution timed out 3040 ms 33304 KB Time limit exceeded
89 Halted 0 ms 0 KB -