提出 #66607237

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

/*
*/

struct DSU {
    int n, components;
    vector<int> parent, size;

    // Initialize DSU with n elements (1-indexed or 0-indexed as needed)
    DSU(int _n) : n(_n), components(_n), parent(n+1), size(n+1, 1) {
        iota(parent.begin(), parent.end(), 0);
    }

    // Find with path compression
    int find(int x) {
        if (parent[x] != x)
            parent[x] = find(parent[x]);
        return parent[x];
    }

    // Union by size; returns true if merged, false if already in same set
    bool unite(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return false;
        // Ensure the larger set remains root
        if (size[a] < size[b])
            swap(a, b);
        parent[b] = a;
        size[a] += size[b];
        components--;
        return true;
    }

    // Check if two elements are in the same set
    bool same(int a, int b) {
        return find(a) == find(b);
    }

    // Get size of the set containing x
    int get_size(int x) {
        return size[find(x)];
    }
};

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    DSU dsu(n + q + 1);
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> s;
    vector<pair<int, int>> in(n);
    vector<map<int, vector<int>>> has(n + q + 1);
    for(int i = 0; i < n; i++) {
        cin >> in[i].first >> in[i].second;
    }
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            int dis = abs(in[i].first - in[j].first) + abs(in[i].second - in[j].second);
            s.push({dis, i, j});
            has[i][dis].push_back(j);
        }
    }
    int c = 0;
    while(q--) {
        c++;
        int t;
        cin >> t;
        if(t == 1) {
            int a, b;
            cin >> a >> b;
            in.push_back({a, b});
            for(int i = 0; i < n; i++) {
                int dis = abs(in[i].first - a) + abs(in[i].second - b);
                s.push({dis, i, n});
                has[i][dis].push_back(n);
            }
            n++;
        } else if(t == 2) {
            int extra = has.size() - n;
            if(dsu.components - extra == 1) {
                cout << -1 << '\n';
                continue;
            }
            int opt;
            while(s.size()) {
                auto [d, u, v] = s.top();
                int pu = dsu.find(u), pv = dsu.find(v);
                s.pop();
                if(pu != pv) {
                    dsu.unite(u, v);
                    opt = d;
                    break;
                }
            }
            while(s.size() && s.top()[0] == opt) {
                auto [d, u, v] = s.top();
                s.pop();
                dsu.unite(u, v);
            }
            cout << opt << '\n';
        } else {
            int u, v;
            cin >> u >> v;
            u--, v--;
            int pu = dsu.find(u), pv = dsu.find(v);
            cout << (pu == pv ? "Yes" : "No") << '\n';
        }
    }
}

提出情報

コンパイルエラー

In file included from /usr/include/c++/12/istream:39,
                 from /usr/include/c++/12/sstream:38,
                 from /usr/include/c++/12/complex:45,
                 from /usr/include/c++/12/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/12/bits/stdc++.h:54,
                 from Main.cpp:1:
In member function ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’,
    inlined from ‘int main()’ at Main.cpp:107:21:
/usr/include/c++/12/ostream:202:25: warning: ‘opt’ may be used uninitialized [-Wmaybe-uninitialized]
  202 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:91:17: note: ‘opt’ was declared here
   91 |             int opt;
      |                 ^~~

ジャッジ結果