Submission #839141

#	Time	Username	Problem	Language	Result	Execution time	Memory
839141		thegamercoder19	Race (IOI11_race)	C++14	100 / 100	449 ms	106060 KiB

race

#include "race.h"
#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;

V<V<pll>> g;
V<map<ll, ll>> ds;
V<ll> d, s;
ll res = INFL;
void dfs(ll u, ll p, ll dep, ll su)
{
	ds[u][su] = dep;
	d[u] = dep;
	s[u] = su;
	FORA(g[u], v)
	{
		if (v.first == p)continue;
		dfs(v.first, u, dep + 1, su + v.second);
	}
}
void calc(ll u, ll p, ll k)
{
	FORA(g[u], v)
	{
		if (v.first == p)continue;
		calc(v.first, u, k);
		if (ds[u].size() < ds[v.first].size())swap(ds[u], ds[v.first]);
		FORA(ds[v.first], dsv)
		{
			auto it = ds[u].find(k + 2*s[u] - dsv.first);
			if ( it != ds[u].end())res = min(res, it->second + dsv.second - 2 * d[u]);
		}
		FORA(ds[v.first], dsv)
		{
			if (ds[u].find(dsv.first) == ds[u].end())ds[u].insert(dsv);
			else ds[u][dsv.first] = min(ds[u][dsv.first], dsv.second);
		}
	}
}
int best_path(int n, int k , int h[][2], int l[])
{

	g.resize(n + 1); ds.resize(n + 1); d.resize(n + 1); s.resize(n + 1);
	FOR(ll, i, 0, n-1, 1)g[h[i][0]].push_back({ h[i][1], l[i] }), g[h[i][1]].push_back({ h[i][0], l[i] });
	dfs(0, -1, 0, 0);
	calc(0, 0, k);
	RET res == INFL ? -1 : res;
}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 57 / 57