oj.uz

Submission #893750

# Submission time Handle Problem Language Result Execution time Memory
893750 2023-12-27T10:50:32 Z vjudge1 Evacuation plan (IZhO18_plan) C++17
100 / 100
 501 ms 89032 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")


typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back

const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(6e5)+100;
const long long inf = 2e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }

ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}


void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, m, k, q, qu[N], qv[N], qw[N], par[N], qs[N], qt[N], siz[N], dis[N], bl[N], br[N];
vector<int> pos[N];
vector<int> check[N];
vector<pair<int, int> > g[N];
vector<int> nuc;

int findpar(int v) {
	if(v == par[v]) return v;
	return par[v] = findpar(par[v]);
}

void combine(int a, int b) {
	a = findpar(a);
	b = findpar(b);
	if(a != b) {
		if(siz[a] < siz[b]) swap(a, b);
		par[b] = a;
		siz[a] += siz[b];
	}
}

void Baizho() {	
	cin>>n>>m;
	for(int i = 1; i <= m; i ++) {
		cin>>qu[i]>>qv[i]>>qw[i];
		g[qu[i]].pb({qv[i], qw[i]});
		g[qv[i]].pb({qu[i], qw[i]});
	}
	for(int i = 1; i <= n; i ++) {
		dis[i] = 2e9;
	}
	cin>>k;
	set<pair<int, int> > st;
	for(int i = 1; i <= k; i ++) {
		int x; cin>>x;
		nuc.pb(x);
		dis[x] = 0;
		st.insert({dis[x], x});
	}
	while(!st.empty()) {
		int v = (*st.begin()).ss;
		st.erase(st.begin());
		for(auto to : g[v]) {
			if(dis[to.ff] > dis[v] + to.ss) {
				if(dis[to.ff] != 2e9) st.erase({dis[to.ff], to.ff});
				dis[to.ff] = dis[v] + to.ss;
				st.insert({dis[to.ff], to.ff});
			}
		}
	}
	vector<int> comp;
	map<int, int> rev;
	for(int i = 1; i <= n; i ++) {
		comp.pb(dis[i]);
	}
	sort(all(comp));
	comp.erase(unique(all(comp)), comp.end());
	for(int i = 1; i <= n;  i ++) {
		int orig = dis[i];
		dis[i] = upper_bound(all(comp), dis[i]) - comp.begin();
		rev[dis[i]] = orig;
//		cout<<dis[i]<<" ";
	}
//	cout<<"\n";
	for(int i = 1; i <= m; i ++) {
		pos[min(dis[qu[i]], dis[qv[i]])].pb(i);
	}
	cin>>q;
	for(int i = 1; i <= q; i ++) {
		cin>>qs[i]>>qt[i];
		bl[i] = 1, br[i] = comp.sz;
//		int l = 1, r = comp.sz;
//		while(l <= r) {
//			int mid = (l + r) / 2;
//			for(int j = 0; j <= n; j ++) {
//				par[j] = j;
//				siz[j] = 1;
//				ok[j] = 0;
//			}
//			for(int j = 1; j <= n; j ++) {
//				if(dis[j] >= mid) ok[j] = 1;
//			}
//			for(int j = 1; j <= m; j ++) {
//				if(ok[qu[j]] && ok[qv[j]]) combine(qu[j], qv[j]);
// 				dis[qu[j]] >= mid && dis[qv[j]] >= mid
//				min() >= mid
//			}
//			if(findpar(qs[i]) == findpar(qt[i])) l = mid + 1;
//			else r = mid - 1;
//		}
//		cout<<rev[l - 1]<<"\n";
	}
	for(int bin = 0; bin <= 20; bin ++) {
		for(int j = 0; j <= n; j ++) {
			par[j] = j;
			siz[j] = 1;
			check[j].clear();
		}
		for(int i = 1; i <= q; i ++) {
			if(bl[i] <= br[i]) {
				check[(bl[i] + br[i]) / 2].pb(i);
//				cout<<i<<" "<<bl[i]<<br[i]<<"OLOY \n";
			}
		}
		for(int i = comp.sz; i >= 1; i --) {
			for(auto j : pos[i]) {
				combine(qu[j], qv[j]);
//				cout<<j<<" "<<i<<" "<<qu[j]<<" "<<qv[j]<<"\n";
			}
			for(auto j : check[i]) {
				if(findpar(qs[j]) == findpar(qt[j])) {
					bl[j] = i + 1;
//					cout<<j<<" "<<i<<"\n";
				}
				else br[j] = i - 1;
			}
		}
	}
	for(int i = 1; i <= q; i ++) cout<<rev[bl[i] - 1]<<"\n";
}
 
