제출 #876966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876966		406	Reconstruction Project (JOI22_reconstruction)	C++17	3 / 100	5082 ms	6748 KiB

reconstruction

//#pragma GCC optimize ("O3,unroll-loops")
//#pragma GCC target("avx2,tune=native")
//besmellah
//accept sho :D
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
//#define int long long
using namespace std;
using ar = array<int, 2>;
using ar5 = array<int, 5>;

const int M = 1e5 + 5, N = 505, Q = 1e6 + 5;
const long long INF = 1ll << 30;

namespace dsu {
        int dpr[N];
        void init() {
                memset(dpr, -1, sizeof dpr);
        }
        int gpr(int x) {
                return dpr[x] < 0 ? x : dpr[x] = gpr(dpr[x]);
        }
        bool merge(int u, int v) {
                u = gpr(u), v = gpr(v);
                if (u == v) return false;
                if (dpr[u] < dpr[v]) swap(u, v);
                dpr[v] += dpr[u];
                dpr[u] = v;
                return true;
        }
}
vector<ar> adj[N];
int n, m, W[N], L[M];
ar5 E[M];
bitset<N> seen;
vector<ar5> undo, bk, Es;

void dfsmn(int v, int p) {
        seen[v] = true;
        for (auto [u, w]: adj[v]) if (u != p) {
                W[u] = min(W[v], w);
                dfsmn(u, v);
        }
}
void build() {
        FOR(i, 0, n) adj[i].clear();
        seen = 0;
        for (auto [w, u, v, l, t]: Es) {
                adj[u].push_back({v, w});
                adj[v].push_back({u, w});
        }
}
ar5 validate(vector<ar5> &E) {
        sort(E.begin(), E.end());
        vector<ar5> ok;
        ok.reserve(E.size());
        dsu::init();
        ar5 del = {-1, -1, -1, -1, -1};
        for (auto [w, u, v, l, t]: E) {
                if (dsu::merge(u, v))
                        ok.push_back({w, u, v, l, t});
                else del = {w, u, v, l, t};
        }
        E.swap(ok);
        return del;
}

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n >> m;
        FOR(i, 0, m) {
                cin >> E[i][1] >> E[i][2] >> E[i][0];
                --E[i][1], --E[i][2];
                if (E[i][1] > E[i][2]) swap(E[i][1], E[i][2]);
        }
        sort(E, E + m);

        FOR(i, 0, m) {
                auto [w, u, v, l, t] = E[i];
                build();
                W[u] = INF;
                dfsmn(u, u);
                if (seen[v])
                        E[i][3] = (W[v] + w + 1) / 2;
                else 
                        E[i][3] = -INF;
                Es.push_back(E[i]);
                validate(Es);
        }
        for (int i = m - 1; i >= 0; --i) {
                auto &[w, u, v, l, t] = E[i];
                t = 1;
                bk.push_back({w, u, v, l, 1});
                undo.push_back(validate(bk));
        }
        int q; cin >> q;
        int p = 0, minl = -INF;
        long long td, W, cnt = 0;
        //ar3 dar vaghe ar4-e 
        vector<ar5> fr;
        FOR(i, 0, q) {
                int x; cin >> x;
                bool t = false;
                while (p < m && x >= E[p][0]) {
                        fr.push_back({-E[p][0], E[p][1], E[p][2], E[p][3], 0});
                        auto U = undo.back();
                        undo.pop_back();
                        bk.erase(find(bk.begin(), bk.end(), E[p]));
                        if (U[0] != -1) {
                                bk.insert(lower_bound(bk.begin(), bk.end(), U, [&](const auto &X, const auto &Y) {return X[0] < Y[0];}), U);
                                //bk.push_back(U);
                        }
                        ++p;
                        t = true;
                }
                if (t || x >= minl) { //build_mst() (M bar hadeaksar)
                        assert(++cnt <= 3 * m);
                        validate(fr);
                        dsu::init();
                        W = td = 0;
                        minl = INF;
                        //al = bk + fr (bt)
                        vector<ar5> al; //badihish
                        al.resize(fr.size() + bk.size());
                        for (auto &A: fr) A[0] += x;
                        for (auto &A: bk) A[0] -= x;
                        merge(fr.begin(), fr.end(), bk.begin(), bk.end(), al.begin(), [&](const auto &X, const auto &Y) {return X[0] < Y[0];});
                        for (auto &A: fr) A[0] -= x;
                        for (auto &A: bk) A[0] += x;
                        //sort(al.begin(), al.end());
                        for (auto [w, u, v, l, t]: al) {
                                w = (t ? w + x : x - w);
                                if (dsu::merge(u, v)) {
                                        W += (t ? w : -w);
                                        td += (t ? -1 : +1);
                                }
                                else if (t) {
                                       minl = min(minl, l); 
                                }
                                else {
                                        fr.erase(find(fr.begin(), fr.end(), ar5{-w, u, v, l, 0}));
                                }
                        }
                }
                cout << 1ll * td * x + W << '\n';
        }
        return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:146:40: warning: 'W' may be used uninitialized in this function [-Wmaybe-uninitialized]
  146 |                 cout << 1ll * td * x + W << '\n';
      |                                        ^
reconstruction.cpp:146:34: warning: 'td' may be used uninitialized in this function [-Wmaybe-uninitialized]
  146 |                 cout << 1ll * td * x + W << '\n';
      |                         ~~~~~~~~~^~~

• Subtask 1: 3 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23