oj.uz

Submission #542557

# Submission time Handle Problem Language Result Execution time Memory
542557 2022-03-26T22:57:52 Z Olympia Drzava (COCI15_drzava) C++17
64 / 160
 87 ms 65536 KB 
#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;
int64_t lst = 0;
class DisjointSetUnion {
protected:
    vector<int> parent;
    int k;
    vector<vector<bool>> pos;
    int n;
    int connectedComponents;
public:
    int getConnectedComponents() const {
        return connectedComponents;
    }

public:
    vector<bool> merge (vector<bool> a1, vector<bool> a2) {
        vector<bool> a(a1.size());
        a.resize(a1.size(), 0);
        for (int i = 0; i < a1.size(); i++) {
            if (!a1[i]) continue;
            for (int j = 0; j < a2.size(); j++) {
                if (!a2[j]) continue;
                a[(i + j) % k] = true;
                if ((i + j) % k == 0 && !(i == 0 && j == 0)) {
                    cout << fixed << setprecision(3) << sqrt(lst) << '\n';
                    exit(0);
                }
            }
        }
        return a;
    }
    DisjointSetUnion(vector<int> arr, int sz, int K) {
        n = sz;
        parent.resize(sz);
        for (int i = 0; i < n; i++) {
            parent[i] = i;
        }
        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;
        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);
    int N, K;
    cin >> N >> K;
    vector<pair<pair<int,int>,int>> vec(N);
    vector<int> 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<int64_t,pair<int,int>>> edges;
    for (int i = 0; i < N; i++) {
        for (int j = max(i - 30, 0); j <= min(i + 30, N - 1); j++) {
            edges.push_back({dist(vec[i], vec[j]), {vec[i].second, vec[j].second}});
        }
    }
    for (int i = 0; i < N; i++) {
        swap(vec[i].first.second, vec[i].first.first);
    }
    for (int i = 0; i < N; i++) {
        for (int j = max(i - 30, 0); j <= min(i + 30, N - 1); j++) {
            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);
    }
}

Compilation message

drzava.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("O2")
      | 
drzava.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("unroll-loops")
      | 
drzava.cpp: In member function 'std::vector<bool> DisjointSetUnion::merge(std::vector<bool>, std::vector<bool>)':
drzava.cpp:36:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for (int i = 0; i < a1.size(); i++) {
      |                         ~~^~~~~~~~~~~
drzava.cpp:38:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             for (int j = 0; j < a2.size(); j++) {
      |                             ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 13 ms 2504 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 13 ms 2504 KB Output is correct

Subtask #5
8.0 / 8.0

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

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 12 ms 2504 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 14 ms 2504 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 1484 KB Output is correct

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 72 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 78 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 78 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 79 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 75 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 78 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #15
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 80 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #16
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 75 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #17
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 86 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #18
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 79 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #19
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 87 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #20
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 78 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -