oj.uz

Submission #667852

# Submission time Handle Problem Language Result Execution time Memory
667852 2022-12-02T07:16:56 Z Kaztaev_Alisher Evacuation plan (IZhO18_plan) C++17
35 / 100
 465 ms 31896 KB 
//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long  , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x  << " = " << x << endl;
#define int ll
 
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;
 
const ll N = 1e5+5;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;
 
using namespace std;
 
ll n , m , q;
ll dp[N];
vector<pll> g[N];
 
void bfs(){
	set<pll> st;
	int k;
	cin >> k;
	for(int i = 1; i <= n; i++) dp[i] = inf;
	for(int i = 1; i <= k; i++) {
		int u;
		cin >> u;
		dp[u] = 0;
		st.ins({0 , u});
	}
	while(st.sz()){
		int v = st.begin()->S;
		st.ers(st.begin());
		for(pii to : g[v]){
			if(dp[to.F] > dp[v]+to.S){
				st.ers({dp[to.F] , to.F});
				dp[to.F] = dp[v]+to.S;
				st.ins({dp[to.F] , to.F});
			}
		}
	}
}
ll road[20][20];
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		int a, b , c;
		cin >> a>> b >> c;
		g[a].pb({b , c});
		g[b].pb({a , c});
	}
	bfs();
	if(n <= 15){
		cin >> q;
		for(int i = 1; i <= n; i++){
			road[i][i] = dp[i];
			set<pll> st;
			st.ins({road[i][i] , i});
			while(st.sz()){
				pll v = *st.begin();
				st.ers(st.begin());
				for(pll to : g[v.S]){
					if(road[i][to.F] < min(road[i][v.S] , dp[to.F])){
						st.ers({road[i][to.F] , to.F});	
						road[i][to.F] = min(road[i][v.S] , dp[to.F]);
						st.ins({road[i][to.F] , to.F});
					}
				}
			}
		}
		while(q--){
			int u , v;
			cin >> u >> v;
			cout << road[u][v] <<"\n";
		}
	} else {
		cin >> q;
		while(q--){
			int u , v;
			cin >> u >> v;
			cout << min(dp[v] , dp[u]) <<"\n";
		}
	}
}
signed main(){
	ios;
	solve();
	return 0;
}
/*
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 93 ms 10236 KB Output is correct
17 Correct 465 ms 31828 KB Output is correct
18 Correct 24 ms 5204 KB Output is correct
19 Correct 96 ms 14860 KB Output is correct
20 Correct 428 ms 31860 KB Output is correct
21 Correct 201 ms 17872 KB Output is correct
22 Correct 64 ms 8972 KB Output is correct
23 Correct 431 ms 31896 KB Output is correct
24 Correct 429 ms 31820 KB Output is correct
25 Correct 429 ms 31580 KB Output is correct
26 Correct 95 ms 14520 KB Output is correct
27 Correct 97 ms 14696 KB Output is correct
28 Correct 94 ms 14476 KB Output is correct
29 Correct 95 ms 14596 KB Output is correct
30 Correct 94 ms 14740 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 168 ms 16260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 93 ms 10236 KB Output is correct
17 Correct 465 ms 31828 KB Output is correct
18 Correct 24 ms 5204 KB Output is correct
19 Correct 96 ms 14860 KB Output is correct
20 Correct 428 ms 31860 KB Output is correct
21 Correct 201 ms 17872 KB Output is correct
22 Correct 64 ms 8972 KB Output is correct
23 Correct 431 ms 31896 KB Output is correct
24 Correct 429 ms 31820 KB Output is correct
25 Correct 429 ms 31580 KB Output is correct
26 Correct 95 ms 14520 KB Output is correct
27 Correct 97 ms 14696 KB Output is correct
28 Correct 94 ms 14476 KB Output is correct
29 Correct 95 ms 14596 KB Output is correct
30 Correct 94 ms 14740 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Incorrect 168 ms 16260 KB Output isn't correct
42 Halted 0 ms 0 KB -