| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1336163 | veham | 도로 폐쇄 (APIO21_roads) | C++20 | 25 ms | 4912 KiB |
#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;
}| # | 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... | ||||
