oj.uz

Submission #824273

# Submission time Handle Problem Language Result Execution time Memory
824273 2023-08-13T22:56:12 Z trangtranha28 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 282 ms 43888 KB 
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <climits>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define int long long
using namespace std;

const int MAXN = 1e5 + 2;

int n, m;
int s, t, src, tar;

int dis[MAXN] = {0}, dis2[4][MAXN] = {0};
bool vis[MAXN] = {false};

vector <pair <int, int> > adj[MAXN];
vector <int> pp[MAXN], adj2[MAXN], radj[MAXN];

void Dijkstra() {
	// reset:
	memset(dis, 0x3f3f3f3f, sizeof(dis));
	memset(dis2, 0x3f3f3f3f, sizeof(dis2));
	dis[s] = 0;
    
    priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;
    pq.push(make_pair(dis[s], s));
    
    while(pq.empty() == false) {
    	pair <int, int> p = pq.top();
    	pq.pop();
    	
    	int d = p.first;
    	int v = p.second;
				
        if(d != dis[v]) {
        	continue;
		}
		
        for(int i = 0; i < (int)(adj[v].size()); i++) {
        	int u = adj[v][i].first;
        	int w = adj[v][i].second;
        	
            if(dis[u] > dis[v] + w) {
            	dis[u] = dis[v] + w;
                pq.push(make_pair(dis[u], u));
                pp[u] = {v};
            } else if(dis[u] == dis[v] + w) {
            	pp[u].push_back(v);
			}
        }
    }
    return;
}

void programme() {
	// input:
    cin >> n >> m >> s >> t >> src >> tar;
    
    for(int i = 1; i <= m; i++) {
        int a, b, w;
		cin >> a >> b >> w;
        adj[a].push_back(make_pair(b, w));
        adj[b].push_back(make_pair(a, w));
    }
    
    // solve:
	Dijkstra();
    
    queue <int> q;
	q.push(t);
	
	vis[t] = true;
	
    while(q.empty() == false) {
        int v = q.front();
		q.pop();
		
        for(int i = 0; i < (int)(pp[v].size()); i++) {
        	int u = pp[v][i];
            adj2[v].push_back(u);
            radj[u].push_back(v);
            
            if(vis[u] == false) {
            	vis[u] = true;
				q.push(u);
			}
        }
    }
    
    // find ans:
    priority_queue <pair <int, pair <int, int> >, vector <pair <int, pair <int, int> > >, greater <pair <int, pair <int, int> > > > q2;
    dis2[0][src] = 0;
	q2.push(make_pair(dis2[0][src], make_pair(0, src)));
    
    while(q2.empty() == false) {
        auto[d, x] = q2.top();
		q2.pop();
        auto[i, v] = x;
        if(v == tar) {
        	cout << d << "\n";
			return;
		}
        if (d != dis2[i][v]) continue;
        for (auto[u, w]: adj[v]){
            int ni = (!i? 0 : 3);
            if (dis2[ni][u] > dis2[i][v]+w){
                q2.push({dis2[ni][u] = dis2[i][v]+w, {ni, u}});
            }
        }
        if (!i || i == 1){
            for (int u: adj2[v]){
                if (dis2[1][u] > dis2[i][v]){
                    q2.push({dis2[1][u] = dis2[i][v], {1, u}});
                }
            }
        }
        if (!i || i == 2){
            for (int u: radj[v]){
                if (dis2[2][u] > dis2[i][v]){
                    q2.push({dis2[2][u] = dis2[i][v], {2, u}});
                }
            }
        }
    }
    return;
}

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	
//	freopen("_mint.inp", "r", stdin);
//	freopen("_mint.out", "w", stdout);
	
	programme();
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void programme()':
commuter_pass.cpp:101:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  101 |         auto[d, x] = q2.top();
      |             ^
commuter_pass.cpp:103:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  103 |         auto[i, v] = x;
      |             ^
