oj.uz

Submission #893440

# Submission time Handle Problem Language Result Execution time Memory
893440 2023-12-27T04:54:13 Z vjudge1 Evacuation plan (IZhO18_plan) C++17
41 / 100
 4000 ms 55188 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(5e5)+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], ok[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});
			}
		}
	}
//	for(int i = 1; i <= n; i ++) cout<<dis[i]<<" ";
//	cout<<"\n";
	cin>>q;
	for(int i = 1; i <= q; i ++) {
		cin>>qs[i]>>qt[i];
		int l = 0, r = 2e9;
		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]);
			}
			if(findpar(qs[i]) == findpar(qt[i])) l = mid + 1;
			else r = mid - 1;
		}
		cout<<l - 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 5 ms 29276 KB Output is correct
2 Correct 101 ms 29444 KB Output is correct
3 Correct 88 ms 29272 KB Output is correct
4 Correct 5 ms 29276 KB Output is correct
5 Correct 82 ms 29276 KB Output is correct
6 Correct 81 ms 29440 KB Output is correct
7 Correct 5 ms 29280 KB Output is correct
8 Correct 5 ms 29280 KB Output is correct
9 Correct 134 ms 29536 KB Output is correct
10 Correct 76 ms 29276 KB Output is correct
11 Correct 129 ms 29416 KB Output is correct
12 Correct 90 ms 29288 KB Output is correct
13 Correct 132 ms 29668 KB Output is correct
14 Correct 142 ms 29412 KB Output is correct
15 Correct 127 ms 29288 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 29276 KB Output is correct
2 Correct 101 ms 29444 KB Output is correct
3 Correct 88 ms 29272 KB Output is correct
4 Correct 5 ms 29276 KB Output is correct
5 Correct 82 ms 29276 KB Output is correct
6 Correct 81 ms 29440 KB Output is correct
7 Correct 5 ms 29280 KB Output is correct
8 Correct 5 ms 29280 KB Output is correct
9 Correct 134 ms 29536 KB Output is correct
10 Correct 76 ms 29276 KB Output is correct
11 Correct 129 ms 29416 KB Output is correct
12 Correct 90 ms 29288 KB Output is correct
13 Correct 132 ms 29668 KB Output is correct
14 Correct 142 ms 29412 KB Output is correct
15 Correct 127 ms 29288 KB Output is correct
16 Execution timed out 4038 ms 35576 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 29276 KB Output is correct
2 Correct 5 ms 29360 KB Output is correct
3 Correct 5 ms 29332 KB Output is correct
4 Correct 5 ms 29276 KB Output is correct
5 Correct 5 ms 29276 KB Output is correct
6 Correct 5 ms 29276 KB Output is correct
7 Correct 5 ms 29276 KB Output is correct
8 Correct 4 ms 29272 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 5 ms 29324 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 37600 KB Output is correct
2 Correct 334 ms 53796 KB Output is correct
3 Correct 364 ms 54100 KB Output is correct
4 Correct 61 ms 34116 KB Output is correct
5 Correct 313 ms 53808 KB Output is correct
6 Correct 347 ms 53772 KB Output is correct
7 Correct 339 ms 53952 KB Output is correct
8 Correct 332 ms 53920 KB Output is correct
9 Correct 320 ms 53844 KB Output is correct
10 Correct 348 ms 54028 KB Output is correct
11 Correct 330 ms 53844 KB Output is correct
12 Correct 349 ms 53840 KB Output is correct
13 Correct 353 ms 53684 KB Output is correct
14 Correct 355 ms 53848 KB Output is correct
15 Correct 334 ms 54072 KB Output is correct
16 Correct 367 ms 54144 KB Output is correct
17 Correct 319 ms 53928 KB Output is correct
18 Correct 347 ms 53940 KB Output is correct
19 Correct 45 ms 33872 KB Output is correct
20 Correct 338 ms 53840 KB Output is correct
21 Correct 316 ms 55188 KB Output is correct
22 Correct 68 ms 39520 KB Output is correct
23 Correct 74 ms 34636 KB Output is correct
24 Correct 66 ms 39508 KB Output is correct
25 Correct 75 ms 39624 KB Output is correct
26 Correct 69 ms 34900 KB Output is correct
27 Correct 61 ms 33968 KB Output is correct
28 Correct 67 ms 39368 KB Output is correct
29 Correct 58 ms 33872 KB Output is correct
30 Correct 82 ms 39692 KB Output is correct
31 Correct 59 ms 33876 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 29276 KB Output is correct
2 Correct 101 ms 29444 KB Output is correct
3 Correct 88 ms 29272 KB Output is correct
4 Correct 5 ms 29276 KB Output is correct
5 Correct 82 ms 29276 KB Output is correct
6 Correct 81 ms 29440 KB Output is correct
7 Correct 5 ms 29280 KB Output is correct
8 Correct 5 ms 29280 KB Output is correct
9 Correct 134 ms 29536 KB Output is correct
10 Correct 76 ms 29276 KB Output is correct
11 Correct 129 ms 29416 KB Output is correct
12 Correct 90 ms 29288 KB Output is correct
13 Correct 132 ms 29668 KB Output is correct
14 Correct 142 ms 29412 KB Output is correct
15 Correct 127 ms 29288 KB Output is correct
16 Execution timed out 4038 ms 35576 KB Time limit exceeded
17 Halted 0 ms 0 KB -