oj.uz

Submission #893872

# Submission time Handle Problem Language Result Execution time Memory
893872 2023-12-27T15:25:37 Z vjudge1 Evacuation plan (IZhO18_plan) C++17
100 / 100
 669 ms 97508 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 <= 35; 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;
//yo
    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 62044 KB Output is correct
2 Correct 12 ms 62336 KB Output is correct
3 Correct 14 ms 62300 KB Output is correct
4 Correct 12 ms 62040 KB Output is correct
5 Correct 12 ms 62300 KB Output is correct
6 Correct 14 ms 62152 KB Output is correct
7 Correct 12 ms 62044 KB Output is correct
8 Correct 12 ms 62044 KB Output is correct
9 Correct 14 ms 62300 KB Output is correct
10 Correct 13 ms 62300 KB Output is correct
11 Correct 14 ms 62368 KB Output is correct
12 Correct 13 ms 62452 KB Output is correct
13 Correct 13 ms 62300 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 62044 KB Output is correct
2 Correct 12 ms 62336 KB Output is correct
3 Correct 14 ms 62300 KB Output is correct
4 Correct 12 ms 62040 KB Output is correct
5 Correct 12 ms 62300 KB Output is correct
6 Correct 14 ms 62152 KB Output is correct
7 Correct 12 ms 62044 KB Output is correct
8 Correct 12 ms 62044 KB Output is correct
9 Correct 14 ms 62300 KB Output is correct
10 Correct 13 ms 62300 KB Output is correct
11 Correct 14 ms 62368 KB Output is correct
12 Correct 13 ms 62452 KB Output is correct
13 Correct 13 ms 62300 KB Output is correct
14 Correct 13 ms 62300 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct
16 Correct 213 ms 78532 KB Output is correct
17 Correct 543 ms 97416 KB Output is correct
18 Correct 50 ms 64852 KB Output is correct
19 Correct 147 ms 78716 KB Output is correct
20 Correct 515 ms 97372 KB Output is correct
21 Correct 256 ms 82228 KB Output is correct
22 Correct 235 ms 89416 KB Output is correct
23 Correct 513 ms 97508 KB Output is correct
24 Correct 558 ms 97492 KB Output is correct
25 Correct 550 ms 96848 KB Output is correct
26 Correct 167 ms 77768 KB Output is correct
27 Correct 149 ms 78808 KB Output is correct
28 Correct 148 ms 77680 KB Output is correct
29 Correct 145 ms 78328 KB Output is correct
30 Correct 146 ms 78868 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 62552 KB Output is correct
3 Correct 12 ms 62040 KB Output is correct
4 Correct 12 ms 62044 KB Output is correct
5 Correct 11 ms 62044 KB Output is correct
6 Correct 12 ms 62044 KB Output is correct
7 Correct 12 ms 62196 KB Output is correct
8 Correct 12 ms 62044 KB Output is correct
9 Correct 12 ms 62040 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 268 ms 76472 KB Output is correct
2 Correct 504 ms 90052 KB Output is correct
3 Correct 472 ms 90192 KB Output is correct
4 Correct 148 ms 77048 KB Output is correct
5 Correct 557 ms 89940 KB Output is correct
6 Correct 490 ms 90148 KB Output is correct
7 Correct 542 ms 90172 KB Output is correct
8 Correct 588 ms 90060 KB Output is correct
9 Correct 582 ms 90080 KB Output is correct
10 Correct 611 ms 90172 KB Output is correct
11 Correct 579 ms 90140 KB Output is correct
12 Correct 546 ms 90136 KB Output is correct
13 Correct 562 ms 89964 KB Output is correct
14 Correct 565 ms 89992 KB Output is correct
15 Correct 574 ms 90092 KB Output is correct
16 Correct 530 ms 90168 KB Output is correct
17 Correct 565 ms 90128 KB Output is correct
18 Correct 550 ms 90140 KB Output is correct
19 Correct 152 ms 77240 KB Output is correct
20 Correct 572 ms 89948 KB Output is correct
21 Correct 430 ms 90612 KB Output is correct
22 Correct 131 ms 74320 KB Output is correct
23 Correct 181 ms 74436 KB Output is correct
24 Correct 120 ms 74280 KB Output is correct
25 Correct 132 ms 74308 KB Output is correct
26 Correct 180 ms 72432 KB Output is correct
27 Correct 165 ms 77064 KB Output is correct
28 Correct 123 ms 74436 KB Output is correct
29 Correct 146 ms 77248 KB Output is correct
30 Correct 117 ms 74436 KB Output is correct
31 Correct 178 ms 77140 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 62044 KB Output is correct
2 Correct 12 ms 62336 KB Output is correct
3 Correct 14 ms 62300 KB Output is correct
4 Correct 12 ms 62040 KB Output is correct
5 Correct 12 ms 62300 KB Output is correct
6 Correct 14 ms 62152 KB Output is correct
7 Correct 12 ms 62044 KB Output is correct
8 Correct 12 ms 62044 KB Output is correct
9 Correct 14 ms 62300 KB Output is correct
10 Correct 13 ms 62300 KB Output is correct
11 Correct 14 ms 62368 KB Output is correct
12 Correct 13 ms 62452 KB Output is correct
13 Correct 13 ms 62300 KB Output is correct
14 Correct 13 ms 62300 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct
16 Correct 213 ms 78532 KB Output is correct
17 Correct 543 ms 97416 KB Output is correct
18 Correct 50 ms 64852 KB Output is correct
19 Correct 147 ms 78716 KB Output is correct
20 Correct 515 ms 97372 KB Output is correct
21 Correct 256 ms 82228 KB Output is correct
22 Correct 235 ms 89416 KB Output is correct
23 Correct 513 ms 97508 KB Output is correct
24 Correct 558 ms 97492 KB Output is correct
25 Correct 550 ms 96848 KB Output is correct
26 Correct 167 ms 77768 KB Output is correct
27 Correct 149 ms 78808 KB Output is correct
28 Correct 148 ms 77680 KB Output is correct
29 Correct 145 ms 78328 KB Output is correct
30 Correct 146 ms 78868 KB Output is correct
31 Correct 11 ms 62040 KB Output is correct
32 Correct 12 ms 62552 KB Output is correct
33 Correct 12 ms 62040 KB Output is correct
34 Correct 12 ms 62044 KB Output is correct
35 Correct 11 ms 62044 KB Output is correct
36 Correct 12 ms 62044 KB Output is correct
37 Correct 12 ms 62196 KB Output is correct
38 Correct 12 ms 62044 KB Output is correct
39 Correct 12 ms 62040 KB Output is correct
40 Correct 11 ms 62044 KB Output is correct
41 Correct 268 ms 76472 KB Output is correct
42 Correct 504 ms 90052 KB Output is correct
43 Correct 472 ms 90192 KB Output is correct
44 Correct 148 ms 77048 KB Output is correct
45 Correct 557 ms 89940 KB Output is correct
46 Correct 490 ms 90148 KB Output is correct
47 Correct 542 ms 90172 KB Output is correct
48 Correct 588 ms 90060 KB Output is correct
49 Correct 582 ms 90080 KB Output is correct
50 Correct 611 ms 90172 KB Output is correct
51 Correct 579 ms 90140 KB Output is correct
52 Correct 546 ms 90136 KB Output is correct
53 Correct 562 ms 89964 KB Output is correct
54 Correct 565 ms 89992 KB Output is correct
55 Correct 574 ms 90092 KB Output is correct
56 Correct 530 ms 90168 KB Output is correct
57 Correct 565 ms 90128 KB Output is correct
58 Correct 550 ms 90140 KB Output is correct
59 Correct 152 ms 77240 KB Output is correct
60 Correct 572 ms 89948 KB Output is correct
61 Correct 430 ms 90612 KB Output is correct
62 Correct 131 ms 74320 KB Output is correct
63 Correct 181 ms 74436 KB Output is correct
64 Correct 120 ms 74280 KB Output is correct
65 Correct 132 ms 74308 KB Output is correct
66 Correct 180 ms 72432 KB Output is correct
67 Correct 165 ms 77064 KB Output is correct
68 Correct 123 ms 74436 KB Output is correct
69 Correct 146 ms 77248 KB Output is correct
70 Correct 117 ms 74436 KB Output is correct
71 Correct 178 ms 77140 KB Output is correct
72 Correct 384 ms 83300 KB Output is correct
73 Correct 639 ms 96252 KB Output is correct
74 Correct 585 ms 96364 KB Output is correct
75 Correct 594 ms 96204 KB Output is correct
76 Correct 634 ms 96092 KB Output is correct
77 Correct 628 ms 96220 KB Output is correct
78 Correct 669 ms 96160 KB Output is correct
79 Correct 583 ms 96024 KB Output is correct
80 Correct 608 ms 96264 KB Output is correct
81 Correct 634 ms 96208 KB Output is correct
82 Correct 668 ms 96076 KB Output is correct
83 Correct 534 ms 96300 KB Output is correct
84 Correct 555 ms 96008 KB Output is correct
85 Correct 526 ms 95876 KB Output is correct
86 Correct 561 ms 95856 KB Output is correct
87 Correct 560 ms 96488 KB Output is correct
88 Correct 544 ms 96128 KB Output is correct
89 Correct 240 ms 89168 KB Output is correct
90 Correct 552 ms 96232 KB Output is correct
91 Correct 374 ms 95032 KB Output is correct
92 Correct 179 ms 78316 KB Output is correct
93 Correct 250 ms 84040 KB Output is correct
94 Correct 148 ms 78024 KB Output is correct
95 Correct 167 ms 78020 KB Output is correct
96 Correct 219 ms 79880 KB Output is correct
97 Correct 247 ms 87904 KB Output is correct
98 Correct 161 ms 77636 KB Output is correct
99 Correct 218 ms 87788 KB Output is correct
100 Correct 160 ms 77504 KB Output is correct