oj.uz

답안 #404790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404790 2021-05-15T02:34:57 Z jjang36524 원 고르기 (APIO18_circle_selection) C++14
49 / 100
 3000 ms 42996 KB 
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
unordered_map<int, vector<int>>x;
int po[300100][2];
vector<pair<int, int>>so;
int pre[300100];
int num[300100];
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N;
	cin >> N;
	int i;
	for (i = 0; i < N; i++)
	{
		int a, b, c;
		cin >> a >> b >> c;
		a += 1LL << 30;
		b += 1LL << 30;
		pre[i] = c;
		so.push_back({ -c,i });
		po[i][0]=a;
		po[i][1] = b;
	}
	sort(so.begin(), so.end());
	int gr = 30;
	for (i = 0; i < N; i++)
	{
		x[po[i][0] / (1LL << gr)*(1LL<<31)+ po[i][1] / (1LL << gr)].push_back(i);
	}
	for (i = 0; i < N; i++)
	{
		if (num[so[i].second])
			continue;
		while ((1LL << gr) >= -so[i].first*2)
		{
			gr--;
			x.clear();
			int i;
			for (i = 0; i < N; i++)
			{
				x[po[i][0] / (1LL << gr) * (1LL << 31) + po[i][1] / (1LL << gr)].push_back(i);
			}
		}
		int xx = po[so[i].second][0] / (1LL << gr);
		int y = po[so[i].second][1] / (1LL << gr);
		int j, k;
		for (j = xx - 2; j <= xx + 2; j++)
		{
			for (k = y - 2; k <= y + 2; k++)
			{
				if (!x.count(j * (1LL << 31) + k))
					continue;
				int l;
				for (l = 0; l < x[j*(1LL<<31)+ k].size(); l++)
				{
					int le = x[j * (1LL << 31)+ k][l];
					if (num[le])
						continue;
					if ((po[so[i].second][0] - po[le][0]) * (po[so[i].second][0] - po[le][0]) + (po[so[i].second][1] - po[le][1]) * (po[so[i].second][1] - po[le][1]) <= (-so[i].first + pre[le]) * (-so[i].first + pre[le]))
					{
						num[le] = so[i].second+1;
					}
				}
			}
		}
	}
	for (i = 0; i < N; i++)
	{
		cout << num[i] << ' ';
	}
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:60:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for (l = 0; l < x[j*(1LL<<31)+ k].size(); l++)
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 7 ms 844 KB Output is correct
22 Correct 26 ms 1040 KB Output is correct
23 Correct 27 ms 972 KB Output is correct
24 Correct 27 ms 1044 KB Output is correct
25 Correct 29 ms 1036 KB Output is correct
26 Correct 25 ms 1032 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 21336 KB Output is correct
2 Correct 236 ms 21176 KB Output is correct
3 Correct 214 ms 20580 KB Output is correct
4 Correct 221 ms 20388 KB Output is correct
5 Correct 1060 ms 35408 KB Output is correct
6 Correct 2211 ms 42520 KB Output is correct
7 Correct 1505 ms 41432 KB Output is correct
8 Correct 1689 ms 41944 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1095 ms 14928 KB Output is correct
3 Execution timed out 3064 ms 41012 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2635 ms 42996 KB Output is correct
2 Execution timed out 3074 ms 38396 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 7 ms 844 KB Output is correct
22 Correct 26 ms 1040 KB Output is correct
23 Correct 27 ms 972 KB Output is correct
24 Correct 27 ms 1044 KB Output is correct
25 Correct 29 ms 1036 KB Output is correct
26 Correct 25 ms 1032 KB Output is correct
27 Correct 16 ms 1616 KB Output is correct
28 Correct 9 ms 1072 KB Output is correct
29 Correct 8 ms 1024 KB Output is correct
30 Correct 60 ms 1648 KB Output is correct
31 Correct 53 ms 1704 KB Output is correct
32 Correct 59 ms 1784 KB Output is correct
33 Correct 66 ms 7552 KB Output is correct
34 Correct 68 ms 7440 KB Output is correct
35 Correct 367 ms 14864 KB Output is correct
36 Correct 987 ms 14768 KB Output is correct
37 Correct 1062 ms 14968 KB Output is correct
38 Correct 1008 ms 14936 KB Output is correct
39 Correct 603 ms 14380 KB Output is correct
40 Correct 619 ms 14392 KB Output is correct
41 Correct 609 ms 14332 KB Output is correct
42 Correct 282 ms 11020 KB Output is correct
43 Correct 455 ms 14560 KB Output is correct
44 Correct 457 ms 14580 KB Output is correct
45 Correct 447 ms 14612 KB Output is correct
46 Correct 444 ms 14808 KB Output is correct
47 Correct 447 ms 14672 KB Output is correct
48 Correct 455 ms 14692 KB Output is correct
49 Correct 458 ms 14604 KB Output is correct
50 Correct 472 ms 14580 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 4 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 7 ms 844 KB Output is correct
22 Correct 26 ms 1040 KB Output is correct
23 Correct 27 ms 972 KB Output is correct
24 Correct 27 ms 1044 KB Output is correct
25 Correct 29 ms 1036 KB Output is correct
26 Correct 25 ms 1032 KB Output is correct
27 Correct 223 ms 21336 KB Output is correct
28 Correct 236 ms 21176 KB Output is correct
29 Correct 214 ms 20580 KB Output is correct
30 Correct 221 ms 20388 KB Output is correct
31 Correct 1060 ms 35408 KB Output is correct
32 Correct 2211 ms 42520 KB Output is correct
33 Correct 1505 ms 41432 KB Output is correct
34 Correct 1689 ms 41944 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1095 ms 14928 KB Output is correct
37 Execution timed out 3064 ms 41012 KB Time limit exceeded
38 Halted 0 ms 0 KB -