oj.uz

답안 #342641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342641 2021-01-02T14:48:06 Z NurstanDuisengaliev Evacuation plan (IZhO18_plan) C++14
100 / 100
 981 ms 63344 KB 
// Nurstan Duisengaliev
// не, не надо меня узнавать 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")*/                   
      
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp> 
 
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define mp make_pair
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <int, int>
#define pll pair <ll, ll>
#define boost() ios_base::sync_with_stdio(0), cin.tie(0)
#define sz(x) (int)x.size()
 
using namespace std;
//using namespace __gnu_pbds;
 
//template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;                         
 
const int N = (int)3e5 + 123;
const int mod = (int)1e9 + 7;
const ll INF = (ll)1e18 + 1;
int n, m;
vector <pii> VE, ve, g[N];
vector <int> t[N];
int d[N];                
set <pii> s;
int par[N], NN, ok[N];
int GetPar (int v) {
	if (par[v] == v) return v;
	return par[v] = GetPar (par[v]);
}
void calc () {
	for (auto it : VE) {
		par[it.S] = it.S;	
	}
	for (auto it : VE) {
		int v = it.S;
		for (auto to : g[v]) {
			if (GetPar(to.F) != 0 && GetPar (to.F) != GetPar (v)) {
				NN ++;
				t[GetPar (to.F)].pb (NN);
				t[NN].pb (GetPar (to.F));
				t[GetPar (v)].pb (NN);
				t[NN].pb (GetPar (v));
				par[GetPar (v)] = NN;
				par[GetPar (to.F)] = NN;
				par[NN] = NN;
				ok[NN] = it.F;							
			}				
		}
	}	
}
int tin[N], tout[N], timer = 0, up[N][21];
void dfs (int v, int p) {
	tin[v] = ++ timer;
	up[v][0] = p;
	for (int i = 1; i <= 20; i ++) up[v][i] = up[up[v][i - 1]][i - 1];
	for (auto to : t[v]) {
		if (to != p) dfs (to, v);	
	}               
	tout[v] = timer;
}
bool anc (int v, int u) {
	return (tin[v] <= tin[u] && tout[v] >= tout[u]);
}
int LCA (int v, int u) {
	if (anc (v, u)) return v;
	if (anc (u, v)) return u;
	for (int i = 20; i >= 0; i --) {
		if (!anc (up[v][i], u)) v = up[v][i];
	}
	return up[v][0];
}
void solve () {
	cin >> n >> m;   
	NN = n;
	for (int i = 1; i <= m; i ++) {
		int l, r, w;
		cin >> l >> r >> w;
		g[l].pb (mp (r, w));
		g[r].pb (mp (l, w));
	}
	for (int i = 1; i <= n; i ++) d[i] = mod;
	int K;
	cin >> K;
	for (int i = 1; i <= K; i ++) {		
		int x;
		cin >> x;
		s.in (mp (0, x));
		d[x] = 0;
	}
	for (int i = 1; i <= n; i ++) {
		if (d[i] == mod) s.in (mp (mod, i));
	}
	while (sz (s)) {
		pii o = *s.begin();
		s.erase (o);
		int v = o.S;
		for (auto to : g[v]) {
			if (d[to.F] > d[v] + to.S) {
				s.erase (mp (d[to.F], to.F));
				d[to.F] = d[v] + to.S;
				s.in (mp (d[to.F], to.F));
			}
		}
	}
	for (int i = 1; i <= n; i ++) {
		ve.pb (mp (d[i], i));
    }
    sort (all (ve));
    reverse (all (ve));
    VE.pb (ve[0]);
    for (int i = 1; i < sz (ve); i ++) {
    	if (ve[i].F == ve[i - 1].F) VE.pb (ve[i]);
    	else {
    		calc ();
    	    VE.clear ();
    		VE.pb (ve[i]);
    	}
    }
    calc ();
    dfs (NN, NN);
    int Q;
    cin >> Q;
    while (Q --) {
    	int v, u;
    	cin >> v >> u;
    	int x = LCA (v, u);
    	cout << ok[x] << '\n';
    }
}   	
 
main () {
//	freopen (".in", "r", stdin);
//	freopen (".out", "w", stdout);
	boost ();
	int TT = 1;  	
//    cin >> TT;
	while (TT --) {
		solve ();
	}
	return 0;	                                    
}

Compilation message

