| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1352712 | nathlol2 | 도로 폐쇄 (APIO21_roads) | C++20 | 16 ms | 4144 KiB |
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W){
if(N == 2) return {W[0], 0};
long long sm = 0;
for(int i = 0;i<W.size();i++) sm += W[i];
vector<long long> ans(N), dp(N, 4e18);
dp[0] = 0;
dp[1] = W[0];
for(int i = 2;i<=W.size();i++){
dp[i] = W[i - 1] + min(dp[i - 2], dp[i - 1]);
}
ans[1] = min(dp[N - 1], dp[N - 2]);
ans[0] = sm;
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
