oj.uz

Submission #93980

# Submission time Handle Problem Language Result Execution time Memory
93980 2019-01-13T20:07:33 Z qkxwsm Evacuation plan (IZhO18_plan) C++14
100 / 100
 661 ms 68164 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 500013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M, Q, T;
bitset<MAXN> flag;
vpi edge[MAXN];
pii quer[MAXN];
int dis[MAXN];
int dsu[MAXN];
int siz[MAXN];
map<int, int> dsu1[MAXN];
int ord[MAXN];
int res[MAXN];

bool cmp(int a, int b)
{
	return MP(-dis[a], a) < MP(-dis[b], b);
}
int get(int u)
{
	return (u == dsu[u] ? u : get(dsu[u]));
}
int get1(int u, int t)
{
	int v = prev(dsu1[u].UB(t)) -> se;
	if (v == u) return u;
	return get1(v, t);
}
void merge(int u, int v)
{
	u = get(u);
	v = get(v);
	if (u == v) return;
	if (siz[u] < siz[v]) swap(u, v);
	dsu[v] = u;
	siz[u] += siz[v];
	siz[v] = 0;
	dsu1[v][T] = u;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	readi(N); readi(M);
	FOR(i, 0, M)
	{
		int u, v, x;
		readi(u); readi(v); readi(x);
		u--; v--;
		edge[u].PB({x, v});
		edge[v].PB({x, u});
	}
	readi(M);
	FOR(i, 0, M)
	{
		int u;
		readi(u);
		u--;
		flag[u] = true;
	}
	readi(Q);
	FOR(i, 0, Q)
	{
		int u, v;
		readi(u); readi(v);
		u--; v--;
		quer[i] = {u, v};
	}
	priority_queue<pii, vector<pii>, greater<pii> > pq;
	FOR(i, 0, N)
	{
		dis[i] = INF;
		if (flag[i])
		{
			dis[i] = 0;
			pq.push({0, i});
		}
	}
	// cerr << "yep\n";
	while(!pq.empty())
	{
		int d = pq.top().fi, u = pq.top().se;
		pq.pop();
		if (d != dis[u])
		{
			continue;
		}
		for (pii p : edge[u])
		{
			int nd = p.fi + d, v = p.se;
			if (dis[v] > nd)
			{
				dis[v] = nd;
				pq.push({nd, v});
			}
		}
	}
	FOR(i, 0, N)
	{
		dsu[i] = i;
		siz[i] = 1;
		ord[i] = i;
		dsu1[i][-1] = i;
	}
	sort(ord, ord + N, cmp);
	FOR(i, 0, N)
	{
		//activate
		int u = ord[i];
		// cerr << "activate " << u << endl;
		for (pii p : edge[u])
		{
			int v = p.se;
			if (cmp(v, u))
			{
				merge(v, u);
				res[T] = dis[u];
				T++;
			}
		}
	}
	FOR(i, 0, Q)
	{
		int u = quer[i].fi, v = quer[i].se;
		if (flag[u] || flag[v])
		{
			puts("0");
			continue;
		}
		int lo = 0, hi = CO;
		while(hi > lo)
		{
			int mid = (hi + lo) >> 1;
			if (get1(u, mid) == get1(v, mid)) hi = mid;
			else lo = mid + 1;
		}
		printi(res[lo]); putchar('\n');
	}
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB Output is correct
2 Correct 36 ms 35832 KB Output is correct
3 Correct 37 ms 35832 KB Output is correct
4 Correct 35 ms 35576 KB Output is correct
5 Correct 36 ms 35832 KB Output is correct
6 Correct 36 ms 35872 KB Output is correct
7 Correct 35 ms 35576 KB Output is correct
8 Correct 35 ms 35704 KB Output is correct
9 Correct 36 ms 35832 KB Output is correct
10 Correct 35 ms 35832 KB Output is correct
11 Correct 37 ms 35832 KB Output is correct
12 Correct 37 ms 35964 KB Output is correct
13 Correct 36 ms 35832 KB Output is correct
14 Correct 37 ms 35832 KB Output is correct
15 Correct 37 ms 35832 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB Output is correct
2 Correct 36 ms 35832 KB Output is correct
3 Correct 37 ms 35832 KB Output is correct
4 Correct 35 ms 35576 KB Output is correct
5 Correct 36 ms 35832 KB Output is correct
6 Correct 36 ms 35872 KB Output is correct
7 Correct 35 ms 35576 KB Output is correct
8 Correct 35 ms 35704 KB Output is correct
9 Correct 36 ms 35832 KB Output is correct
10 Correct 35 ms 35832 KB Output is correct
11 Correct 37 ms 35832 KB Output is correct
12 Correct 37 ms 35964 KB Output is correct
13 Correct 36 ms 35832 KB Output is correct
14 Correct 37 ms 35832 KB Output is correct
15 Correct 37 ms 35832 KB Output is correct
16 Correct 320 ms 49560 KB Output is correct
17 Correct 654 ms 67096 KB Output is correct
18 Correct 73 ms 39160 KB Output is correct
19 Correct 286 ms 55364 KB Output is correct
20 Correct 647 ms 67212 KB Output is correct
21 Correct 315 ms 58200 KB Output is correct
22 Correct 288 ms 54148 KB Output is correct
23 Correct 639 ms 67128 KB Output is correct
24 Correct 643 ms 66944 KB Output is correct
25 Correct 620 ms 66900 KB Output is correct
26 Correct 283 ms 55084 KB Output is correct
27 Correct 274 ms 55148 KB Output is correct
28 Correct 283 ms 55072 KB Output is correct
29 Correct 278 ms 55140 KB Output is correct
30 Correct 279 ms 55352 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35728 KB Output is correct
2 Correct 36 ms 35604 KB Output is correct
3 Correct 35 ms 35560 KB Output is correct
4 Correct 34 ms 35576 KB Output is correct
5 Correct 35 ms 35576 KB Output is correct
6 Correct 35 ms 35604 KB Output is correct
7 Correct 35 ms 35576 KB Output is correct
8 Correct 35 ms 35576 KB Output is correct
9 Correct 36 ms 35576 KB Output is correct
10 Correct 36 ms 35576 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 54056 KB Output is correct
2 Correct 527 ms 62440 KB Output is correct
3 Correct 552 ms 62340 KB Output is correct
4 Correct 177 ms 50056 KB Output is correct
5 Correct 538 ms 62396 KB Output is correct
6 Correct 530 ms 62380 KB Output is correct
7 Correct 532 ms 62340 KB Output is correct
8 Correct 524 ms 62304 KB Output is correct
9 Correct 514 ms 62348 KB Output is correct
10 Correct 524 ms 62424 KB Output is correct
11 Correct 508 ms 62384 KB Output is correct
12 Correct 528 ms 65668 KB Output is correct
13 Correct 559 ms 65768 KB Output is correct
14 Correct 514 ms 65784 KB Output is correct
15 Correct 515 ms 65752 KB Output is correct
16 Correct 501 ms 65776 KB Output is correct
17 Correct 514 ms 65836 KB Output is correct
18 Correct 563 ms 65692 KB Output is correct
19 Correct 168 ms 51448 KB Output is correct
20 Correct 527 ms 65744 KB Output is correct
21 Correct 461 ms 65428 KB Output is correct
22 Correct 179 ms 53084 KB Output is correct
23 Correct 180 ms 51920 KB Output is correct
24 Correct 180 ms 53024 KB Output is correct
25 Correct 171 ms 53096 KB Output is correct
26 Correct 181 ms 51972 KB Output is correct
27 Correct 167 ms 51428 KB Output is correct
28 Correct 174 ms 53024 KB Output is correct
29 Correct 167 ms 51420 KB Output is correct
30 Correct 175 ms 53060 KB Output is correct
31 Correct 163 ms 51540 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB Output is correct
2 Correct 36 ms 35832 KB Output is correct
3 Correct 37 ms 35832 KB Output is correct
4 Correct 35 ms 35576 KB Output is correct
5 Correct 36 ms 35832 KB Output is correct
6 Correct 36 ms 35872 KB Output is correct
7 Correct 35 ms 35576 KB Output is correct
8 Correct 35 ms 35704 KB Output is correct
9 Correct 36 ms 35832 KB Output is correct
10 Correct 35 ms 35832 KB Output is correct
11 Correct 37 ms 35832 KB Output is correct
12 Correct 37 ms 35964 KB Output is correct
13 Correct 36 ms 35832 KB Output is correct
14 Correct 37 ms 35832 KB Output is correct
15 Correct 37 ms 35832 KB Output is correct
16 Correct 320 ms 49560 KB Output is correct
17 Correct 654 ms 67096 KB Output is correct
18 Correct 73 ms 39160 KB Output is correct
19 Correct 286 ms 55364 KB Output is correct
20 Correct 647 ms 67212 KB Output is correct
21 Correct 315 ms 58200 KB Output is correct
22 Correct 288 ms 54148 KB Output is correct
23 Correct 639 ms 67128 KB Output is correct
24 Correct 643 ms 66944 KB Output is correct
25 Correct 620 ms 66900 KB Output is correct
26 Correct 283 ms 55084 KB Output is correct
27 Correct 274 ms 55148 KB Output is correct
28 Correct 283 ms 55072 KB Output is correct
29 Correct 278 ms 55140 KB Output is correct
30 Correct 279 ms 55352 KB Output is correct
31 Correct 35 ms 35728 KB Output is correct
32 Correct 36 ms 35604 KB Output is correct
33 Correct 35 ms 35560 KB Output is correct
34 Correct 34 ms 35576 KB Output is correct
35 Correct 35 ms 35576 KB Output is correct
36 Correct 35 ms 35604 KB Output is correct
37 Correct 35 ms 35576 KB Output is correct
38 Correct 35 ms 35576 KB Output is correct
39 Correct 36 ms 35576 KB Output is correct
40 Correct 36 ms 35576 KB Output is correct
41 Correct 283 ms 54056 KB Output is correct
42 Correct 527 ms 62440 KB Output is correct
43 Correct 552 ms 62340 KB Output is correct
44 Correct 177 ms 50056 KB Output is correct
45 Correct 538 ms 62396 KB Output is correct
46 Correct 530 ms 62380 KB Output is correct
47 Correct 532 ms 62340 KB Output is correct
48 Correct 524 ms 62304 KB Output is correct
49 Correct 514 ms 62348 KB Output is correct
50 Correct 524 ms 62424 KB Output is correct
51 Correct 508 ms 62384 KB Output is correct
52 Correct 528 ms 65668 KB Output is correct
53 Correct 559 ms 65768 KB Output is correct
54 Correct 514 ms 65784 KB Output is correct
55 Correct 515 ms 65752 KB Output is correct
56 Correct 501 ms 65776 KB Output is correct
57 Correct 514 ms 65836 KB Output is correct
58 Correct 563 ms 65692 KB Output is correct
59 Correct 168 ms 51448 KB Output is correct
60 Correct 527 ms 65744 KB Output is correct
61 Correct 461 ms 65428 KB Output is correct
62 Correct 179 ms 53084 KB Output is correct
63 Correct 180 ms 51920 KB Output is correct
64 Correct 180 ms 53024 KB Output is correct
65 Correct 171 ms 53096 KB Output is correct
66 Correct 181 ms 51972 KB Output is correct
67 Correct 167 ms 51428 KB Output is correct
68 Correct 174 ms 53024 KB Output is correct
69 Correct 167 ms 51420 KB Output is correct
70 Correct 175 ms 53060 KB Output is correct
71 Correct 163 ms 51540 KB Output is correct
72 Correct 401 ms 57856 KB Output is correct
73 Correct 661 ms 67144 KB Output is correct
74 Correct 634 ms 67008 KB Output is correct
75 Correct 637 ms 67176 KB Output is correct
76 Correct 638 ms 67056 KB Output is correct
77 Correct 627 ms 67156 KB Output is correct
78 Correct 620 ms 67148 KB Output is correct
79 Correct 660 ms 67056 KB Output is correct
80 Correct 645 ms 67076 KB Output is correct
81 Correct 627 ms 67108 KB Output is correct
82 Correct 629 ms 67224 KB Output is correct
83 Correct 635 ms 67072 KB Output is correct
84 Correct 625 ms 67152 KB Output is correct
85 Correct 598 ms 68164 KB Output is correct
86 Correct 639 ms 67000 KB Output is correct
87 Correct 637 ms 66932 KB Output is correct
88 Correct 642 ms 66904 KB Output is correct
89 Correct 297 ms 54076 KB Output is correct
90 Correct 652 ms 66800 KB Output is correct
91 Correct 498 ms 66368 KB Output is correct
92 Correct 287 ms 55028 KB Output is correct
93 Correct 431 ms 54456 KB Output is correct
94 Correct 279 ms 54920 KB Output is correct
95 Correct 280 ms 55108 KB Output is correct
96 Correct 432 ms 53912 KB Output is correct
97 Correct 293 ms 53624 KB Output is correct
98 Correct 284 ms 54996 KB Output is correct
99 Correct 302 ms 53624 KB Output is correct
100 Correct 293 ms 55056 KB Output is correct