plan.cpp:147:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  147 | main () {
      |       ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 12 ms 14828 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 12 ms 14828 KB Output is correct
6 Correct 12 ms 14956 KB Output is correct
7 Correct 10 ms 14444 KB Output is correct
8 Correct 10 ms 14444 KB Output is correct
9 Correct 12 ms 14828 KB Output is correct
10 Correct 12 ms 14828 KB Output is correct
11 Correct 12 ms 14848 KB Output is correct
12 Correct 12 ms 14828 KB Output is correct
13 Correct 12 ms 14828 KB Output is correct
14 Correct 12 ms 14828 KB Output is correct
15 Correct 12 ms 14828 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 12 ms 14828 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 12 ms 14828 KB Output is correct
6 Correct 12 ms 14956 KB Output is correct
7 Correct 10 ms 14444 KB Output is correct
8 Correct 10 ms 14444 KB Output is correct
9 Correct 12 ms 14828 KB Output is correct
10 Correct 12 ms 14828 KB Output is correct
11 Correct 12 ms 14848 KB Output is correct
12 Correct 12 ms 14828 KB Output is correct
13 Correct 12 ms 14828 KB Output is correct
14 Correct 12 ms 14828 KB Output is correct
15 Correct 12 ms 14828 KB Output is correct
16 Correct 415 ms 44020 KB Output is correct
17 Correct 973 ms 63104 KB Output is correct
18 Correct 61 ms 20076 KB Output is correct
19 Correct 427 ms 53392 KB Output is correct
20 Correct 938 ms 63344 KB Output is correct
21 Correct 573 ms 55300 KB Output is correct
22 Correct 364 ms 52976 KB Output is correct
23 Correct 944 ms 63220 KB Output is correct
24 Correct 967 ms 63236 KB Output is correct
25 Correct 964 ms 63212 KB Output is correct
26 Correct 435 ms 53088 KB Output is correct
27 Correct 435 ms 53344 KB Output is correct
28 Correct 439 ms 53048 KB Output is correct
29 Correct 424 ms 53252 KB Output is correct
30 Correct 442 ms 53236 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 9 ms 14444 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 10 ms 14444 KB Output is correct
6 Correct 11 ms 14444 KB Output is correct
7 Correct 10 ms 14444 KB Output is correct
8 Correct 10 ms 14444 KB Output is correct
9 Correct 10 ms 14444 KB Output is correct
10 Correct 10 ms 14444 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 493 ms 53612 KB Output is correct
2 Correct 829 ms 62700 KB Output is correct
3 Correct 849 ms 62864 KB Output is correct
4 Correct 301 ms 48376 KB Output is correct
5 Correct 840 ms 62856 KB Output is correct
6 Correct 844 ms 62600 KB Output is correct
7 Correct 890 ms 62612 KB Output is correct
8 Correct 854 ms 62824 KB Output is correct
9 Correct 822 ms 62716 KB Output is correct
10 Correct 803 ms 62700 KB Output is correct
11 Correct 841 ms 62592 KB Output is correct
12 Correct 825 ms 62700 KB Output is correct
13 Correct 863 ms 62716 KB Output is correct
14 Correct 812 ms 62740 KB Output is correct
15 Correct 836 ms 62724 KB Output is correct
16 Correct 820 ms 62700 KB Output is correct
17 Correct 850 ms 62720 KB Output is correct
18 Correct 825 ms 62720 KB Output is correct
19 Correct 260 ms 50796 KB Output is correct
20 Correct 825 ms 62692 KB Output is correct
21 Correct 658 ms 62956 KB Output is correct
22 Correct 321 ms 51552 KB Output is correct
23 Correct 328 ms 47448 KB Output is correct
24 Correct 320 ms 51540 KB Output is correct
25 Correct 327 ms 51552 KB Output is correct
26 Correct 370 ms 46828 KB Output is correct
27 Correct 286 ms 48480 KB Output is correct
28 Correct 312 ms 51552 KB Output is correct
29 Correct 286 ms 48572 KB Output is correct
30 Correct 329 ms 51576 KB Output is correct
31 Correct 301 ms 48440 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 12 ms 14828 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 12 ms 14828 KB Output is correct
6 Correct 12 ms 14956 KB Output is correct
7 Correct 10 ms 14444 KB Output is correct
8 Correct 10 ms 14444 KB Output is correct
9 Correct 12 ms 14828 KB Output is correct
10 Correct 12 ms 14828 KB Output is correct
11 Correct 12 ms 14848 KB Output is correct
12 Correct 12 ms 14828 KB Output is correct
13 Correct 12 ms 14828 KB Output is correct
14 Correct 12 ms 14828 KB Output is correct
15 Correct 12 ms 14828 KB Output is correct
16 Correct 415 ms 44020 KB Output is correct
17 Correct 973 ms 63104 KB Output is correct
18 Correct 61 ms 20076 KB Output is correct
19 Correct 427 ms 53392 KB Output is correct
20 Correct 938 ms 63344 KB Output is correct
21 Correct 573 ms 55300 KB Output is correct
22 Correct 364 ms 52976 KB Output is correct
23 Correct 944 ms 63220 KB Output is correct
24 Correct 967 ms 63236 KB Output is correct
25 Correct 964 ms 63212 KB Output is correct
26 Correct 435 ms 53088 KB Output is correct
27 Correct 435 ms 53344 KB Output is correct
28 Correct 439 ms 53048 KB Output is correct
29 Correct 424 ms 53252 KB Output is correct
30 Correct 442 ms 53236 KB Output is correct
31 Correct 10 ms 14444 KB Output is correct
32 Correct 10 ms 14444 KB Output is correct
33 Correct 9 ms 14444 KB Output is correct
34 Correct 10 ms 14444 KB Output is correct
35 Correct 10 ms 14444 KB Output is correct
36 Correct 11 ms 14444 KB Output is correct
37 Correct 10 ms 14444 KB Output is correct
38 Correct 10 ms 14444 KB Output is correct
39 Correct 10 ms 14444 KB Output is correct
40 Correct 10 ms 14444 KB Output is correct
41 Correct 493 ms 53612 KB Output is correct
42 Correct 829 ms 62700 KB Output is correct
43 Correct 849 ms 62864 KB Output is correct
44 Correct 301 ms 48376 KB Output is correct
45 Correct 840 ms 62856 KB Output is correct
46 Correct 844 ms 62600 KB Output is correct
47 Correct 890 ms 62612 KB Output is correct
48 Correct 854 ms 62824 KB Output is correct
49 Correct 822 ms 62716 KB Output is correct
50 Correct 803 ms 62700 KB Output is correct
51 Correct 841 ms 62592 KB Output is correct
52 Correct 825 ms 62700 KB Output is correct
53 Correct 863 ms 62716 KB Output is correct
54 Correct 812 ms 62740 KB Output is correct
55 Correct 836 ms 62724 KB Output is correct
56 Correct 820 ms 62700 KB Output is correct
57 Correct 850 ms 62720 KB Output is correct
58 Correct 825 ms 62720 KB Output is correct
59 Correct 260 ms 50796 KB Output is correct
60 Correct 825 ms 62692 KB Output is correct
61 Correct 658 ms 62956 KB Output is correct
62 Correct 321 ms 51552 KB Output is correct
63 Correct 328 ms 47448 KB Output is correct
64 Correct 320 ms 51540 KB Output is correct
65 Correct 327 ms 51552 KB Output is correct
66 Correct 370 ms 46828 KB Output is correct
67 Correct 286 ms 48480 KB Output is correct
68 Correct 312 ms 51552 KB Output is correct
69 Correct 286 ms 48572 KB Output is correct
70 Correct 329 ms 51576 KB Output is correct
71 Correct 301 ms 48440 KB Output is correct
72 Correct 626 ms 55404 KB Output is correct
73 Correct 981 ms 63088 KB Output is correct
74 Correct 926 ms 63012 KB Output is correct
75 Correct 941 ms 63260 KB Output is correct
76 Correct 938 ms 63084 KB Output is correct
77 Correct 963 ms 63244 KB Output is correct
78 Correct 946 ms 63212 KB Output is correct
79 Correct 936 ms 63108 KB Output is correct
80 Correct 929 ms 63340 KB Output is correct
81 Correct 941 ms 63172 KB Output is correct
82 Correct 933 ms 62792 KB Output is correct
83 Correct 929 ms 63084 KB Output is correct
84 Correct 954 ms 63212 KB Output is correct
85 Correct 923 ms 63084 KB Output is correct
86 Correct 927 ms 63084 KB Output is correct
87 Correct 923 ms 63084 KB Output is correct
88 Correct 930 ms 63176 KB Output is correct
89 Correct 400 ms 53100 KB Output is correct
90 Correct 919 ms 63212 KB Output is correct
91 Correct 771 ms 63212 KB Output is correct
92 Correct 439 ms 53088 KB Output is correct
93 Correct 409 ms 49644 KB Output is correct
94 Correct 446 ms 53088 KB Output is correct
95 Correct 442 ms 53088 KB Output is correct
96 Correct 474 ms 48252 KB Output is correct
97 Correct 390 ms 50300 KB Output is correct
98 Correct 437 ms 52992 KB Output is correct
99 Correct 421 ms 50280 KB Output is correct
100 Correct 437 ms 53088 KB Output is correct