제출 #980770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980770		c2zi6	Road Closures (APIO21_roads)	C++14	36 / 100	2033 ms	19612 KiB

roads

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "roads.h"

namespace TEST1 {
	bool check(int n, VI U, VI V, VI W) {
		for (int x : U) if (x) return false;
		return true;
	}
	VL solve(int n, VI U, VI V, VI W) {
		sort(all(W));
		VL ans{0};
		for (int x : W) ans.pb(ans.back() + x);
		reverse(all(ans));
		return ans;
	}
};
namespace TEST2 {
	bool check(int n, VI U, VI V, VI W) {
		rep(i, n-1) if (U[i] != i) return false;
		rep(i, n-1) if (V[i] != i+1) return false;
		return true;
	}
	VL solve(int n, VI U, VI V, VI W) {
		n--;
		ll sum = 0;
		for (int x : W) sum += 1ll*x;
		VL dp(n);
		rep(i, n) {
			setmax(dp[i], 1ll*W[i]);
			if (i >= 1) setmax(dp[i], dp[i-1]);
			if (i >= 2) setmax(dp[i], dp[i-2] + W[i]);
		}
		VL ans;
		ans.pb(sum);
		ans.pb(sum - dp[n-1]);
		while (ans.size() <= n) ans.pb(0);
		return ans;
	}
};
namespace TEST3 {
	VL dpa, dpb;
	VVPI gp;
	int k;
	void dfs(int u = 0, int p = -1) {
		for (auto[v, w] : gp[u]) if (v != p) dfs(v, u);
		ll asum = 0;
		VL diff;
		for (auto[v, w] : gp[u]) if (v != p) {
			asum += dpa[v]+w;
			diff.pb(dpb[v] - (dpa[v]+w));
		}
		sort(all(diff));
		dpa[u] = dpb[u] = asum;
		for (int i = 0; i < k && i < diff.size(); i++) if (diff[i] < 0) dpa[u] += diff[i];
		for (int i = 0; i < k-1 && i < diff.size(); i++) if (diff[i] < 0) dpb[u] += diff[i];
	}
	VL solve(int n, VI U, VI V, VI W) {
		gp = VVPI(n);
		rep(i, n-1) {
			int u = U[i];
			int v = V[i];
			int w = W[i];
			gp[u].pb({v, w});
			gp[v].pb({u, w});
		}
		dpa = dpb = VL(n);

		VL ans;
		for (k = 0; k < n; k++) {
			dfs();
			ans.pb(dpa[0]);
		}
		return ans;
	}
};
namespace TEST5 {
	bool check(int n, VI U, VI V, VI W) {
		for (int x : W) if (x != 1) return false;
		return true;
	}
	VVI gp;
	VI deg;
	int k;
	VI par;
	VI vis;
	void dfs(int u, int p = -1) {
		par[u] = p;
		vis[u] = true;
		for (int v : gp[u]) if (v != p) dfs(v, u);
	}
	VL solve(int n, VI U, VI V, VI W) {
		VVI permgp(n);
		rep(i, n-1) {
			int u = U[i];
			int v = V[i];
			permgp[u].pb(v);
			permgp[v].pb(u);
		}
		VI order(n);
		rep(i, n) order[i] = i;
		sort(all(order), [&](int u, int v){return permgp[u].size() < permgp[v].size();});
		VI added;
		gp = VVI(n);
		deg = VI(n);
		vis = VI(n);
		par = VI(n);
		VI degree(n);
		VL ret;
		for (k = n-1; k >= 0; k--) {
			while (order.size() && permgp[order.back()].size() > k) {
				added.pb(order.back());
				order.pop_back();
			}
			for (int u : added) {
				deg[u] = permgp[u].size();
				gp[u] = VI();
				vis[u] = false;
				for (int v : permgp[u]) if (permgp[v].size() > k) gp[u].pb(v);
				degree[u] = gp[u].size();
			}
			for (int u : added) if (!vis[u]) dfs(u);
			queue<int> q;
			int ans = 0;
			for (int u : added) if (gp[u].size() == 1 && par[u] != -1) q.push(u);
			while (q.size()) {
				int u = q.front();
				q.pop();
				if (deg[u] <= k) {
					if (par[u] != -1) {
						if (--degree[par[u]] == 1 && par[par[u]] != -1) {
							q.push(par[u]);
						}
					}
				} else {
					ans += deg[u] - k;
					if (par[u] != -1) {
						deg[par[u]]--;
						if (--degree[par[u]] == 1 && par[par[u]] != -1) {
							q.push(par[u]);
						}
					}
				}
			}
			for (int u : added) if (degree[u] == 0) {
				if (deg[u] > k) ans += deg[u] - k;
			}
			ret.pb(ans);
		}
		reverse(all(ret));
		return ret;
	}
};

VL minimum_closure_costs(int n, VI U, VI V, VI W) {
	if (TEST1::check(n, U, V, W)) return TEST1::solve(n, U, V, W);
	if (TEST2::check(n, U, V, W)) return TEST2::solve(n, U, V, W);
	if (TEST5::check(n, U, V, W)) return TEST5::solve(n, U, V, W);
	return TEST3::solve(n, U, V, W);
}

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

roads.cpp: In function 'VL TEST2::solve(int, VI, VI, VI)':
roads.cpp:66:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   66 |   while (ans.size() <= n) ans.pb(0);
      |          ~~~~~~~~~~~^~~~
roads.cpp: In function 'void TEST3::dfs(int, int)':
roads.cpp:75:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   75 |   for (auto[v, w] : gp[u]) if (v != p) dfs(v, u);
      |            ^
roads.cpp:78:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   78 |   for (auto[v, w] : gp[u]) if (v != p) {
      |            ^
roads.cpp:84:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for (int i = 0; i < k && i < diff.size(); i++) if (diff[i] < 0) dpa[u] += diff[i];
      |                            ~~^~~~~~~~~~~~~
roads.cpp:85:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   for (int i = 0; i < k-1 && i < diff.size(); i++) if (diff[i] < 0) dpb[u] += diff[i];
      |                              ~~^~~~~~~~~~~~~
roads.cpp: In function 'VL TEST5::solve(int, VI, VI, VI)':
roads.cpp:140:55: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  140 |    while (order.size() && permgp[order.back()].size() > k) {
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
roads.cpp:148:50: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  148 |     for (int v : permgp[u]) if (permgp[v].size() > k) gp[u].pb(v);
      |                                 ~~~~~~~~~~~~~~~~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22