#include<bits/stdc++.h> using namespace std; #define foru(i,a,b) for(int i=(a); i<=(b); ++i) #define ford(i,a,b) for(int i=(a); i>=(b); --i) #define rep(i,a) for(int i=0; i<(a); ++i) #define sz(a) (int)(a).size() #define all(a) (a).begin(),(a).end() #define bit(s,i) (((s)>>(i))&1) #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define fi first #define se second #define ll long long #define int long long #define eb emplace_back #define pb push_back #define __builtin_popcount __builtin_popcountll #define _ << " " << template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;} template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;} const int N=505; const int M=100001; int n,m,q; pair<ii,int> ed[M]; int par[N]; int find(int x){ return par[x]==0 ? x : par[x]=find(par[x]); } bool unite(int x, int y){ x=find(x);y=find(y); if(x!=y){ par[y]=x; return true; } return false; } int l[3*M],r[3*M]; pair<int,ii> cg[3*M]; void solve(){ cin>>n>>m; foru(i,1,m){ cin>>ed[i].fi.fi>>ed[i].fi.se>>ed[i].se; } sort(ed+1,ed+1+m,[](auto i, auto j){return i.se<j.se;}); memset(l,-0x3f,sizeof(l)); memset(r,0x3f,sizeof(r)); foru(i,1,m){ fill(par+1,par+1+n,0); ford(j,i-1,1){ unite(ed[j].fi.fi,ed[j].fi.se); if(find(ed[i].fi.fi)==find(ed[i].fi.se)){ l[i]=(ed[j].se+ed[i].se)/2+1; r[j]=(ed[j].se+ed[i].se)/2; break; } } } int sz=0; foru(i,1,m){ cg[++sz]={l[i],{-1,ed[i].se}}; cg[++sz]={ed[i].se,{2,-2*ed[i].se}}; cg[++sz]={r[i]+1,{-1,ed[i].se}}; } sort(cg+1,cg+1+sz); int j=1, s1=0, s2=0; cin>>q; foru(i,1,q){ int x; cin>>x; while(j<=sz && cg[j].fi<=x){ s1+=cg[j].se.fi; s2+=cg[j].se.se; ++j; } // cout<<s1 _ s2<<'\n'; cout<<1LL*s1*x+s2<<'\n'; } } int32_t main(){ #define task "test" if(fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } cin.tie(0)->sync_with_stdio(0); int tc=1; //cin>>tc; foru(i,1,tc){ solve(); } }

reconstruction.cpp: In function 'int32_t main()':
reconstruction.cpp:95:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
reconstruction.cpp:96:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~