Submission #1215805

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215805		loom	도로 폐쇄 (APIO21_roads)	C++20	7 / 100	24 ms	3400 KiB

roads

#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 5e18
#define nl '\n'

vector<ll> minimum_closure_costs(int n, vector<int> a, vector<int> b, vector<int> w){
   vector<ll> ans(n);
   ans[0] = accumulate(w.begin(), w.end(), 0ll);
   for(ll i=2; i<n; i++) ans[i] = 0;

   ll dp[2];
   dp[0] = 0;
   dp[1] = w[0];

   for(ll i=1; i<n-1; i++){
      ll x = dp[0];
      dp[0] = max(dp[0], dp[1]);
      dp[1] = x + w[i];
   }

   ans[1] = ans[0] - max(dp[0], dp[1]);
   return ans;
}

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