Submission #1336163

#	Time	Username	Problem	Language	Result	Execution time	Memory
1336163		veham	도로 폐쇄 (APIO21_roads)	C++20	7 / 100	25 ms	4912 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;

vl minimum_closure_costs(int N, vi U, vi V, vi W) {
  vl Ans(N, 0);
  vl dp1(N,0), dp2 = dp1;
  for(int i = 1;i < N;i++) dp1[i] = dp2[i-1] + W[i-1], dp2[i] = min(dp1[i],dp1[i-1]);
  Ans[1] = dp2.back();
  Ans[0] = accumulate(W.begin(),W.end(),0LL);
  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