제출 #531789

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531789		BorisBarca	꿈 (IOI13_dreaming)	C++14	47 / 100	115 ms	32196 KiB

dreaming

/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline int ccw(pii a, pii b, pii c) {
	return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}


inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

#include "dreaming.h"

const int N = 1e5 + 10;

int a[N], b[N], t[N], idx, bst, d, dp[N], rj[N], sb[N];
vpi e[N];
vi comp[N];
bool bio[N];

void diam1(int node, int dad, int l){
	if (l > d){
		bst = node;
		d = l;
	}
	bio[node] = 1;
	comp[idx].PB(node);
	FORA(nxt, e[node]){
		if (!bio[nxt.X] && nxt.X != dad)
			diam1(nxt.X, node, l + nxt.Y);
	}
}

void diam2(int node, int dad, int l){
	if (l > d)
		d = l;
	bio[node] = 1;
	FORA(nxt, e[node]){
		if (!bio[nxt.X] && nxt.X != dad)
			diam2(nxt.X, node, l + nxt.Y);
	}
}

void max_lanac(int node, int dad){
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		max_lanac(nxt.X, node);
		dp[node] = max(dp[node], dp[nxt.X] + nxt.Y);
	}
}

int calc(int node, int dad, int up){
	multiset <int> ms;
	ms.INS(up);
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		ms.INS(dp[nxt.X] + nxt.Y);
	}
	int ret = INF;
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		ms.erase(ms.find(dp[nxt.X] + nxt.Y));
		ret = min(ret, calc(nxt.X, node, *ms.rbegin() + nxt.Y));
		ms.INS(dp[nxt.X] + nxt.Y);
	}
	ms.clear();

	rj[node] = max(dp[node], up);
	ret = min(ret, rj[node]);
	return ret;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]){
	REP(i, M){
		e[A[i]].PB({B[i], T[i]});
		e[B[i]].PB({A[i], T[i]});
	}

	int sol = 0;

	REP(i, N){
		if (bio[i])
			continue;
		bst = -1, d = -1;
		diam1(i, -1, 0);
		FORA(el, comp[idx])
			bio[el] = 0;
		diam2(bst, -1, 0);
		sol = max(sol, d);
		idx++;
	}

	vi ans;
	REP(i, idx){
		max_lanac(comp[i][0], -1);
		ans.PB(calc(comp[i][0], -1, 0));
	}

	sort(all(ans));
	reverse(all(ans));
	sol = max(sol, ans[0] + ans[1] + L);
	if (sz(ans) > 2){
		sol = max(sol, ans[1] + ans[2] + 2 * L);
	}
	return sol;
}

void local(){
	int n, m, l; cin >> n >> m >> l;
	REP(i, m)
		cin >> a[i] >> b[i] >> t[i];
	cout << travelTime(n, m, l, a, b, t) << '\n';
}

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