oj.uz

Submission #682807

# Submission time Handle Problem Language Result Execution time Memory
682807 2023-01-17T03:53:58 Z iskhakkutbilim Evacuation plan (IZhO18_plan) C++14
10 / 100
 4000 ms 29296 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 1e5;
const int M = 1e9;
int n, m, k;
vector< pair<int, int> > g[N];

int AEC[N], distanc[N];
vector<int> A, B;
set< pair<int, int> > q;

void dijkstra(int start){
	vector<int> dis(n, M);
	dis[start] = 0;
	q.insert({dis[start], start});
	while(!q.empty()){
		int v = q.begin()->ss;
		q.erase(q.begin());
		for(auto [to, len] : g[v]){
			if(dis[to] > dis[v] + len){
				q.erase({dis[to], to});
				dis[to] = dis[v]+len;
				q.insert({dis[to], to});
				
				if(AEC[start]==0 and AEC[to] == 1){
					distanc[start] = min(distanc[start], dis[to]);
				}
				if(AEC[start]==1 and AEC[to] == 0){
					distanc[to] = min(distanc[to], dis[to]);
				}
			}
		}
	}
}


main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for(int i = 0;i < m; i++){
		int a, b, w; cin >> a >> b >> w;
		a--, b--;
		g[a].push_back({b, w});
		g[b].push_back({a, w});
	}
	cin >> k;
	for(int i = 0;i < k; i++){
		int a; cin >> a; a--;
		AEC[a] = 1;
	}
	for(int i = 0;i < n; i++){
		distanc[i] = M;
		if(AEC[i] == 0) B.push_back(i);
		else A.push_back(i);
	}
	if(k > (int)sqrt(n)){
		for(int start : B){
			dijkstra(start);
		}
	}else{
		for(int start : A){
			dijkstra(start);
		}
	}
	int Q; cin >> Q;
	while(Q--){
		int a, b; cin >> a >> b; a--, b--;
		if(AEC[a] == 1 or AEC[b] == 1){
			cout << 0 << '\n';
		}else{
			cout << min(distanc[a], distanc[b]) << '\n';
		}
	}
	return 0;
}

Compilation message

plan.cpp: In function 'void dijkstra(int)':
plan.cpp:24:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |   for(auto [to, len] : g[v]){
      |            ^
plan.cpp: At global scope:
plan.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 7 ms 2804 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 155 ms 2788 KB Output is correct
6 Correct 58 ms 2772 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 2 ms 2676 KB Output is correct
9 Correct 4 ms 2772 KB Output is correct
10 Correct 37 ms 2744 KB Output is correct
11 Correct 7 ms 2772 KB Output is correct
12 Correct 3 ms 2772 KB Output is correct
13 Correct 149 ms 2744 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 5 ms 2688 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 7 ms 2804 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 155 ms 2788 KB Output is correct
6 Correct 58 ms 2772 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 2 ms 2676 KB Output is correct
9 Correct 4 ms 2772 KB Output is correct
10 Correct 37 ms 2744 KB Output is correct
11 Correct 7 ms 2772 KB Output is correct
12 Correct 3 ms 2772 KB Output is correct
13 Correct 149 ms 2744 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 5 ms 2688 KB Output is correct
16 Correct 385 ms 11436 KB Output is correct
17 Correct 395 ms 29296 KB Output is correct
18 Correct 34 ms 4940 KB Output is correct
19 Correct 505 ms 15696 KB Output is correct
20 Correct 444 ms 29220 KB Output is correct
21 Execution timed out 4034 ms 16308 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 7 ms 2804 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 155 ms 2788 KB Output is correct
6 Correct 58 ms 2772 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 2 ms 2676 KB Output is correct
9 Correct 4 ms 2772 KB Output is correct
10 Correct 37 ms 2744 KB Output is correct
11 Correct 7 ms 2772 KB Output is correct
12 Correct 3 ms 2772 KB Output is correct
13 Correct 149 ms 2744 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 5 ms 2688 KB Output is correct
16 Correct 385 ms 11436 KB Output is correct
17 Correct 395 ms 29296 KB Output is correct
18 Correct 34 ms 4940 KB Output is correct
19 Correct 505 ms 15696 KB Output is correct
20 Correct 444 ms 29220 KB Output is correct
21 Execution timed out 4034 ms 16308 KB Time limit exceeded
22 Halted 0 ms 0 KB -