oj.uz

Submission #907899

# Submission time Handle Problem Language Result Execution time Memory
907899 2024-01-16T05:56:25 Z Nuraly_Serikbay Evacuation plan (IZhO18_plan) C++17
100 / 100
 930 ms 163432 KB 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
using namespace std;

typedef long long ll;
typedef long double ld;

#define all(x) x.begin(),x.end()
#define pb push_back
#define ent "\n"

#define int long long

const int maxn = (int)1e6 + 13;
const ll inf = (long long)1e18 + 20;
const int mod = (int)1e9 + 7;

int n,m,k,q;
int ans[maxn];
vector<pair<int,int>>g[maxn];
int a[maxn],b[maxn],c[maxn];
int dst[maxn];
int pr[maxn];
int sz[maxn];
int x[maxn],y[maxn];
pair<int,int>qur[maxn];
vector<int>pos[maxn],mid[maxn];
int rev[maxn];

int get(int x){
	if(x == pr[x])return x;
	return pr[x] = get(pr[x]);
}

void unite(int x,int y){
	x = get(x),y= get(y);
	if(x == y)return ;
	if(sz[x] > sz[y])swap(x,y);
	pr[x] = y;
	sz[y] += sz[x];
}

void solve(){
	cin >> n >> m ;
	for(int i = 1 ; i <= m ; i++){
		int x,y,w;cin >> x >> y >> w;
		g[x].pb({y,w});
		g[y].pb({x,w});
		a[i] = x,b[i] = y,c[i] = w;
	}
	cin >> k;
	set<pair<int,int>>s;
	for(int i = 1 ; i <= n ; i ++){
		dst[i] = inf;
		pr[i] = i;
	}
	for(int i = 1 ; i <= k ; i ++){
		int x;cin >> x;
		s.insert({0,x});
		dst[x] = 0;
	}
	while(s.size()){
		pair<int,int>v = *s.begin();
		s.erase(v);
		for(auto to : g[v.second]){
			int val = dst[v.second] + to.second;
			if(dst[to.first] > val){
				dst[to.first] = val;
				s.insert({val,to.first});
			}
		}
	}
	vector<int>comp;
	for(int i = 1 ; i <= n ; i ++){
		comp.pb(dst[i]);
	}
	sort(all(comp));
	comp.erase(unique(all(comp)),comp.end());
	for(int i = 1 ; i <= n ; i ++){
		int orig = dst[i];
		dst[i] = upper_bound(all(comp),dst[i]) - comp.begin();
		rev[dst[i]] = orig;
	}
	for(int i = 1 ; i <= m ; i ++){
		pos[min(dst[a[i]],dst[b[i]])].pb(i);
	}
	cin >> q;
	for(int i = 1 ; i <= q ; i ++){
		cin >> x[i] >> y[i];
		qur[i] = {1,comp.size()};
	}
	for(int I = 1 ; I <= 25 ; I ++){
		for(int i = 0 ; i <= n ; i ++){
			pr[i] = i;
			sz[i] = 1;
			mid[i].clear();
		}
		for(int i = 1 ; i <= q ; i ++){
			if(qur[i].first <= qur[i].second){
				int m = (qur[i].first + qur[i].second) >> 1;
				mid[m].pb(i);			
			}
		}
		for(int i = comp.size() ; i >= 1 ; i --){
			for(auto to : pos[i]){
				unite(a[to],b[to]);
			}
			for(auto to : mid[i]){
				if(get(x[to]) == get(y[to])){
					qur[to].first = i + 1;
					//ans[to] = i;
				}
				else{
					qur[to].second = i - 1;
				}
			}
		}
	}
	for(int i = 1 ; i <= q ;  i++){
		cout << rev[qur[i].first - 1] << ent;
	}
}

