#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vvi g;
ll dp[3][1005][1005];
ll n,m;
vi sz;
vi v;
vb used;
void dfs(int i,int p){
used[i]=true;
sz[i]=1;
for(ll x:g[i])if(x!=p){
dfs(x,i);sz[i]+=sz[x];
}
vvi sdp(3,vi(2,inf));
sdp[0][0]=0;
sdp[1][1]=v[i];
for(ll x:g[i])if(x!=p){
vvi ndp(3,vi(sdp[0].size()+sz[x],inf));
// out(ndp[0].size());
rep(j,3)rep(k,sdp[0].size())ndp[j][k]=sdp[j][k];
rep(j,3)rep(k,sdp[j].size())rep(sj,3)rep(sk,sz[x]+1){
if(j){
ll nj=min(2ll,j+sj);
chmin(ndp[nj][k+sk],sdp[j][k]+dp[sj][x][sk]);
}
else if(sj!=1)chmin(ndp[j][k+sk],sdp[j][k]+dp[sj][x][sk]);
}
sdp=ndp;
}
rep(j,3)rep(k,sdp[0].size())dp[j][i][k]=sdp[j][k];
}
int main(){
cin>>n>>m;
g=vvi(n);
sz=vi(n);
v=vi(n);
rep(i,n)cin>>v[i];
rep(i,m){
ll a,b;cin>>a>>b;a--;b--;
g[a].pb(b);
g[b].pb(a);
}
rep(i,3)rep(j,1005)rep(k,1005)dp[i][j][k]=inf;
used=vb(n,false);
vi res(1);
rep(i,n){
if(used[i])continue;
dfs(i,-1);
vi nres(res.size()+sz[i],inf);
rep(j,res.size())nres[j]=res[j];
rep(j,res.size())rep(k,sz[i]+1){
chmin(nres[j+k],res[j]+dp[0][i][k]);
chmin(nres[j+k],res[j]+dp[2][i][k]);
}
res=nres;
}
// outv(sz);
// out(dp[2][0][3]);
// rep(j,n)rep(i,3)rep(k,n+1)if(dp[i][j][k]!=inf)cout<<i<<' '<<j<<' '<<k<<' '<<dp[i][j][k]<<endl;
// outv(res);
res[1]=0;
ll q;cin>>q;
rep(i,q){
ll a;cin>>a;
ll ans=ub(res,a)-1;
if(ans!=1)out(ans);
else out(0);
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
24440 KB |
Output is correct |
| 2 |
Incorrect |
35 ms |
24320 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
24440 KB |
Output is correct |
| 2 |
Incorrect |
35 ms |
24320 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
516 ms |
25264 KB |
Output is correct |
| 2 |
Incorrect |
480 ms |
24952 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
24440 KB |
Output is correct |
| 2 |
Incorrect |
35 ms |
24320 KB |
Output isn't correct |
