| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 542552 | Olympia | Drzava (COCI15_drzava) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <iomanip>
#include <unordered_map>
#include <cstdlib>
#include <queue>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O2")
#pragma GCC optimization ("unroll-loops")
#include <limits.h>
using namespace std;
int lst = 0;
class DisjointSetUnion {
protected:
vector<int> parent;
vector<int> compSize;
int k;
vector<vector<int>> pos;
int n;
int connectedComponents;
public:
int getConnectedComponents() const {
return connectedComponents;
}
public:
vector<int> merge (vector<int> a1, vector<int> a2) {
vector<int> a(a1.size());
a.resize(a1.size(), 0);
for (int i = 0; i < a1.size(); i++) {
for (int j = 0; j < a2.size(); j++) {
a[(i + j) % k] += a1[i] * a2[j];
}
}
if (a[0] > 1) {
cout << fixed << setprecision(3) << sqrt(lst) << '\n';
exit(0);
}
return a;
}
DisjointSetUnion(vector<int64_t> arr, int sz, int K) {
n = sz;
parent.resize(sz), compSize.resize(sz);
for (int i = 0; i < n; i++) {
parent[i] = i, compSize[i] = 1;
}
this->k = K;
pos.resize(sz);
for (int i = 0; i < sz; i++) {
pos[i].assign(k, false);
pos[i][arr[i] % k] = true;
pos[i][0] = true;
}
}
int find_head(int x) const {
int cur = x;
while (cur != parent[cur]) {
cur = parent[cur];
}
return cur;
}
void join(int x, int y) {
x = find_head(x);
y = find_head(y);
if (x == y) {
return;
}
parent[x] = y;
compSize[y] += compSize[x];
pos[y] = merge(pos[y], pos[x]);
connectedComponents--;
}
bool comp(int x, int y) {
return (find_head(x) == find_head(y));
}
};
int64_t dist (pair<pair<int64_t,int64_t>,int64_t> p1, pair<pair<int64_t,int64_t>,int64_t> p2) {
int64_t d = abs(p1.first.first - p2.first.first) * abs(p1.first.first - p2.first.first);
d += abs(p1.first.second - p2.first.second) * abs(p1.first.second - p2.first.second);
return d;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t N, K;
cin >> N >> K;
vector<pair<pair<int64_t,int64_t>,int64_t>> vec(N);
vector<int64_t> v(N);
for (int i = 0; i < N; i++) {
cin >> vec[i].first.first >> vec[i].first.second;
vec[i].second = i;
cin >> v[i];
v[i] %= K;
}
sort(vec.begin(), vec.end());
DisjointSetUnion dsu(v, N, K);
vector<pair<int,pair<int,int>>> edges;
for (int64_t i = 0; i < N; i++) {
for (int64_t j = max(i - 30, 0ll); j <= min(i + 30, N - 1); j++) {
edges.push_back({dist(vec[i], vec[j]), {vec[i].second, vec[j].second}});
}
}
for (int64_t i = 0; i < N; i++) {
swap(vec[i].first.second, vec[i].first.first);
}
for (int64_t i = 0; i < N; i++) {
for (int64_t j = max(i - 30, 0ll); j <= min(i + 30, N - 1); j++) {
//cout << dist(vec[i], vec[j]) << " " << vec[i].second << " " << vec[j].second << '\n';
edges.push_back({dist(vec[i], vec[j]), {vec[i].second, vec[j].second}});
}
}
sort(edges.begin(), edges.end());
for (auto& p: edges) {
if (dsu.comp(p.second.first, p.second.second)) continue;
lst = p.first;
//cout << dist(vec[p.second.first])
dsu.join(p.second.first, p.second.second);
}
}