signed main(){
	// freopen ("hps.in", "r", stdin);
	// freopen ("hps.out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	int test = 0;
	while(t --){
	//	cout << "Case " << ++test << ": ";
		solve();
	}
	return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:158:6: warning: unused variable 'test' [-Wunused-variable]
  158 |  int test = 0;
      |      ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 92764 KB Output is correct
2 Correct 26 ms 92764 KB Output is correct
3 Correct 26 ms 92764 KB Output is correct
4 Correct 26 ms 92688 KB Output is correct
5 Correct 26 ms 92752 KB Output is correct
6 Correct 27 ms 93020 KB Output is correct
7 Correct 25 ms 92764 KB Output is correct
8 Correct 26 ms 92756 KB Output is correct
9 Correct 26 ms 93020 KB Output is correct
10 Correct 26 ms 92764 KB Output is correct
11 Correct 27 ms 93020 KB Output is correct
12 Correct 26 ms 92752 KB Output is correct
13 Correct 27 ms 93016 KB Output is correct
14 Correct 26 ms 92784 KB Output is correct
15 Correct 26 ms 93012 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 92764 KB Output is correct
2 Correct 26 ms 92764 KB Output is correct
3 Correct 26 ms 92764 KB Output is correct
4 Correct 26 ms 92688 KB Output is correct
5 Correct 26 ms 92752 KB Output is correct
6 Correct 27 ms 93020 KB Output is correct
7 Correct 25 ms 92764 KB Output is correct
8 Correct 26 ms 92756 KB Output is correct
9 Correct 26 ms 93020 KB Output is correct
10 Correct 26 ms 92764 KB Output is correct
11 Correct 27 ms 93020 KB Output is correct
12 Correct 26 ms 92752 KB Output is correct
13 Correct 27 ms 93016 KB Output is correct
14 Correct 26 ms 92784 KB Output is correct
15 Correct 26 ms 93012 KB Output is correct
16 Correct 210 ms 121788 KB Output is correct
17 Correct 796 ms 162924 KB Output is correct
18 Correct 61 ms 99512 KB Output is correct
19 Correct 166 ms 122280 KB Output is correct
20 Correct 746 ms 163392 KB Output is correct
21 Correct 272 ms 130880 KB Output is correct
22 Correct 212 ms 133372 KB Output is correct
23 Correct 679 ms 163224 KB Output is correct
24 Correct 694 ms 163268 KB Output is correct
25 Correct 930 ms 162128 KB Output is correct
26 Correct 160 ms 123072 KB Output is correct
27 Correct 159 ms 122044 KB Output is correct
28 Correct 171 ms 122812 KB Output is correct
29 Correct 164 ms 121280 KB Output is correct
30 Correct 183 ms 122304 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 92752 KB Output is correct
2 Correct 26 ms 92764 KB Output is correct
3 Correct 26 ms 92764 KB Output is correct
4 Correct 25 ms 92688 KB Output is correct
5 Correct 25 ms 92760 KB Output is correct
6 Correct 27 ms 92672 KB Output is correct
7 Correct 26 ms 92816 KB Output is correct
8 Correct 26 ms 92764 KB Output is correct
9 Correct 26 ms 92764 KB Output is correct
10 Correct 27 ms 92764 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 117204 KB Output is correct
2 Correct 810 ms 149592 KB Output is correct
3 Correct 798 ms 149296 KB Output is correct
4 Correct 143 ms 111380 KB Output is correct
5 Correct 704 ms 149580 KB Output is correct
6 Correct 613 ms 149736 KB Output is correct
7 Correct 692 ms 149312 KB Output is correct
8 Correct 885 ms 149708 KB Output is correct
9 Correct 621 ms 149892 KB Output is correct
10 Correct 595 ms 149812 KB Output is correct
11 Correct 576 ms 149860 KB Output is correct
12 Correct 612 ms 149840 KB Output is correct
13 Correct 622 ms 149332 KB Output is correct
14 Correct 735 ms 149588 KB Output is correct
15 Correct 575 ms 149652 KB Output is correct
16 Correct 614 ms 149560 KB Output is correct
17 Correct 603 ms 149388 KB Output is correct
18 Correct 601 ms 149368 KB Output is correct
19 Correct 122 ms 111256 KB Output is correct
20 Correct 596 ms 149328 KB Output is correct
21 Correct 476 ms 149940 KB Output is correct
22 Correct 156 ms 111532 KB Output is correct
23 Correct 170 ms 110400 KB Output is correct
24 Correct 143 ms 111296 KB Output is correct
25 Correct 176 ms 111296 KB Output is correct
26 Correct 155 ms 110152 KB Output is correct
27 Correct 119 ms 111332 KB Output is correct
28 Correct 129 ms 112244 KB Output is correct
29 Correct 116 ms 111376 KB Output is correct
30 Correct 145 ms 111812 KB Output is correct
31 Correct 114 ms 111260 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 92764 KB Output is correct
2 Correct 26 ms 92764 KB Output is correct
3 Correct 26 ms 92764 KB Output is correct
4 Correct 26 ms 92688 KB Output is correct
5 Correct 26 ms 92752 KB Output is correct
6 Correct 27 ms 93020 KB Output is correct
7 Correct 25 ms 92764 KB Output is correct
8 Correct 26 ms 92756 KB Output is correct
9 Correct 26 ms 93020 KB Output is correct
10 Correct 26 ms 92764 KB Output is correct
11 Correct 27 ms 93020 KB Output is correct
12 Correct 26 ms 92752 KB Output is correct
13 Correct 27 ms 93016 KB Output is correct
14 Correct 26 ms 92784 KB Output is correct
15 Correct 26 ms 93012 KB Output is correct
16 Correct 210 ms 121788 KB Output is correct
17 Correct 796 ms 162924 KB Output is correct
18 Correct 61 ms 99512 KB Output is correct
19 Correct 166 ms 122280 KB Output is correct
20 Correct 746 ms 163392 KB Output is correct
21 Correct 272 ms 130880 KB Output is correct
22 Correct 212 ms 133372 KB Output is correct
23 Correct 679 ms 163224 KB Output is correct
24 Correct 694 ms 163268 KB Output is correct
25 Correct 930 ms 162128 KB Output is correct
26 Correct 160 ms 123072 KB Output is correct
27 Correct 159 ms 122044 KB Output is correct
28 Correct 171 ms 122812 KB Output is correct
29 Correct 164 ms 121280 KB Output is correct
30 Correct 183 ms 122304 KB Output is correct
31 Correct 26 ms 92752 KB Output is correct
32 Correct 26 ms 92764 KB Output is correct
33 Correct 26 ms 92764 KB Output is correct
34 Correct 25 ms 92688 KB Output is correct
35 Correct 25 ms 92760 KB Output is correct
36 Correct 27 ms 92672 KB Output is correct
37 Correct 26 ms 92816 KB Output is correct
38 Correct 26 ms 92764 KB Output is correct
39 Correct 26 ms 92764 KB Output is correct
40 Correct 27 ms 92764 KB Output is correct
41 Correct 260 ms 117204 KB Output is correct
42 Correct 810 ms 149592 KB Output is correct
43 Correct 798 ms 149296 KB Output is correct
44 Correct 143 ms 111380 KB Output is correct
45 Correct 704 ms 149580 KB Output is correct
46 Correct 613 ms 149736 KB Output is correct
47 Correct 692 ms 149312 KB Output is correct
48 Correct 885 ms 149708 KB Output is correct
49 Correct 621 ms 149892 KB Output is correct
50 Correct 595 ms 149812 KB Output is correct
51 Correct 576 ms 149860 KB Output is correct
52 Correct 612 ms 149840 KB Output is correct
53 Correct 622 ms 149332 KB Output is correct
54 Correct 735 ms 149588 KB Output is correct
55 Correct 575 ms 149652 KB Output is correct
56 Correct 614 ms 149560 KB Output is correct
57 Correct 603 ms 149388 KB Output is correct
58 Correct 601 ms 149368 KB Output is correct
59 Correct 122 ms 111256 KB Output is correct
60 Correct 596 ms 149328 KB Output is correct
61 Correct 476 ms 149940 KB Output is correct
62 Correct 156 ms 111532 KB Output is correct
63 Correct 170 ms 110400 KB Output is correct
64 Correct 143 ms 111296 KB Output is correct
65 Correct 176 ms 111296 KB Output is correct
66 Correct 155 ms 110152 KB Output is correct
67 Correct 119 ms 111332 KB Output is correct
68 Correct 129 ms 112244 KB Output is correct
69 Correct 116 ms 111376 KB Output is correct
70 Correct 145 ms 111812 KB Output is correct
71 Correct 114 ms 111260 KB Output is correct
72 Correct 313 ms 133432 KB Output is correct
73 Correct 684 ms 162888 KB Output is correct
74 Correct 702 ms 163312 KB Output is correct
75 Correct 706 ms 163432 KB Output is correct
76 Correct 735 ms 163260 KB Output is correct
77 Correct 674 ms 163112 KB Output is correct
78 Correct 697 ms 163008 KB Output is correct
79 Correct 658 ms 162716 KB Output is correct
80 Correct 724 ms 163012 KB Output is correct
81 Correct 681 ms 161744 KB Output is correct
82 Correct 680 ms 161444 KB Output is correct
83 Correct 671 ms 161920 KB Output is correct
84 Correct 682 ms 161160 KB Output is correct
85 Correct 676 ms 160596 KB Output is correct
86 Correct 725 ms 161452 KB Output is correct
87 Correct 678 ms 161988 KB Output is correct
88 Correct 683 ms 161852 KB Output is correct
89 Correct 200 ms 133856 KB Output is correct
90 Correct 672 ms 162148 KB Output is correct
91 Correct 458 ms 159052 KB Output is correct
92 Correct 171 ms 120924 KB Output is correct
93 Correct 250 ms 129356 KB Output is correct
94 Correct 160 ms 122476 KB Output is correct
95 Correct 162 ms 120900 KB Output is correct
96 Correct 228 ms 126520 KB Output is correct
97 Correct 207 ms 131560 KB Output is correct
98 Correct 173 ms 120764 KB Output is correct
99 Correct 251 ms 131396 KB Output is correct
100 Correct 160 ms 121024 KB Output is correct