commuter_pass.cpp:109:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  109 |         for (auto[u, w]: adj[v]){
      |                  ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 36596 KB Output is correct
2 Correct 186 ms 36520 KB Output is correct
3 Correct 282 ms 42128 KB Output is correct
4 Correct 186 ms 35172 KB Output is correct
5 Correct 240 ms 41120 KB Output is correct
6 Correct 187 ms 39452 KB Output is correct
7 Correct 169 ms 36244 KB Output is correct
8 Correct 203 ms 38004 KB Output is correct
9 Correct 158 ms 35416 KB Output is correct
10 Correct 151 ms 35512 KB Output is correct
11 Correct 111 ms 27996 KB Output is correct
12 Correct 174 ms 31512 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 33700 KB Output is correct
2 Correct 211 ms 36556 KB Output is correct
3 Correct 176 ms 34356 KB Output is correct
4 Correct 141 ms 34868 KB Output is correct
5 Correct 201 ms 36920 KB Output is correct
6 Correct 263 ms 41668 KB Output is correct
7 Correct 175 ms 38672 KB Output is correct
8 Correct 220 ms 36532 KB Output is correct
9 Correct 177 ms 36924 KB Output is correct
10 Correct 143 ms 34180 KB Output is correct
11 Correct 122 ms 30912 KB Output is correct
12 Correct 255 ms 41956 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15700 KB Output is correct
2 Correct 6 ms 13652 KB Output is correct
3 Correct 6 ms 13652 KB Output is correct
4 Correct 16 ms 17152 KB Output is correct
5 Correct 11 ms 15316 KB Output is correct
6 Correct 6 ms 13652 KB Output is correct
7 Correct 7 ms 13828 KB Output is correct
8 Correct 7 ms 13828 KB Output is correct
9 Correct 6 ms 13652 KB Output is correct
10 Correct 11 ms 15360 KB Output is correct
11 Correct 6 ms 13652 KB Output is correct
12 Correct 6 ms 13652 KB Output is correct
13 Correct 6 ms 13652 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 6 ms 13652 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 36596 KB Output is correct
2 Correct 186 ms 36520 KB Output is correct
3 Correct 282 ms 42128 KB Output is correct
4 Correct 186 ms 35172 KB Output is correct
5 Correct 240 ms 41120 KB Output is correct
6 Correct 187 ms 39452 KB Output is correct
7 Correct 169 ms 36244 KB Output is correct
8 Correct 203 ms 38004 KB Output is correct
9 Correct 158 ms 35416 KB Output is correct
10 Correct 151 ms 35512 KB Output is correct
11 Correct 111 ms 27996 KB Output is correct
12 Correct 174 ms 31512 KB Output is correct
13 Correct 161 ms 33700 KB Output is correct
14 Correct 211 ms 36556 KB Output is correct
15 Correct 176 ms 34356 KB Output is correct
16 Correct 141 ms 34868 KB Output is correct
17 Correct 201 ms 36920 KB Output is correct
18 Correct 263 ms 41668 KB Output is correct
19 Correct 175 ms 38672 KB Output is correct
20 Correct 220 ms 36532 KB Output is correct
21 Correct 177 ms 36924 KB Output is correct
22 Correct 143 ms 34180 KB Output is correct
23 Correct 122 ms 30912 KB Output is correct
24 Correct 255 ms 41956 KB Output is correct
25 Correct 14 ms 15700 KB Output is correct
26 Correct 6 ms 13652 KB Output is correct
27 Correct 6 ms 13652 KB Output is correct
28 Correct 16 ms 17152 KB Output is correct
29 Correct 11 ms 15316 KB Output is correct
30 Correct 6 ms 13652 KB Output is correct
31 Correct 7 ms 13828 KB Output is correct
32 Correct 7 ms 13828 KB Output is correct
33 Correct 6 ms 13652 KB Output is correct
34 Correct 11 ms 15360 KB Output is correct
35 Correct 6 ms 13652 KB Output is correct
36 Correct 6 ms 13652 KB Output is correct
37 Correct 6 ms 13652 KB Output is correct
38 Correct 7 ms 13652 KB Output is correct
39 Correct 6 ms 13652 KB Output is correct
40 Correct 174 ms 39120 KB Output is correct
41 Correct 133 ms 32896 KB Output is correct
42 Correct 148 ms 33504 KB Output is correct
43 Correct 110 ms 33384 KB Output is correct
44 Correct 119 ms 33336 KB Output is correct
45 Correct 248 ms 42368 KB Output is correct
46 Correct 223 ms 42144 KB Output is correct
47 Correct 192 ms 35584 KB Output is correct
48 Correct 130 ms 32708 KB Output is correct
49 Correct 156 ms 39840 KB Output is correct
50 Correct 252 ms 43888 KB Output is correct
51 Correct 188 ms 37784 KB Output is correct