oj.uz

Submission #252926

# Submission time Handle Problem Language Result Execution time Memory
252926 2020-07-26T13:21:46 Z islingr Drzava (COCI15_drzava) C++14
160 / 160
 297 ms 4600 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = int64_t;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(x, v) for (auto &x : v)
#define lb(x...) lower_bound(x)
#define x first
#define y second

const int N = 1 << 16, K = 1 << 6;
const ll inf = 2e8;

int nxt[N];
int head(int u) { return nxt[u] != u ? nxt[u] = head(nxt[u]) : u; }
void unite(int u, int v) { nxt[head(u)] = head(v); }

using pii = pair<int, int>;
ll norm(const pii &p, const pii &q) {
	return (ll) (p.x - q.x) * (p.x - q.x) + (ll) (p.y - q.y) * (p.y - q.y);
}

pair<pii, short> tmp[N];
pii p(int i) { return tmp[i].x; }

int n; short k;
vector<short> cmp[N];

bool f(ll d) {
	rep(u, 0, n) nxt[u] = u, cmp[u].clear();
	int r = floor(sqrt(d)), l = 0;
	set<pair<int, int>> S;
	rep(i, 0, n) {
		while (p(i).x - p(l).x > r) S.erase({p(l).y, l}), ++l;
		int cnt = 0;
		for (auto it = S.lb({p(i).y - r, -1}); it != end(S) && it->x - r <= p(i).y; ++it) {
			if (norm(p(it->y), p(i)) <= d) {
				unite(it->y, i);
				if (k <= ++cnt) return true;
			}
		}
		S.insert({p(i).y, i});
	}

	rep(u, 0, n) cmp[head(u)].push_back(tmp[u].y);
	rep(z, 0, n) {
		if (cmp[z].empty()) continue;
		if (size_t(k) <= cmp[z].size()) return true;
		ll S = 0;
		trav(v, cmp[z]) {
			S |= (S | 1) << v;
			S |= S >> k;
			S &= (1ll << k) - 1;
			if (S & 1) return true;
		}
	}
	return false;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> k;
	rep(i, 0, n) {
		int x, y, c; cin >> x >> y >> c;
		tmp[i] = {{x, y}, c % k};
	}
	sort(tmp, tmp + n);
	
	ll l = 0, r = inf * inf;
	while (r - l > 1) {
		ll m = l + (r - l + 1) / 2;
		(f(m) ? r : l) = m;
	}

	cout << fixed << setprecision(3) << sqrt(r);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 5 ms 2048 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 5 ms 1920 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 4 ms 1920 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 68 ms 2936 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 297 ms 4544 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 296 ms 4504 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 252 ms 4344 KB Output is correct

Subtask #13
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 266 ms 4600 KB Output is correct

Subtask #14
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 276 ms 4472 KB Output is correct

Subtask #15
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 184 ms 4216 KB Output is correct

Subtask #16
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 223 ms 4476 KB Output is correct

Subtask #17
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 199 ms 4600 KB Output is correct

Subtask #18
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 197 ms 4344 KB Output is correct

Subtask #19
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 212 ms 4344 KB Output is correct

Subtask #20
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 200 ms 4248 KB Output is correct