제출 #304140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304140		Fischer	꿈 (IOI13_dreaming)	C++14	0 / 100	57 ms	12536 KiB

dreaming

#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;

const int maxn = 1e5 + 10;
vector<pair<int, int>> g[maxn];
pair<int, int> len[maxn];
bool vis[maxn];
int arr[maxn];
int k = 0;

void add(int x, int t) {
	if (t >= len[x].first) {
		len[x].second = len[x].first;
		len[x].first = t;
	} else {
		len[x].second = max(len[x].second, t);
	}
}

void dfs(int x, int p) {
	vis[x] = 1;
	len[x] = {0, 0};
	for (auto e : g[x]) {
		if (e.first == p) continue;
		dfs(e.first, x);
		add(x, len[e.first].first+e.second);
	}
}

int dfs_reroot(int x, int p, int r) {
	if (~p) {
		if (len[p].first == len[x].first+r) {
			add(x, len[p].second+r);
		} else {
			add(x, len[p].first+r);
		}
	}
	int ans = len[x].first;
	for (auto e : g[x]) {
		if (e.first == p) continue;
		ans = max(ans, dfs_reroot(e.first, x, e.second));
	}
	return ans;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	for (int i=0; i<N; ++i) g[i].clear(), vis[i] = 0;
	for (int i=0; i<M; ++i) {
		g[A[i]].emplace_back(B[i], T[i]);
		g[B[i]].emplace_back(A[i], T[i]);
	}
	for (int i=0; i<N; ++i) {
		if (vis[i]) continue;
		dfs(i, -1);
		arr[k++] = dfs_reroot(i, -1, 0);
	}
	int ans = 0;
	for (int i = 0; i < N; ++i) ans = max(ans, len[i].first + len[i].second);
	sort(arr, arr+k);
	if (k >= 2) ans = max(ans, arr[0] + arr[1] + L);
	if (k >= 3) ans = max(ans, arr[1] + arr[2] + 2 * L);
	return ans;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 0 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23