oj.uz

Submission #714751

# Submission time Handle Problem Language Result Execution time Memory
714751 2023-03-25T09:02:09 Z ajab_01 Toll (BOI17_toll) C++17
17 / 100
 51 ms 6420 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;
vector<int> vec;
int dp[N][O] , ind[N] , val[N] , pre[N] , pr[N] , k , n , m , o;
bool mark[N] , 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);
	// for(int i = 0 ; i < N ; i++)
	// 	for(int j = 0 ; j < O ; j++)
	// 		dp[i][j] = 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(mark[b]) continue;
		vec.push_back(b);
		ind[b] = (int)vec.size() - 1;
		mark[b] = 1;
	}

	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;
	}

	if(o <= 3000){
		int sz = (int)vec.size();
		for(int i = 0 ; i < sz ; i++)
			dp[vec[i]][i] = 0;

		for(int v = n - 1 ; v >= 0 ; v--)
			for(int j = 0 ; j < sz ; j++)
				for(auto u : g[v])
					dp[v][j] = min(dp[v][j] , dp[u.first][j] + u.second);

		for(auto i : query){
			int a = i.first , b = i.second;
			if(dp[a][ind[b]] == INF)
				cout << -1 << '\n';
			else
				cout << dp[a][ind[b]] << '\n';
		}
		return 0;
	}
	cout << "jalebe" << '\n';
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5716 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 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 3 ms 3540 KB Output is correct
8 Correct 20 ms 5716 KB Output is correct
9 Correct 18 ms 5564 KB Output is correct
10 Correct 4 ms 3924 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 5500 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 3412 KB Output is correct
5 Correct 2 ms 3448 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 4 ms 3668 KB Output is correct
8 Correct 4 ms 3796 KB Output is correct
9 Correct 18 ms 5716 KB Output is correct
10 Correct 51 ms 6412 KB Output is correct
11 Correct 35 ms 5536 KB Output is correct
12 Correct 25 ms 5348 KB Output is correct
13 Correct 50 ms 6420 KB Output is correct
14 Correct 33 ms 5384 KB Output is correct
15 Correct 27 ms 4988 KB Output is correct
16 Correct 26 ms 4980 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 3424 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 3424 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5716 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 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 3 ms 3540 KB Output is correct
8 Correct 20 ms 5716 KB Output is correct
9 Correct 18 ms 5564 KB Output is correct
10 Correct 4 ms 3924 KB Output is correct
11 Correct 36 ms 5500 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3448 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 4 ms 3668 KB Output is correct
18 Correct 4 ms 3796 KB Output is correct
19 Correct 18 ms 5716 KB Output is correct
20 Correct 51 ms 6412 KB Output is correct
21 Correct 35 ms 5536 KB Output is correct
22 Correct 25 ms 5348 KB Output is correct
23 Correct 50 ms 6420 KB Output is correct
24 Correct 33 ms 5384 KB Output is correct
25 Correct 27 ms 4988 KB Output is correct
26 Correct 26 ms 4980 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Incorrect 2 ms 3424 KB Output isn't correct
29 Halted 0 ms 0 KB -