제출 #877015

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

reconstruction

#pragma GCC optimize ("O3,unroll-loops")
#pragma GCC target("avx2")
//besmellah
//accept sho :D
//de akhe mashti NM * DSU nabayad AC she?
//oon moghe NM log bood hichi
//alan vali NM DSU ee
//man ozrkhahi mikonam az tarah
//che bug sangini zadim
//:(
#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 ar4 = array<int, 4>;

const int M = 1e5 + 5, N = 505, Q = 1e6 + 5;
const long long INF = 1e9 + 2;

inline 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;
        }
}
inline bool cmp(const ar4 &X, const ar4 &Y) {
        return X[0] < Y[0];
}
vector<ar> adj[N];
int n, m, WD[N];
bitset<N> seen;
short pr[N], T, st[N], fn[N];
ar4 E[M];
vector<ar4> undo, bk, Es, to_calc;

void dfs(int v, int p) {
        seen[v] = true;
        st[v] = T++;
        pr[v] = p;
        for (auto [u, w]: adj[v]) if (u != p) {
                WD[u] = w;
                dfs(u, v);
        }
        fn[v] = T++;
}
inline bool isa(int u, int p) {
        return st[p] <= st[u] && fn[u] <= fn[p];
}
        
ar4 validate(vector<ar4> &E) {
        vector<ar4> ok;
        ok.reserve(E.size());
        dsu::init();
        ar4 del = {-1, -1, -1, -1};
        for (auto A: E) {
                auto [w, u, v, t] = A;
                if (dsu::merge(u, v))
                        ok.push_back(A);
                else del = A;
        }
        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 (int i = m - 1; i >= 0; --i) {
                auto &[w, u, v, t] = E[i];
                t = 1;
                bk.insert(lower_bound(bk.begin(), bk.end(), E[i], cmp), E[i]);
                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<ar4> fr;
        FOR(i, 0, q) {
                int x; cin >> x;
                bool t = false;
                while (p < m && x >= E[p][0]) {
                        ar4 X = {-E[p][0], E[p][1], E[p][2], 0};
                        fr.insert(lower_bound(fr.begin(), fr.end(), X, cmp), X);
                        auto U = undo.back();
                        undo.pop_back();
                        bk.erase(find_if(bk.begin(), bk.end(), [&](const auto &X) {
                                        return X[0] == E[p][0] && X[1] == E[p][1] && X[2] == E[p][2];
                        }));
                        if (U[0] != -1)
                                bk.insert(lower_bound(bk.begin(), bk.end(), U, cmp), U);
                        ++p;
                        t = true;
                }
                if (t || x >= minl) { //build_mst() (M bar hadeaksar)
                        assert(++cnt <= 5 * m);
                        validate(fr);
                        dsu::init();
                        W = td = 0;
                        minl = INF;
                        //al = bk + fr (bt)
                        vector<ar4> 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(), cmp);
                        for (auto &A: fr) A[0] -= x;
                        for (auto &A: bk) A[0] += x;
                        //sort(al.begin(), al.end());
                        for (auto A: al) {
                                auto &[w, u, v, t] = A;
                                w = (t ? w + x : x - w);
                                if (dsu::merge(u, v)) {
                                        W += (t ? w : -w);
                                        td += (t ? -1 : +1);
                                        adj[u].push_back({v, w});
                                        adj[v].push_back({u, w});
                                }
                                else if (t) {
                                       to_calc.push_back(A);
                                }
                                else {
                                        A[0] *= -1;
                                        fr.erase(find(fr.begin(), fr.end(), A));
                                }
                        }
                        seen = 0;
                        T = 0;
                        FOR(i, 0, n) if (!seen[i]) {
                                WD[i] = INF;
                                dfs(i, i);
                        }
                        for (auto A: to_calc) {
                                auto [w, u, v, t] = A;
                                int W = INF, tu = u, tv = v;
                                if (isa(v, u)) swap(u, v);
                                while (!isa(v, u)) {
                                        W = min(WD[u], W);
                                        u = pr[u];
                                }
                                while (tu != u) {
                                        int t = pr[tu];
                                        pr[tu] = u;
                                        tu = t;
                                }
                                while (v != u && isa(v, u)) {
                                        W = min(WD[v], W);
                                        v = pr[v];
                                }
                                while (tv != v) {
                                        int t = pr[tv];
                                        pr[tv] = v;
                                        tv = t;
                                }
                                minl = min(W + w >> 1, minl);
                        }
                        to_calc.clear();
                        FOR(i, 0, n) adj[i].clear();
                }
                cout << 1ll * td * x + W << '\n';
        }
        return 0;
}

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

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:174:46: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  174 |                                 minl = min(W + w >> 1, minl);
      |                                            ~~^~~
reconstruction.cpp:179:40: warning: 'W' may be used uninitialized in this function [-Wmaybe-uninitialized]
  179 |                 cout << 1ll * td * x + W << '\n';
      |                                        ^
reconstruction.cpp:179:34: warning: 'td' may be used uninitialized in this function [-Wmaybe-uninitialized]
  179 |                 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