oj.uz

Submission #492369

# Submission time Handle Problem Language Result Execution time Memory
492369 2021-12-07T03:14:48 Z NhatMinh0208 Evacuation plan (IZhO18_plan) C++14
100 / 100
 593 ms 40144 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

int rep[100001];
set<int> st[100001]; 
vector<int> ve[100001];

vector<pii(int)> gt[100001];
int n,m,i,j,k,t,t1,u,v,a,b;
priority_queue<pii(int),vector<pii(int)>,greater<pii(int)>> pq;
int dis[100001];
vector<int> ord; 
int qx[100001],qy[100001],qr[100001];
int on[100001];
int main()
{
	fio;
	cin>>n>>m;
	for (i=1;i<=m;i++) {
		cin>>a>>b>>v;
		gt[a].push_back({v,b});
		gt[b].push_back({v,a});
	}
	for (i=1;i<=n;i++) {
		dis[i]=1e9;
	}
	cin>>k;
	for (i=1;i<=k;i++) {
		cin>>u;
		dis[u]=0;
		pq.push({0,u});
	}
	while (pq.size()) {
		auto p = pq.top();
		pq.pop();
		if (dis[p.se]<p.fi) continue;
		for (auto g : gt[p.se]) {
			if (dis[g.se]>p.fi+g.fi) {
				dis[g.se]=p.fi+g.fi;
				pq.push({dis[g.se],g.se});
			}
		}
	}
	for (i=1;i<=n;i++) ord.push_back(i);
	sort(ord.begin(), ord.end(), [](int a, int b){
		return (dis[a]>dis[b]);
	});
	for (i=1;i<=n;i++) {
		ve[i].push_back(i);
		rep[i]=i;
	}
	cin>>t;
	for (i=1;i<=t;i++) {
		cin>>qx[i]>>qy[i];
		st[qx[i]].insert(i);
		st[qy[i]].insert(i);
	}
	for (auto g : ord) {
		on[g]=1;
		for (auto gg : gt[g]) if (on[gg.se]) {
			a=g;
			b=gg.se;
			a=rep[a]; b=rep[b];
			if (a-b) {
				if (st[a].size()+ve[a].size()<st[b].size()+ve[b].size()) {
					for (auto h : ve[a]) {
						rep[h]=b;
						ve[b].push_back(h);
					}
					ve[a].clear();
					for (auto h : st[a]) {
						auto it = st[b].find(h);
						if (it != st[b].end()) {
							qr[h]=dis[g];
							st[b].erase(it);
						}
						else {
							st[b].insert(h);
						}
					}
					st[a].clear();
				}
				else {
					for (auto h : ve[b]) {
						rep[h]=a;
						ve[a].push_back(h);
					}
					ve[b].clear();
					for (auto h : st[b]) {
						auto it = st[a].find(h);
						if (it != st[a].end()) {
							qr[h]=dis[g];
							st[a].erase(it);
						}
						else {
							st[a].insert(h);
						}
					}
					st[b].clear();
				}
			}
		}
	}
	for (i=1;i<=t;i++) cout<<qr[i]<<endl;
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7 
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/

Compilation message

plan.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9676 KB Output is correct
2 Correct 6 ms 9932 KB Output is correct
3 Correct 6 ms 9888 KB Output is correct
4 Correct 4 ms 9676 KB Output is correct
5 Correct 6 ms 9888 KB Output is correct
6 Correct 5 ms 9932 KB Output is correct
7 Correct 4 ms 9676 KB Output is correct
8 Correct 4 ms 9676 KB Output is correct
9 Correct 6 ms 9912 KB Output is correct
10 Correct 6 ms 9932 KB Output is correct
11 Correct 6 ms 9896 KB Output is correct
12 Correct 8 ms 9932 KB Output is correct
13 Correct 6 ms 9932 KB Output is correct
14 Correct 6 ms 9932 KB Output is correct
15 Correct 6 ms 9932 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9676 KB Output is correct
2 Correct 6 ms 9932 KB Output is correct
3 Correct 6 ms 9888 KB Output is correct
4 Correct 4 ms 9676 KB Output is correct
5 Correct 6 ms 9888 KB Output is correct
6 Correct 5 ms 9932 KB Output is correct
7 Correct 4 ms 9676 KB Output is correct
8 Correct 4 ms 9676 KB Output is correct
9 Correct 6 ms 9912 KB Output is correct
10 Correct 6 ms 9932 KB Output is correct
11 Correct 6 ms 9896 KB Output is correct
12 Correct 8 ms 9932 KB Output is correct
13 Correct 6 ms 9932 KB Output is correct
14 Correct 6 ms 9932 KB Output is correct
15 Correct 6 ms 9932 KB Output is correct
16 Correct 231 ms 28424 KB Output is correct
17 Correct 510 ms 39860 KB Output is correct
18 Correct 35 ms 12740 KB Output is correct
19 Correct 217 ms 30948 KB Output is correct
20 Correct 593 ms 40096 KB Output is correct
21 Correct 345 ms 32448 KB Output is correct
22 Correct 159 ms 29468 KB Output is correct
23 Correct 495 ms 39796 KB Output is correct
24 Correct 496 ms 39888 KB Output is correct
25 Correct 496 ms 40004 KB Output is correct
26 Correct 197 ms 30664 KB Output is correct
27 Correct 211 ms 30820 KB Output is correct
28 Correct 212 ms 30668 KB Output is correct
29 Correct 202 ms 31076 KB Output is correct
30 Correct 206 ms 30908 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 4 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 5 ms 9676 KB Output is correct
9 Correct 4 ms 9676 KB Output is correct
10 Correct 4 ms 9720 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 21448 KB Output is correct
2 Correct 315 ms 29072 KB Output is correct
3 Correct 337 ms 28920 KB Output is correct
4 Correct 76 ms 18636 KB Output is correct
5 Correct 360 ms 28956 KB Output is correct
6 Correct 344 ms 28884 KB Output is correct
7 Correct 324 ms 28932 KB Output is correct
8 Correct 335 ms 29040 KB Output is correct
9 Correct 310 ms 28928 KB Output is correct
10 Correct 339 ms 29008 KB Output is correct
11 Correct 311 ms 28904 KB Output is correct
12 Correct 330 ms 28988 KB Output is correct
13 Correct 311 ms 28908 KB Output is correct
14 Correct 321 ms 28928 KB Output is correct
15 Correct 315 ms 28944 KB Output is correct
16 Correct 318 ms 28932 KB Output is correct
17 Correct 336 ms 28964 KB Output is correct
18 Correct 328 ms 28836 KB Output is correct
19 Correct 74 ms 18228 KB Output is correct
20 Correct 312 ms 29028 KB Output is correct
21 Correct 297 ms 28636 KB Output is correct
22 Correct 95 ms 20056 KB Output is correct
23 Correct 98 ms 19872 KB Output is correct
24 Correct 86 ms 19968 KB Output is correct
25 Correct 90 ms 19940 KB Output is correct
26 Correct 106 ms 20540 KB Output is correct
27 Correct 77 ms 18696 KB Output is correct
28 Correct 85 ms 19892 KB Output is correct
29 Correct 87 ms 18484 KB Output is correct
30 Correct 90 ms 19960 KB Output is correct
31 Correct 78 ms 18556 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9676 KB Output is correct
2 Correct 6 ms 9932 KB Output is correct
3 Correct 6 ms 9888 KB Output is correct
4 Correct 4 ms 9676 KB Output is correct
5 Correct 6 ms 9888 KB Output is correct
6 Correct 5 ms 9932 KB Output is correct
7 Correct 4 ms 9676 KB Output is correct
8 Correct 4 ms 9676 KB Output is correct
9 Correct 6 ms 9912 KB Output is correct
10 Correct 6 ms 9932 KB Output is correct
11 Correct 6 ms 9896 KB Output is correct
12 Correct 8 ms 9932 KB Output is correct
13 Correct 6 ms 9932 KB Output is correct
14 Correct 6 ms 9932 KB Output is correct
15 Correct 6 ms 9932 KB Output is correct
16 Correct 231 ms 28424 KB Output is correct
17 Correct 510 ms 39860 KB Output is correct
18 Correct 35 ms 12740 KB Output is correct
19 Correct 217 ms 30948 KB Output is correct
20 Correct 593 ms 40096 KB Output is correct
21 Correct 345 ms 32448 KB Output is correct
22 Correct 159 ms 29468 KB Output is correct
23 Correct 495 ms 39796 KB Output is correct
24 Correct 496 ms 39888 KB Output is correct
25 Correct 496 ms 40004 KB Output is correct
26 Correct 197 ms 30664 KB Output is correct
27 Correct 211 ms 30820 KB Output is correct
28 Correct 212 ms 30668 KB Output is correct
29 Correct 202 ms 31076 KB Output is correct
30 Correct 206 ms 30908 KB Output is correct
31 Correct 7 ms 9676 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 5 ms 9676 KB Output is correct
35 Correct 5 ms 9676 KB Output is correct
36 Correct 4 ms 9676 KB Output is correct
37 Correct 5 ms 9676 KB Output is correct
38 Correct 5 ms 9676 KB Output is correct
39 Correct 4 ms 9676 KB Output is correct
40 Correct 4 ms 9720 KB Output is correct
41 Correct 156 ms 21448 KB Output is correct
42 Correct 315 ms 29072 KB Output is correct
43 Correct 337 ms 28920 KB Output is correct
44 Correct 76 ms 18636 KB Output is correct
45 Correct 360 ms 28956 KB Output is correct
46 Correct 344 ms 28884 KB Output is correct
47 Correct 324 ms 28932 KB Output is correct
48 Correct 335 ms 29040 KB Output is correct
49 Correct 310 ms 28928 KB Output is correct
50 Correct 339 ms 29008 KB Output is correct
51 Correct 311 ms 28904 KB Output is correct
52 Correct 330 ms 28988 KB Output is correct
53 Correct 311 ms 28908 KB Output is correct
54 Correct 321 ms 28928 KB Output is correct
55 Correct 315 ms 28944 KB Output is correct
56 Correct 318 ms 28932 KB Output is correct
57 Correct 336 ms 28964 KB Output is correct
58 Correct 328 ms 28836 KB Output is correct
59 Correct 74 ms 18228 KB Output is correct
60 Correct 312 ms 29028 KB Output is correct
61 Correct 297 ms 28636 KB Output is correct
62 Correct 95 ms 20056 KB Output is correct
63 Correct 98 ms 19872 KB Output is correct
64 Correct 86 ms 19968 KB Output is correct
65 Correct 90 ms 19940 KB Output is correct
66 Correct 106 ms 20540 KB Output is correct
67 Correct 77 ms 18696 KB Output is correct
68 Correct 85 ms 19892 KB Output is correct
69 Correct 87 ms 18484 KB Output is correct
70 Correct 90 ms 19960 KB Output is correct
71 Correct 78 ms 18556 KB Output is correct
72 Correct 357 ms 32396 KB Output is correct
73 Correct 493 ms 39888 KB Output is correct
74 Correct 544 ms 39912 KB Output is correct
75 Correct 530 ms 39948 KB Output is correct
76 Correct 504 ms 39868 KB Output is correct
77 Correct 518 ms 39916 KB Output is correct
78 Correct 500 ms 39940 KB Output is correct
79 Correct 534 ms 39920 KB Output is correct
80 Correct 512 ms 39924 KB Output is correct
81 Correct 507 ms 39852 KB Output is correct
82 Correct 513 ms 40064 KB Output is correct
83 Correct 543 ms 40024 KB Output is correct
84 Correct 511 ms 39872 KB Output is correct
85 Correct 518 ms 39896 KB Output is correct
86 Correct 556 ms 39960 KB Output is correct
87 Correct 510 ms 39864 KB Output is correct
88 Correct 520 ms 40144 KB Output is correct
89 Correct 255 ms 29420 KB Output is correct
90 Correct 531 ms 39984 KB Output is correct
91 Correct 474 ms 39472 KB Output is correct
92 Correct 280 ms 30776 KB Output is correct
93 Correct 389 ms 31396 KB Output is correct
94 Correct 273 ms 30644 KB Output is correct
95 Correct 274 ms 30844 KB Output is correct
96 Correct 438 ms 31420 KB Output is correct
97 Correct 293 ms 29752 KB Output is correct
98 Correct 294 ms 30808 KB Output is correct
99 Correct 303 ms 29724 KB Output is correct
100 Correct 281 ms 30944 KB Output is correct