Submission #568725

#	Time	Username	Problem	Language	Result	Execution time	Memory
568725		joelau	Reconstruction Project (JOI22_reconstruction)	C++14	0 / 100	5017 ms	6928 KiB

reconstruction

#include <bits/stdc++.h>
using namespace std;

long long N,M,Q;
vector<long long> lst[505];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> M;
    for (long long i = 0; i < M; ++i) {
        long long u,v,w; cin >> u >> v >> w; u--, v--;
        lst[u].push_back(w);
    }
    for (long long i = 0; i < N; ++i) sort(lst[i].begin(),lst[i].end());
    cin >> Q;
    while (Q--) {
        long long x; cin >> x;
        long long ans = 0;
        for (long long i = 0; i < N-1; ++i) {
            auto it = lower_bound(lst[i].begin(),lst[i].end(),x);
            long long val = 4e18;
            if (it != lst[i].end()) val = min(val,*it - x);
            if (it != lst[i].begin()) val = min(val,x-*prev(it));
            ans += val;
        }
        cout << ans << '\n';
    }

    return 0;
}

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