제출 #891207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891207		vjudge1	Evacuation plan (IZhO18_plan)	C++17	100 / 100	544 ms	135108 KiB

plan

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

//#pragma GCC optimization("g", on)
//#pragma GCC optimization("03")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("inline")
//#pragma GCC optimize("-fgcse,-fgcse-lm")
//#pragma GCC optimize("-ftree-pre,-ftree-vrp")
//#pragma GCC optimize("-ffast-math")
//#pragma GCC optimize("-fipa-sra")
//#pragma GCC optimize("-fpeephole2")
//#pragma GCC optimize("-fsched-spec")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 5e5 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
ll n, m;
vector<pll> g[N];
ll a[N], b[N], w[N];
ll d[N];
vector<pll> gr[N];
ll p[N], s[N];
ll dep[N];
ll up[N][22], mn[N][22];

ll get(ll x) {
	return p[x] = (p[x] == x ? x : get(p[x]));
}

void upd(ll u, ll v) {
	u = get(u);
	v = get(v);
	if (s[u] < s[v]) swap(u, v);
	s[u] += s[v];
	p[v] = u;
}

void dfs(ll v, ll p, ll in) {
	dep[v] = dep[p] + 1;
	up[v][0] = p;
	mn[v][0] = in;
	for (int i = 1;i <= 20;i++) {
		up[v][i] = up[up[v][i - 1]][i - 1];
		mn[v][i] = min(mn[v][i - 1], mn[up[v][i - 1]][i - 1]);
	}
	for (auto it : gr[v]) {
		ll to = it.ff, h = it.ss;
		if (to == p) continue;
		dfs(to, v, h);
	}
}

ll lca(ll u, ll v) {
	if (dep[u] < dep[v]) swap(u, v);
	ll k = dep[u] - dep[v];
	for (int i = 20;i >= 0;i--) {
		if (k & (1 << i)) {
			u = up[u][i];
		}
	}
	if (u == v) return u;
	for (int i = 20;i >= 0;i--) {
		if (up[u][i] != up[v][i]) {
			u = up[u][i];
			v = up[v][i];
		}
	}
	return up[u][0];
}

ll get1(ll u, ll v) {
	ll ans = inf;
	ll k = dep[v] - dep[u];
	for (int i = 20;i >= 0;i--) {
		if (k & (1 << i)) {
			ans = min(ans, mn[v][i]);
			v = up[v][i];
		}
	}
	return ans;
}

void solve() {
	cin >> n >> m;
	for (int i = 1;i <= n;i++) {
		d[i] = inf;
		p[i] = i;
		s[i] = 1;
	}
	for (int i = 1;i <= m;i++) {
		cin >> a[i] >> b[i] >> w[i];
		g[a[i]].pb({b[i], w[i]});
		g[b[i]].pb({a[i], w[i]});
	}
	set<pll> st;
	ll k; cin >> k;
	for (int i = 1;i <= k;i++) {
		ll x; cin >> x;
		st.insert({0, x});
		d[x] = 0;
	}
	while (!st.empty()) {
		ll v = (*st.bg).ss;
		st.erase(st.bg);
		for (auto to : g[v]) {
			if (d[v] + to.ss < d[to.ff]) {
				st.erase({d[to.ff], to.ff});
				d[to.ff] = d[v] + to.ss;
				st.insert({d[to.ff], to.ff});
			}
		}
	}
//	for (int i = 1;i <= n;i++) {
//		cout << d[i] << sp << i << en;
//	}
	vector<pll> v;
	for (int i = 1;i <= m;i++) {
		ll mn = min(d[a[i]], d[b[i]]);
		v.pb({mn, i});
	}
	sort(all(v));
	reverse(all(v));
	for (auto to : v) {
		ll i = to.ss;
//		cout << to.ff << sp << i << en;
		if (get(a[i]) != get(b[i])) {
			upd(a[i], b[i]);
//			cout << a[i] << sp << b[i] << sp << w[i] << en;
			gr[a[i]].pb({b[i], to.ff});
			gr[b[i]].pb({a[i], to.ff});
		}
	}
	dfs(1, 0, inf);
	ll q; cin >> q;
	while (q--) {
		ll x, y; cin >> x >> y;
		ll lc = lca(x, y);
//		cout << lc << sp << get(lc, x) << sp << get(lc, y) << sp << x << sp << y << en;
		cout << min(get1(lc, x), get1(lc, y)) << en;
	}
}
   
int main() {      
    aboba    
//    freopen("cownomics");
//    precalc();
//    cin >> tt;
    for (int i = 1;i <= tt;i++) {
		solve();
    }
}

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

plan.cpp: In function 'void freopen(std::string)':
plan.cpp:47:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:47:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 19 / 19
• Subtask 5: 46 / 46