oj.uz

답안 #893747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893747 2023-12-27T10:49:19 Z vjudge1 Evacuation plan (IZhO18_plan) C++17
100 / 100
 540 ms 98480 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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 62296 KB Output is correct
2 Correct 14 ms 62300 KB Output is correct
3 Correct 13 ms 62300 KB Output is correct
4 Correct 14 ms 62184 KB Output is correct
5 Correct 12 ms 62300 KB Output is correct
6 Correct 12 ms 62044 KB Output is correct
7 Correct 12 ms 62040 KB Output is correct
8 Correct 12 ms 62040 KB Output is correct
9 Correct 13 ms 62300 KB Output is correct
10 Correct 16 ms 62292 KB Output is correct
11 Correct 13 ms 62300 KB Output is correct
12 Correct 13 ms 62160 KB Output is correct
13 Correct 14 ms 62300 KB Output is correct
14 Correct 13 ms 62296 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 62296 KB Output is correct
2 Correct 14 ms 62300 KB Output is correct
3 Correct 13 ms 62300 KB Output is correct
4 Correct 14 ms 62184 KB Output is correct
5 Correct 12 ms 62300 KB Output is correct
6 Correct 12 ms 62044 KB Output is correct
7 Correct 12 ms 62040 KB Output is correct
8 Correct 12 ms 62040 KB Output is correct
9 Correct 13 ms 62300 KB Output is correct
10 Correct 16 ms 62292 KB Output is correct
11 Correct 13 ms 62300 KB Output is correct
12 Correct 13 ms 62160 KB Output is correct
13 Correct 14 ms 62300 KB Output is correct
14 Correct 13 ms 62296 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct
16 Correct 193 ms 75724 KB Output is correct
17 Correct 457 ms 88708 KB Output is correct
18 Correct 44 ms 64080 KB Output is correct
19 Correct 128 ms 75972 KB Output is correct
20 Correct 517 ms 88836 KB Output is correct
21 Correct 217 ms 77652 KB Output is correct
22 Correct 229 ms 86344 KB Output is correct
23 Correct 455 ms 88768 KB Output is correct
24 Correct 445 ms 88616 KB Output is correct
25 Correct 501 ms 88308 KB Output is correct
26 Correct 130 ms 74816 KB Output is correct
27 Correct 129 ms 75900 KB Output is correct
28 Correct 133 ms 74840 KB Output is correct
29 Correct 159 ms 75512 KB Output is correct
30 Correct 130 ms 75944 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 73300 KB Output is correct
2 Correct 464 ms 83396 KB Output is correct
3 Correct 418 ms 83284 KB Output is correct
4 Correct 129 ms 75384 KB Output is correct
5 Correct 415 ms 83404 KB Output is correct
6 Correct 435 ms 83588 KB Output is correct
7 Correct 391 ms 83288 KB Output is correct
8 Correct 414 ms 83480 KB Output is correct
9 Correct 453 ms 83508 KB Output is correct
10 Correct 385 ms 83324 KB Output is correct
11 Correct 378 ms 83280 KB Output is correct
12 Correct 511 ms 83532 KB Output is correct
13 Correct 483 ms 83460 KB Output is correct
14 Correct 447 ms 83248 KB Output is correct
15 Correct 479 ms 83232 KB Output is correct
16 Correct 476 ms 83508 KB Output is correct
17 Correct 478 ms 83348 KB Output is correct
18 Correct 448 ms 83604 KB Output is correct
19 Correct 159 ms 75456 KB Output is correct
20 Correct 507 ms 83356 KB Output is correct
21 Correct 355 ms 83384 KB Output is correct
22 Correct 121 ms 72776 KB Output is correct
23 Correct 149 ms 72904 KB Output is correct
24 Correct 107 ms 72644 KB Output is correct
25 Correct 102 ms 72860 KB Output is correct
26 Correct 147 ms 70620 KB Output is correct
27 Correct 124 ms 75424 KB Output is correct
28 Correct 106 ms 72804 KB Output is correct
29 Correct 122 ms 75384 KB Output is correct
30 Correct 111 ms 72644 KB Output is correct
31 Correct 144 ms 75468 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 62296 KB Output is correct
2 Correct 14 ms 62300 KB Output is correct
3 Correct 13 ms 62300 KB Output is correct
4 Correct 14 ms 62184 KB Output is correct
5 Correct 12 ms 62300 KB Output is correct
6 Correct 12 ms 62044 KB Output is correct
7 Correct 12 ms 62040 KB Output is correct
8 Correct 12 ms 62040 KB Output is correct
9 Correct 13 ms 62300 KB Output is correct
10 Correct 16 ms 62292 KB Output is correct
11 Correct 13 ms 62300 KB Output is correct
12 Correct 13 ms 62160 KB Output is correct
13 Correct 14 ms 62300 KB Output is correct
14 Correct 13 ms 62296 KB Output is correct
15 Correct 13 ms 62300 KB Output is correct
16 Correct 193 ms 75724 KB Output is correct
17 Correct 457 ms 88708 KB Output is correct
18 Correct 44 ms 64080 KB Output is correct
19 Correct 128 ms 75972 KB Output is correct
20 Correct 517 ms 88836 KB Output is correct
21 Correct 217 ms 77652 KB Output is correct
22 Correct 229 ms 86344 KB Output is correct
23 Correct 455 ms 88768 KB Output is correct
24 Correct 445 ms 88616 KB Output is correct
25 Correct 501 ms 88308 KB Output is correct
26 Correct 130 ms 74816 KB Output is correct
27 Correct 129 ms 75900 KB Output is correct
28 Correct 133 ms 74840 KB Output is correct
29 Correct 159 ms 75512 KB Output is correct
30 Correct 130 ms 75944 KB Output is correct
31 Correct 12 ms 62040 KB Output is correct
32 Correct 12 ms 62144 KB Output is correct
33 Correct 12 ms 62040 KB Output is correct
34 Correct 11 ms 62044 KB Output is correct
35 Correct 12 ms 62044 KB Output is correct
36 Correct 12 ms 62044 KB Output is correct
37 Correct 12 ms 62044 KB Output is correct
38 Correct 11 ms 62176 KB Output is correct
39 Correct 11 ms 62040 KB Output is correct
40 Correct 12 ms 62044 KB Output is correct
41 Correct 226 ms 73300 KB Output is correct
42 Correct 464 ms 83396 KB Output is correct
43 Correct 418 ms 83284 KB Output is correct
44 Correct 129 ms 75384 KB Output is correct
45 Correct 415 ms 83404 KB Output is correct
46 Correct 435 ms 83588 KB Output is correct
47 Correct 391 ms 83288 KB Output is correct
48 Correct 414 ms 83480 KB Output is correct
49 Correct 453 ms 83508 KB Output is correct
50 Correct 385 ms 83324 KB Output is correct
51 Correct 378 ms 83280 KB Output is correct
52 Correct 511 ms 83532 KB Output is correct
53 Correct 483 ms 83460 KB Output is correct
54 Correct 447 ms 83248 KB Output is correct
55 Correct 479 ms 83232 KB Output is correct
56 Correct 476 ms 83508 KB Output is correct
57 Correct 478 ms 83348 KB Output is correct
58 Correct 448 ms 83604 KB Output is correct
59 Correct 159 ms 75456 KB Output is correct
60 Correct 507 ms 83356 KB Output is correct
61 Correct 355 ms 83384 KB Output is correct
62 Correct 121 ms 72776 KB Output is correct
63 Correct 149 ms 72904 KB Output is correct
64 Correct 107 ms 72644 KB Output is correct
65 Correct 102 ms 72860 KB Output is correct
66 Correct 147 ms 70620 KB Output is correct
67 Correct 124 ms 75424 KB Output is correct
68 Correct 106 ms 72804 KB Output is correct
69 Correct 122 ms 75384 KB Output is correct
70 Correct 111 ms 72644 KB Output is correct
71 Correct 144 ms 75468 KB Output is correct
72 Correct 305 ms 78948 KB Output is correct
73 Correct 507 ms 98112 KB Output is correct
74 Correct 540 ms 97992 KB Output is correct
75 Correct 464 ms 98072 KB Output is correct
76 Correct 456 ms 98480 KB Output is correct
77 Correct 478 ms 98248 KB Output is correct
78 Correct 453 ms 97952 KB Output is correct
79 Correct 467 ms 98016 KB Output is correct
80 Correct 429 ms 98104 KB Output is correct
81 Correct 475 ms 97988 KB Output is correct
82 Correct 465 ms 98388 KB Output is correct
83 Correct 431 ms 98068 KB Output is correct
84 Correct 474 ms 97724 KB Output is correct
85 Correct 457 ms 97576 KB Output is correct
86 Correct 444 ms 97984 KB Output is correct
87 Correct 471 ms 98000 KB Output is correct
88 Correct 431 ms 98048 KB Output is correct
89 Correct 215 ms 89516 KB Output is correct
90 Correct 448 ms 98004 KB Output is correct
91 Correct 353 ms 97440 KB Output is correct
92 Correct 129 ms 78788 KB Output is correct
93 Correct 232 ms 84292 KB Output is correct
94 Correct 134 ms 78224 KB Output is correct
95 Correct 131 ms 78296 KB Output is correct
96 Correct 184 ms 80096 KB Output is correct
97 Correct 203 ms 88108 KB Output is correct
98 Correct 127 ms 77920 KB Output is correct
99 Correct 192 ms 88184 KB Output is correct
100 Correct 133 ms 77976 KB Output is correct