oj.uz

답안 #404787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404787 2021-05-15T02:27:34 Z jjang36524 원 고르기 (APIO18_circle_selection) C++14
49 / 100
 3000 ms 260996 KB 
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
unordered_map<int, vector<int>>x;
vector<pair<int, int>>po;
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.push_back({ a,b });
	}
	sort(so.begin(), so.end());
	int gr = 30;
	for (i = 0; i < N; i++)
	{
		x[po[i].first / (1LL << gr)*(1LL<<31)+ po[i].second / (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].first / (1LL << gr) * (1LL << 31) + po[i].second / (1LL << gr)].push_back(i);
			}
		}
		int xx = po[so[i].second].first / (1LL << gr);
		int y = po[so[i].second].second / (1LL << gr);
		int j, k;
		for (j = xx - 2; j <= xx + 2; j++)
		{
			for (k = y - 2; k <= y + 2; k++)
			{
				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].first - po[le].first) * (po[so[i].second].first - po[le].first) + (po[so[i].second].second - po[le].second) * (po[so[i].second].second - po[le].second) <= (-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:57: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]
   57 |     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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 3 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 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 6 ms 844 KB Output is correct
21 Correct 7 ms 1100 KB Output is correct
22 Correct 37 ms 4100 KB Output is correct
23 Correct 38 ms 4348 KB Output is correct
24 Correct 40 ms 3852 KB Output is correct
25 Correct 46 ms 4000 KB Output is correct
26 Correct 37 ms 4236 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 28000 KB Output is correct
2 Correct 256 ms 27800 KB Output is correct
3 Correct 223 ms 27228 KB Output is correct
4 Correct 239 ms 27172 KB Output is correct
5 Correct 1116 ms 40476 KB Output is correct
6 Correct 2874 ms 62572 KB Output is correct
7 Correct 1647 ms 46604 KB Output is correct
8 Correct 1877 ms 47588 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2071 ms 72336 KB Output is correct
3 Execution timed out 3038 ms 186632 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3040 ms 260996 KB Time limit exceeded
2 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 3 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 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 6 ms 844 KB Output is correct
21 Correct 7 ms 1100 KB Output is correct
22 Correct 37 ms 4100 KB Output is correct
23 Correct 38 ms 4348 KB Output is correct
24 Correct 40 ms 3852 KB Output is correct
25 Correct 46 ms 4000 KB Output is correct
26 Correct 37 ms 4236 KB Output is correct
27 Correct 17 ms 1920 KB Output is correct
28 Correct 8 ms 1380 KB Output is correct
29 Correct 8 ms 1352 KB Output is correct
30 Correct 91 ms 8612 KB Output is correct
31 Correct 85 ms 8588 KB Output is correct
32 Correct 83 ms 7436 KB Output is correct
33 Correct 70 ms 10492 KB Output is correct
34 Correct 80 ms 10520 KB Output is correct
35 Correct 361 ms 17772 KB Output is correct
36 Correct 1853 ms 76576 KB Output is correct
37 Correct 1957 ms 70328 KB Output is correct
38 Correct 1937 ms 77636 KB Output is correct
39 Correct 675 ms 27004 KB Output is correct
40 Correct 659 ms 27092 KB Output is correct
41 Correct 626 ms 27056 KB Output is correct
42 Correct 300 ms 12772 KB Output is correct
43 Correct 1126 ms 136232 KB Output is correct
44 Correct 1281 ms 136520 KB Output is correct
45 Correct 1162 ms 136392 KB Output is correct
46 Correct 1181 ms 136400 KB Output is correct
47 Correct 1093 ms 136528 KB Output is correct
48 Correct 1135 ms 136528 KB Output is correct
49 Correct 1083 ms 136532 KB Output is correct
50 Correct 1112 ms 136420 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 3 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 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 6 ms 844 KB Output is correct
21 Correct 7 ms 1100 KB Output is correct
22 Correct 37 ms 4100 KB Output is correct
23 Correct 38 ms 4348 KB Output is correct
24 Correct 40 ms 3852 KB Output is correct
25 Correct 46 ms 4000 KB Output is correct
26 Correct 37 ms 4236 KB Output is correct
27 Correct 230 ms 28000 KB Output is correct
28 Correct 256 ms 27800 KB Output is correct
29 Correct 223 ms 27228 KB Output is correct
30 Correct 239 ms 27172 KB Output is correct
31 Correct 1116 ms 40476 KB Output is correct
32 Correct 2874 ms 62572 KB Output is correct
33 Correct 1647 ms 46604 KB Output is correct
34 Correct 1877 ms 47588 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 2071 ms 72336 KB Output is correct
37 Execution timed out 3038 ms 186632 KB Time limit exceeded
38 Halted 0 ms 0 KB -