제출 #230876

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230876		AmineWeslati	Džumbus (COCI19_dzumbus)	C++14	20 / 110	433 ms	32384 KiB

dzumbus

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0};

const int MXN=1001;
int V,E;
int v[MXN];
vi adj[MXN];
int memo[MXN][1002][2];

int solve(int n, int m, int b, int p){
   //cout << n<< ' '<<m << ' '<< b<< endl;
   if(n==0 && m>=0) return 0;
   if(n==0||m<0) return -INF;

   if(memo[n][m][b]!=-1) return memo[n][m][b];
   int ans=0;
   if(b==1){
      for(auto x: adj[n]) if(x!=p){
         ans=max(ans,max(1+solve(x,m-v[n],1,n), solve(x,m,0,n)));
         break;
      }
   }
   else if(b==0){
      for(auto x: adj[n]) if(x!=p){
         for(auto it:adj[x]) if(it!=n){
            ans=max(ans,max(2+solve(it,m-v[n]-v[x],1,x), solve(x,m,0,n)));
            break;
         }
      }
   }

   return memo[n][m][b]=ans;
}

int32_t main(){
   boost;
   memset(memo,-1,sizeof(memo));
   cin>>V>>E;
   for(int i=1; i<=V; i++) cin>>v[i];
   for(int i=0; i<E; i++){
      int u,v; cin>>u>>v;
      adj[u].pb(v);
      adj[v].pb(u);
   }
   int lf=-1;
   for(int i=1; i<=V; i++) if(adj[i].size()==1){
      if(lf==-1) lf=i;
      else adj[i].pb(0);
   }

   //cout << lf << endl;

   int Q; cin>>Q;
   while(Q--){
      int x; cin>>x;
      cout << solve(lf,x,0,-1) << endl;
      //cout << endl;
   }


   return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30