oj.uz

Submission #714740

# Submission time Handle Problem Language Result Execution time Memory
714740 2023-03-25T08:50:08 Z ajab_01 Toll (BOI17_toll) C++17
17 / 100
 51 ms 6208 KB 
#include<bits/stdc++.h>
using namespace std;

const int INF = 1e9 + 9;
const int N = 1e5 + 5;
const int O = 3e3 + 3;
vector<pair<int , int> > g[N] , query;
priority_queue<pair<int , int> > pq;
int val[N] , pre[N] , pr[N] , k , n , m , o;
bool vis[N] , ch = 1;

void dijkstra(){
	val[0] = 0;
	pq.push({0 , 0});
	while(!pq.empty()){
		int v = pq.top().second;
		pq.pop();
		if(vis[v]) continue;
		vis[v] = 1;
		for(auto i : g[v]){
			int u = i.first , w = i.second;
			if(val[u] > val[v] + w){
				val[u] = val[v] + w;
				pq.push({-val[u] , u});
			}
		}
	}
}

int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	memset(pr , -1 , sizeof(pr));
	fill(val , val + N , INF);
	cin >> k >> n >> m >> o;
	for(int i = 0 ; i < m ; i++){
		int u , v , w;
		cin >> u >> v >> w;
		g[u].push_back({v , w});
	}

	for(int i = 0 ; i < o ; i++){
		int a , b;
		cin >> a >> b;
		query.push_back({a , b});
		if(a) ch = 0;
	}

	if(k == 1){
		int bef = 0;
		for(int i = 0 ; i < n ; i++){
			if(i == bef)
				pre[i] = 0;
			else
				pre[i] = pre[i - 1] + g[i - 1][0].second;
			pr[i] = bef;
			if(!g[i].size()){
				while(!g[i].size())i++;
				bef = i;
				i--;
			}
		}
		for(auto i : query){
			if(pr[i.first] == -1 || pr[i.second] == -1 || pr[i.first] != pr[i.second] || i.second < i.first)
				cout << -1 << '\n';
			else
				cout << pre[i.second] - pre[i.first] << '\n';
		}
		return 0;
	}

	if(ch){
		dijkstra();
		for(auto i : query){
			if(val[i.second] == INF)
				cout << -1 << '\n';
			else
				cout << val[i.second] << '\n';
		}
		return 0;
	}

	cout << "jalebe" << '\n';
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5504 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3368 KB Output is correct
5 Correct 3 ms 3412 KB Output is correct
6 Correct 3 ms 3412 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 28 ms 5372 KB Output is correct
9 Correct 20 ms 5344 KB Output is correct
10 Correct 5 ms 3668 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5300 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 4 ms 3668 KB Output is correct
8 Correct 5 ms 3668 KB Output is correct
9 Correct 20 ms 5444 KB Output is correct
10 Correct 51 ms 6168 KB Output is correct
11 Correct 50 ms 5456 KB Output is correct
12 Correct 25 ms 5068 KB Output is correct
13 Correct 50 ms 6208 KB Output is correct
14 Correct 32 ms 5200 KB Output is correct
15 Correct 27 ms 4840 KB Output is correct
16 Correct 29 ms 4856 KB Output is correct

Subtask #3
0 / 8.0

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

Subtask #4
0 / 31.0

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

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5504 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3368 KB Output is correct
5 Correct 3 ms 3412 KB Output is correct
6 Correct 3 ms 3412 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 28 ms 5372 KB Output is correct
9 Correct 20 ms 5344 KB Output is correct
10 Correct 5 ms 3668 KB Output is correct
11 Correct 36 ms 5300 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 3 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 4 ms 3668 KB Output is correct
18 Correct 5 ms 3668 KB Output is correct
19 Correct 20 ms 5444 KB Output is correct
20 Correct 51 ms 6168 KB Output is correct
21 Correct 50 ms 5456 KB Output is correct
22 Correct 25 ms 5068 KB Output is correct
23 Correct 50 ms 6208 KB Output is correct
24 Correct 32 ms 5200 KB Output is correct
25 Correct 27 ms 4840 KB Output is correct
26 Correct 29 ms 4856 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Incorrect 2 ms 3412 KB Output isn't correct
29 Halted 0 ms 0 KB -