signed main() {		
 
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 62040 KB Output is correct
2 Correct 12 ms 62300 KB Output is correct
3 Correct 12 ms 62300 KB Output is correct
4 Correct 12 ms 62040 KB Output is correct
5 Correct 15 ms 62308 KB Output is correct
6 Correct 12 ms 62040 KB Output is correct
7 Correct 11 ms 62044 KB Output is correct
8 Correct 11 ms 62044 KB Output is correct
9 Correct 13 ms 62300 KB Output is correct
10 Correct 12 ms 62044 KB Output is correct
11 Correct 13 ms 62296 KB Output is correct
12 Correct 13 ms 62176 KB Output is correct
13 Correct 13 ms 62108 KB Output is correct
14 Correct 13 ms 62300 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 62040 KB Output is correct
2 Correct 12 ms 62300 KB Output is correct
3 Correct 12 ms 62300 KB Output is correct
4 Correct 12 ms 62040 KB Output is correct
5 Correct 15 ms 62308 KB Output is correct
6 Correct 12 ms 62040 KB Output is correct
7 Correct 11 ms 62044 KB Output is correct
8 Correct 11 ms 62044 KB Output is correct
9 Correct 13 ms 62300 KB Output is correct
10 Correct 12 ms 62044 KB Output is correct
11 Correct 13 ms 62296 KB Output is correct
12 Correct 13 ms 62176 KB Output is correct
13 Correct 13 ms 62108 KB Output is correct
14 Correct 13 ms 62300 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct
16 Correct 177 ms 75720 KB Output is correct
17 Correct 444 ms 88908 KB Output is correct
18 Correct 46 ms 64092 KB Output is correct
19 Correct 125 ms 75976 KB Output is correct
20 Correct 416 ms 88648 KB Output is correct
21 Correct 229 ms 77620 KB Output is correct
22 Correct 214 ms 86504 KB Output is correct
23 Correct 462 ms 89032 KB Output is correct
24 Correct 432 ms 88804 KB Output is correct
25 Correct 435 ms 88256 KB Output is correct
26 Correct 125 ms 74948 KB Output is correct
27 Correct 123 ms 75712 KB Output is correct
28 Correct 135 ms 75140 KB Output is correct
29 Correct 121 ms 75532 KB Output is correct
30 Correct 122 ms 75928 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 62040 KB Output is correct
2 Correct 12 ms 62040 KB Output is correct
3 Correct 12 ms 62044 KB Output is correct
4 Correct 11 ms 62044 KB Output is correct
5 Correct 11 ms 62120 KB Output is correct
6 Correct 12 ms 62044 KB Output is correct
7 Correct 11 ms 62044 KB Output is correct
8 Correct 12 ms 62172 KB Output is correct
9 Correct 12 ms 62044 KB Output is correct
10 Correct 11 ms 62044 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 73300 KB Output is correct
2 Correct 403 ms 83248 KB Output is correct
3 Correct 410 ms 83428 KB Output is correct
4 Correct 117 ms 75500 KB Output is correct
5 Correct 389 ms 83520 KB Output is correct
6 Correct 409 ms 83428 KB Output is correct
7 Correct 374 ms 83444 KB Output is correct
8 Correct 396 ms 83696 KB Output is correct
9 Correct 406 ms 83504 KB Output is correct
10 Correct 377 ms 84052 KB Output is correct
11 Correct 390 ms 83432 KB Output is correct
12 Correct 399 ms 83292 KB Output is correct
13 Correct 421 ms 83240 KB Output is correct
14 Correct 425 ms 83488 KB Output is correct
15 Correct 390 ms 83256 KB Output is correct
16 Correct 405 ms 83380 KB Output is correct
17 Correct 375 ms 83280 KB Output is correct
18 Correct 372 ms 83368 KB Output is correct
19 Correct 115 ms 75608 KB Output is correct
20 Correct 410 ms 83704 KB Output is correct
21 Correct 279 ms 83312 KB Output is correct
22 Correct 97 ms 72644 KB Output is correct
23 Correct 150 ms 72868 KB Output is correct
24 Correct 117 ms 72700 KB Output is correct
25 Correct 98 ms 72648 KB Output is correct
26 Correct 130 ms 70784 KB Output is correct
27 Correct 120 ms 75680 KB Output is correct
28 Correct 100 ms 72692 KB Output is correct
29 Correct 116 ms 75448 KB Output is correct
30 Correct 100 ms 72644 KB Output is correct
31 Correct 132 ms 75556 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 62040 KB Output is correct
2 Correct 12 ms 62300 KB Output is correct
3 Correct 12 ms 62300 KB Output is correct
4 Correct 12 ms 62040 KB Output is correct
5 Correct 15 ms 62308 KB Output is correct
6 Correct 12 ms 62040 KB Output is correct
7 Correct 11 ms 62044 KB Output is correct
8 Correct 11 ms 62044 KB Output is correct
9 Correct 13 ms 62300 KB Output is correct
10 Correct 12 ms 62044 KB Output is correct
11 Correct 13 ms 62296 KB Output is correct
12 Correct 13 ms 62176 KB Output is correct
13 Correct 13 ms 62108 KB Output is correct
14 Correct 13 ms 62300 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct
16 Correct 177 ms 75720 KB Output is correct
17 Correct 444 ms 88908 KB Output is correct
18 Correct 46 ms 64092 KB Output is correct
19 Correct 125 ms 75976 KB Output is correct
20 Correct 416 ms 88648 KB Output is correct
21 Correct 229 ms 77620 KB Output is correct
22 Correct 214 ms 86504 KB Output is correct
23 Correct 462 ms 89032 KB Output is correct
24 Correct 432 ms 88804 KB Output is correct
25 Correct 435 ms 88256 KB Output is correct
26 Correct 125 ms 74948 KB Output is correct
27 Correct 123 ms 75712 KB Output is correct
28 Correct 135 ms 75140 KB Output is correct
29 Correct 121 ms 75532 KB Output is correct
30 Correct 122 ms 75928 KB Output is correct
31 Correct 11 ms 62040 KB Output is correct
32 Correct 12 ms 62040 KB Output is correct
33 Correct 12 ms 62044 KB Output is correct
34 Correct 11 ms 62044 KB Output is correct
35 Correct 11 ms 62120 KB Output is correct
36 Correct 12 ms 62044 KB Output is correct
37 Correct 11 ms 62044 KB Output is correct
38 Correct 12 ms 62172 KB Output is correct
39 Correct 12 ms 62044 KB Output is correct
40 Correct 11 ms 62044 KB Output is correct
41 Correct 210 ms 73300 KB Output is correct
42 Correct 403 ms 83248 KB Output is correct
43 Correct 410 ms 83428 KB Output is correct
44 Correct 117 ms 75500 KB Output is correct
45 Correct 389 ms 83520 KB Output is correct
46 Correct 409 ms 83428 KB Output is correct
47 Correct 374 ms 83444 KB Output is correct
48 Correct 396 ms 83696 KB Output is correct
49 Correct 406 ms 83504 KB Output is correct
50 Correct 377 ms 84052 KB Output is correct
51 Correct 390 ms 83432 KB Output is correct
52 Correct 399 ms 83292 KB Output is correct
53 Correct 421 ms 83240 KB Output is correct
54 Correct 425 ms 83488 KB Output is correct
55 Correct 390 ms 83256 KB Output is correct
56 Correct 405 ms 83380 KB Output is correct
57 Correct 375 ms 83280 KB Output is correct
58 Correct 372 ms 83368 KB Output is correct
59 Correct 115 ms 75608 KB Output is correct
60 Correct 410 ms 83704 KB Output is correct
61 Correct 279 ms 83312 KB Output is correct
62 Correct 97 ms 72644 KB Output is correct
63 Correct 150 ms 72868 KB Output is correct
64 Correct 117 ms 72700 KB Output is correct
65 Correct 98 ms 72648 KB Output is correct
66 Correct 130 ms 70784 KB Output is correct
67 Correct 120 ms 75680 KB Output is correct
68 Correct 100 ms 72692 KB Output is correct
69 Correct 116 ms 75448 KB Output is correct
70 Correct 100 ms 72644 KB Output is correct
71 Correct 132 ms 75556 KB Output is correct
72 Correct 249 ms 79032 KB Output is correct
73 Correct 431 ms 88772 KB Output is correct
74 Correct 437 ms 88592 KB Output is correct
75 Correct 449 ms 88760 KB Output is correct
76 Correct 457 ms 88784 KB Output is correct
77 Correct 501 ms 88856 KB Output is correct
78 Correct 438 ms 88632 KB Output is correct
79 Correct 425 ms 88608 KB Output is correct
80 Correct 432 ms 88860 KB Output is correct
81 Correct 415 ms 88768 KB Output is correct
82 Correct 496 ms 88596 KB Output is correct
83 Correct 438 ms 88776 KB Output is correct
84 Correct 406 ms 88276 KB Output is correct
85 Correct 421 ms 88280 KB Output is correct
86 Correct 449 ms 88400 KB Output is correct
87 Correct 452 ms 88776 KB Output is correct
88 Correct 443 ms 88780 KB Output is correct
89 Correct 202 ms 86468 KB Output is correct
90 Correct 408 ms 88788 KB Output is correct
91 Correct 303 ms 87468 KB Output is correct
92 Correct 129 ms 75672 KB Output is correct
93 Correct 231 ms 81584 KB Output is correct
94 Correct 119 ms 75296 KB Output is correct
95 Correct 125 ms 75460 KB Output is correct
96 Correct 179 ms 77316 KB Output is correct
97 Correct 188 ms 85432 KB Output is correct
98 Correct 124 ms 75236 KB Output is correct
99 Correct 191 ms 85564 KB Output is correct
100 Correct 121 ms 75040 KB Output is correct