제출 #1082747

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082747		blackslex	도로 폐쇄 (APIO21_roads)	C++17	0 / 100	23 ms	5300 KiB

roads

#include "roads.h"
#include <vector>
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int MxN = 25e4 + 5;
ll a[MxN], dp[MxN];

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  int n = N, m = U.size();
  ll res = 0;
  for (int i = 0; i < m; i++) res += W[i], a[i + 1] = W[i];
  vector<ll> ans{res};
  for (int i = 1; i <= m; i++) dp[i] = max(dp[i - 1], (i - 2 >= 0 ? dp[i - 2] + a[i] : 0)); ans.emplace_back(res - dp[m]);
  for (int i = 2; i < n; i++) ans.emplace_back(0);
  return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:16:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   16 |   for (int i = 1; i <= m; i++) dp[i] = max(dp[i - 1], (i - 2 >= 0 ? dp[i - 2] + a[i] : 0)); ans.emplace_back(res - dp[m]);
      |   ^~~
roads.cpp:16:93: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   16 |   for (int i = 1; i <= m; i++) dp[i] = max(dp[i - 1], (i - 2 >= 0 ? dp[i - 2] + a[i] : 0)); ans.emplace_back(res - dp[m]);
      |                                                                                             ^~~

• 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