Submission #779993

#	Time	Username	Problem	Language	Result	Execution time	Memory
779993		eltu0815	Reconstruction Project (JOI22_reconstruction)	C++14	3 / 100	206 ms	25268 KiB

reconstruction

#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define inf (1987654321)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
int n, m, q;
int parent[505], E[505], invE[505];
int visited[505];
deque<int> graph[505];
vector<pair<ll, pii> > edge;
vector<pair<ll, pll> > coef;
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n >> m;
    edge.push_back({-(int)(1e9), {0, 0}});
    for(int i = 1; i <= m; ++i) {
        int a, b, w; cin >> a >> b >> w;
        edge.push_back({w, {a, b}});
    }
    sort(edge.begin(), edge.end());
    
    auto getParent = [&](auto&& self, int node) -> int {
        if(parent[node] == node) return node;
        return parent[node] = self(self, parent[node]);
    };
    
    auto unionParent = [&](int u, int v) -> void {
        u = getParent(getParent, u);
        v = getParent(getParent, v);
        if(u < v) swap(u, v);
        parent[v] = u;
    };
    
    for(int i = 1; i <= m; ++i) {
        int a = edge[i].second.first, b = edge[i].second.second;
        int p = i - 1;
        for(int j = 1; j <= n; ++j) parent[j] = j;
        while(p) {
            unionParent(edge[p].second.first, edge[p].second.second);
            if(getParent(getParent, a) == getParent(getParent, b)) break;
            --p;
        }
        E[i] = p + 1;
    }
    
    for(int i = 1; i <= m; ++i) invE[i] = m;
    for(int i = 1; i <= m; ++i) invE[E[i] - 1] = i - 1;
    
    for(int i = 1; i <= m; ++i) {
        coef.push_back({edge[i].first, {2, -2 * edge[i].first}});
        coef.push_back({(edge[i].first + edge[E[i] - 1].first)/2 + 1, {-1, edge[i].first}});
        if(invE[i] != m) coef.push_back({(edge[i].first + edge[invE[i] + 1].first)/2 + 1, {-1, edge[i].first}});
    }
    sort(coef.begin(), coef.end());
    
    cin >> q;
    int i = 0; ll a = 0, b = 0;
    while(q--) {
        ll x; cin >> x;
        while(i < (int)coef.size() && coef[i].first <= x) {
            a += 1ll * coef[i].second.first;
            b += 1ll * coef[i].second.second;
            ++i;
        }
        cout << a * x + b << '\n';
    }
    return 0;
}

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