oj.uz

Submission #978432

# Submission time Handle Problem Language Result Execution time Memory
978432 2024-05-09T08:18:25 Z Halym2007 Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 28336 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
#define ll long long
#define ff first
#define ss second
#define pii pair <int, int>
int n, jog[N];
bool vis[N];
struct coordinate {
	ll x, y, r, idx;
};
coordinate a[N];

bool intersect (coordinate x, coordinate y) {
	ll a1 = (x.x - y.x) * (x.x - y.x), a2 = (x.y - y.y) * (x.y - y.y), a3 = (x.r + y.r) * (x.r + y.r);
	return (a1 + a2 <= a3);
}

//void cykar (coordinate x) {
//	cout << x.x << " " << x.y << " " << x.r << " " << x.idx << "\n";
//}


bool cmp (coordinate x, coordinate y) {
	if (x.r > y.r) return 1;
	else if (x.r == y.r and x.idx < y.idx) return 1;
	return 0;
}


int main () {
//	freopen ("input1.txt", "r", stdin);
	cin >> n;
	bool sub = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].x >> a[i].y >> a[i].r;
		a[i].idx = i;
		if (a[i].y != 0) sub = 1;
	}
	sort (a + 1, a + n + 1, cmp);
	if (sub) {
		for (int i = 1; i <= n; ++i) {
			if (vis[i]) continue;
			jog[a[i].idx] = a[i].idx;	
			for (int j = i + 1; j <= n; ++j) {
				if (vis[j]) continue;
				if (intersect (a[i], a[j])) {
					jog[a[j].idx] = a[i].idx;
					vis[j] = 1;
				}
			}
		}
	}
	else {
		assert (1 == 0);
		set <int> s;
		map <int, int> val;
		for (int i = 1; i <= n; ++i) {
			int l = a[i].x - a[i].r, r = a[i].x + a[i].r;
			if (i == 1) {
				s.insert (l);
				s.insert (r);
				val[l] = a[i].idx;
				val[r] = a[i].idx;
				
				jog[a[i].idx] = a[i].idx;
			}
			else {
				auto tr = s.lower_bound (l);
				if (tr != s.end()) {
					int x = *tr;
					if (x <= r) {
						jog[a[i].idx] = val[x];
						continue;
					}
					else if (tr != s.begin()) {
						tr--;
						int y = *tr;
						if (y <= l and r <= x) {
							jog[a[i].idx] = val[x];
							continue;
						}
					}
				}
				s.insert (l);
				s.insert (r);
				val[l] = a[i].idx;
				val[r] = a[i].idx;
				jog[a[i].idx] = a[i].idx;
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		cout << jog[i] << " ";
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 1 ms 444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 708 KB Output is correct
20 Correct 5 ms 780 KB Output is correct
21 Correct 6 ms 604 KB Output is correct
22 Correct 22 ms 892 KB Output is correct
23 Correct 24 ms 604 KB Output is correct
24 Correct 22 ms 600 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 22 ms 740 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 254 ms 28336 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Execution timed out 3055 ms 8028 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3047 ms 18516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory 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 1 ms 444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 708 KB Output is correct
20 Correct 5 ms 780 KB Output is correct
21 Correct 6 ms 604 KB Output is correct
22 Correct 22 ms 892 KB Output is correct
23 Correct 24 ms 604 KB Output is correct
24 Correct 22 ms 600 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 22 ms 740 KB Output is correct
27 Correct 11 ms 2908 KB Output is correct
28 Correct 10 ms 3160 KB Output is correct
29 Correct 10 ms 2908 KB Output is correct
30 Correct 76 ms 2976 KB Output is correct
31 Correct 78 ms 2972 KB Output is correct
32 Correct 80 ms 2956 KB Output is correct
33 Correct 105 ms 8788 KB Output is correct
34 Correct 104 ms 8640 KB Output is correct
35 Correct 104 ms 8912 KB Output is correct
36 Execution timed out 3035 ms 7776 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 1 ms 444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 708 KB Output is correct
20 Correct 5 ms 780 KB Output is correct
21 Correct 6 ms 604 KB Output is correct
22 Correct 22 ms 892 KB Output is correct
23 Correct 24 ms 604 KB Output is correct
24 Correct 22 ms 600 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 22 ms 740 KB Output is correct
27 Runtime error 254 ms 28336 KB Execution killed with signal 6
28 Halted 0 ms 0 KB -