제출 #1194993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1194993		Younis_Dwai	Road Closures (APIO21_roads)	C++20	0 / 100	20 ms	4540 KiB

roads

#include "roads.h"
#define F first
#define S second
#define ll long long
#define in insert
#define pb push_back

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
ll dp[N];
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W){
  int n=N;
  vector<ll> ret;
  ll sum=0;
  for(auto u : W) sum+=u;
  ret.pb(sum);
  dp[0]=W[0];dp[1]=W[1];
  ll mx=0;
  for(int i=2;i<N-1;i++){
        dp[i]=W[i]+dp[i-2];
        if(i-3>=0) dp[i]=max(dp[i],W[i]+dp[i-3]);
  }
  for(int i=0;i<N-1;i++) mx=max(mx,dp[i]);
  //for(int i=0;i<N-1;i++) cout<<" # "<<i<<' '<<dp[i]<<endl;
  for(int i=1;i<n-1;i++){
      if(i==1) ret.pb(sum-mx);
      else ret.pb(0);
  }
  return ret;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22