Submission #568812

#	Time	Username	Problem	Language	Result	Execution time	Memory
568812		maomao90	Reconstruction Project (JOI22_reconstruction)	C++17	100 / 100	1259 ms	44516 KiB

reconstruction

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXM = 100005;
const int MAXN = 505;
const int MAXQ = 1000005;

int n, m;
iii edges[MAXM];
int q;
ii qry[MAXQ];
vii vw[MAXN];
int lft[MAXM], rht[MAXM];
ll ans[MAXQ];

vii adj[MAXN];
ii mst[MAXN];
void dfs(int u, int p) {
    for (auto [v, id] : adj[u]) {
        if (v == p) continue;
        auto [_, __, w] = edges[id];
        mst[v] = min(mst[u], ii{w, id});
        dfs(v, u);
    }
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    REP (i, 0, m) {
        int a, b, w; cin >> a >> b >> w;
        edges[i] = {a, b, w};
    }
    cin >> q;
    REP (i, 0, q) {
        cin >> qry[i].FI;
        qry[i].SE = i;
    }
    sort(edges, edges + m, [&] (iii l, iii r) {
            return get<2>(l) < get<2>(r);
            });
    REP (i, 0, m) {
        auto [a, b, w] = edges[i];
        REP (j, 1, n + 1) {
            mst[j] = ii{INF, INF};
        }
        dfs(a, -1);
        adj[a].pb({b, i});
        adj[b].pb({a, i});
        rht[i] = INF;
        if (mst[b] == ii{INF, INF}) {
            lft[i] = 0;
            continue;
        }
        auto [ow, id] = mst[b];
        int mid = ow + w + 1 >> 1;
        rht[id] = mid;
        lft[i] = mid;
        auto [oa, ob, _] = edges[id];
        REP (j, 0, SZ(adj[oa])) {
            if (adj[oa][j].SE == id) {
                if (j + 1 != SZ(adj[oa])) {
                    swap(adj[oa][j], adj[oa][SZ(adj[oa]) - 1]);
                }
                adj[oa].pop_back();
                break;
            }
        }
        REP (j, 0, SZ(adj[ob])) {
            if (adj[ob][j].SE == id) {
                if (j + 1 != SZ(adj[ob])) {
                    swap(adj[ob][j], adj[ob][SZ(adj[ob]) - 1]);
                }
                adj[ob].pop_back();
                break;
            }
        }
    }
    viii ev;
    REP (i, 0, m) {
        auto [a, b, w] = edges[i];
        cerr << i << ": " << lft[i] << ' ' << rht[i] << '\n';
        ev.pb({lft[i], w, 1});
        ev.pb({w + 1, -2 * w, -2});
        ev.pb({rht[i], w, 1});
    }
    sort(ALL(ev));
    int j = 0;
    ll res = 0;
    int minus = 0;
    REP (i, 0, q) {
        auto [x, id] = qry[i];
        while (j < SZ(ev) && get<0>(ev[j]) <= x) {
            auto [a, b, c] = ev[j];
            res += b;
            minus += c;
            j++;
        }
        ans[id] = res - (ll) x * minus;
    }
    REP (i, 0, q) {
        cout << ans[i] << '\n';
    }
    return 0;
}

Compilation message (stderr)

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:90:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |         int mid = ow + w + 1 >> 1;
      |                   ~~~~~~~^~~

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