oj.uz

Submission #853272

# Submission time Handle Problem Language Result Execution time Memory
853272 2023-09-23T19:53:11 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
0 / 100
 3000 ms 529292 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const int K = 3;

int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
vector<pii> UL[303030];
vector<pii> UR[303030];
vector<int> V[303030];
int ans[303030];

struct DSU {
	int n;
	vector<int> l, r;

	DSU(int _n = 0) : n(_n), l(_n), r(_n) {
		for (int i = 0; i < n; i++) l[i] = r[i] = i;
	}

	int left(int x) {
		x = min(x, n - 1);
		if (x < 0 || x == l[x]) return x;
		return l[x] = left(l[x]);
	}

	int right(int x) {
		x = max(x, 0);
		if (x >= n || x == r[x]) return x;
		return r[x] = right(r[x]);
	}

	void upd(int x) {
		l[x] = x - 1; r[x] = x + 1;
	}
};

bool intersect(int i, int j) {
	int dx = X[i] - X[j], dy = Y[i] - Y[j], r = R[i] + R[j];
	return (long long)dx * dx + (long long)dy * dy <= (long long)r * r;
}

void upd_ans(int cur, int cand) {
	int &t = ans[cur];
	if (R[t] > R[cand] || (R[t] == R[cand] && t < cand)) return;
	if (intersect(cur, cand)) t = cand;
}

struct SegTree {
	struct Node {
		vector<pii> v;
		DSU uf;
	};

	int n, base;
	vector<Node> T;

	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
	}

	void add_line(int p, int q, int y, int i) {
		p += base; q += base;
		p--; q--;
		while (p <= q) {
			if (p & 1) {
				V[i].push_back(T[p].v.size());
				T[p].v.emplace_back(y, i);
				p++;
			}
			if (~q & 1) {
				V[i].push_back(T[q].v.size());
				T[q].v.emplace_back(y, i);
				q--;
			}
			p >>= 1; q >>= 1;
		}
	}

	void add_point(int p, vector<pii> &v) {
		p += base; p--;
		while (p) {
			v.emplace_back(p, T[p].v.size());
			p >>= 1;
		}
	}

	void init() {
		for (int i = 1; i < base + base; i++) T[i].uf = DSU(T[i].v.size());
	}

	void ers_line(int p, int q, int i) {
		p += base; q += base;
		p--; q--;
		int ptr = 0;
		while (p <= q) {
			if (p & 1) {
				T[p].uf.upd(V[i][ptr++]);
				p++;
			}
			if (~q & 1) {
				T[q].uf.upd(V[i][ptr++]);
				q--;
			}
			p >>= 1; q >>= 1;
		}
	}

	void chk(int cur, vector<pii> &v) {
		for (auto &i : v) {
			int p, s; tie(p, s) = i;
			int t = s;
			for (int j = 0; j < K; j++) {
				t = T[p].uf.right(t);
				if (t >= T[p].v.size()) break;
				upd_ans(cur, T[p].v[t].second);
				t++;
			}
			t = s;
			for (int j = 0; j < K; j++) {
				t = T[p].uf.left(t);
				if (t < 0) break;
				upd_ans(cur, T[p].v[t].second);
				t--;
			}
		}
	}
};

int main() {
	scanf("%d", &N);
	vector<int> v;
	for (int i = 1; i <= N; i++) {
		scanf("%d%d%d", &X[i], &Y[i], &R[i]);
		XL[i] = X[i] - R[i];
		XR[i] = X[i] + R[i];
		v.push_back(XL[i]); v.push_back(XR[i]);
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (int i = 1; i <= N; i++) {
		XL[i] = lower_bound(v.begin(), v.end(), XL[i]) - v.begin() + 1;
		XR[i] = lower_bound(v.begin(), v.end(), XR[i]) - v.begin() + 1;
	}

	int M = v.size();
	SegTree seg(M);

	vector<int> ord(N);
	iota(ord.begin(), ord.end(), 1);

	sort(ord.begin(), ord.end(), [&](int a, int b) { return Y[a] < Y[b]; });
	for (int i : ord) {
		seg.add_line(XL[i], XR[i], Y[i], i);
		seg.add_point(XL[i], UL[i]);
		seg.add_point(XR[i], UR[i]);
	}
	seg.init();

	sort(ord.begin(), ord.end(), [&](int a, int b) {
		if (R[a] == R[b]) return a < b;
		return R[a] > R[b];
	});
	for (int i : ord) {
		ans[i] = i;
		seg.chk(i, UL[i]);
		seg.chk(i, UR[i]);
		if (ans[i] != i) seg.ers_line(XL[i], XR[i], i);
	}

	for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
	return 0;
}

Compilation message

circle_selection.cpp: In member function 'void SegTree::chk(int, std::vector<std::pair<int, int> >&)':
circle_selection.cpp:122:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     if (t >= T[p].v.size()) break;
      |         ~~^~~~~~~~~~~~~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:178:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  178 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:178:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  178 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~
circle_selection.cpp:138:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:141:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  141 |   scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 6 ms 26968 KB Output is correct
3 Correct 6 ms 26968 KB Output is correct
4 Correct 5 ms 26968 KB Output is correct
5 Correct 6 ms 26972 KB Output is correct
6 Incorrect 6 ms 26968 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 26968 KB Output is correct
2 Correct 597 ms 154064 KB Output is correct
3 Correct 2194 ms 450540 KB Output is correct
4 Correct 2114 ms 448824 KB Output is correct
5 Correct 2479 ms 454648 KB Output is correct
6 Correct 1114 ms 247216 KB Output is correct
7 Correct 484 ms 138324 KB Output is correct
8 Correct 55 ms 50380 KB Output is correct
9 Correct 2302 ms 452076 KB Output is correct
10 Execution timed out 3072 ms 471668 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1778 ms 444204 KB Output is correct
2 Correct 1147 ms 410028 KB Output is correct
3 Execution timed out 3034 ms 499176 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 6 ms 26968 KB Output is correct
3 Correct 6 ms 26968 KB Output is correct
4 Correct 5 ms 26968 KB Output is correct
5 Correct 6 ms 26972 KB Output is correct
6 Incorrect 6 ms 26968 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26968 KB Output is correct
2 Correct 6 ms 26968 KB Output is correct
3 Correct 6 ms 26968 KB Output is correct
4 Correct 5 ms 26968 KB Output is correct
5 Correct 6 ms 26972 KB Output is correct
6 Incorrect 6 ms 26968 KB Output isn't correct
7 Halted 0 ms 0 KB -