제출 #677605

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

roads

#include "roads.h"
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>
using namespace std;
using ll = long long;

vector<vector<pair<int, int>>> gp;
vector<vector<vector<ll>>> dp;

void dfs(int u, int p) {
	for (int k = 0; k < gp.size(); ++k) {
		vector<ll> vec;
		for (pair<int, int>& v : gp[u]) {
			if (v.first == p) continue;
			dfs(v.first, u);
			dp[u][0][k] += dp[v.first][k][k];
			vec.push_back(dp[v.first][k - 1][k] + v.second - dp[v.first][k][k]);
		}	
		sort(vec.rbegin(), vec.rend());
		for (int i = 1; i <= k; ++i) {
			dp[u][i][k] = dp[u][i - 1][k];
			if (i - 1 < vec.size()) dp[u][i][k] += max(0ll, vec[i - 1]);
		}
	}
}


vector<ll> minimum_closure_costs(int n, vector<int> U,vector<int> V,vector<int> W) {
	gp = vector<vector<pair<int, int>>>(n);
	dp = vector<vector<vector<ll>>>(n, vector<vector<ll>>(n, vector<ll> (n)));
	ll sm = 0;
	for (int i = 0; i < U.size(); ++i) {
		gp[U[i]].push_back({ V[i], W[i] });
		gp[V[i]].push_back({ U[i], W[i] });
		sm += W[i];
	}
	vector<ll> vec(n);
	vec[0] = sm;
	dfs(0, -1);
	for (int i = 1; i < n; ++i) vec[i] = sm - dp[0][i][i];
	return vec;
}

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

roads.cpp: In function 'void dfs(int, int)':
roads.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int k = 0; k < gp.size(); ++k) {
      |                  ~~^~~~~~~~~~~
roads.cpp:41:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |    if (i - 1 < vec.size()) dp[u][i][k] += max(0ll, vec[i - 1]);
      |        ~~~~~~^~~~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  for (int i = 0; i < U.size(); ++i) {
      |                  ~~^~~~~~~~~~

• 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