oj.uz

답안 #514189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514189 2022-01-18T05:03:06 Z Nghes Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 269 ms 19332 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define E '\n'
#define name "main"
#define X first
#define Y second
#define ii pair<int,int>
#define int ll
const int N = 1e5;
const ll oo = 1e18+19;
vector<ii> adj[N+13];
int numNode, numEdge;
ll dist[3][N+13];
ll dp[3][N+13];
int id[N+13];
int S,T,U,V;

bool minimize(ll &x, ll y){
    return x > y ? x = y,1 : 0;
}
void dijkstra(int start,ll d[]){
    priority_queue<ii, vector<ii>, greater<ii>> pq;
    for (int i=1; i <= numNode ; ++i)
        d[i] = oo;
    pq.push({0,start});
    d[start] = 0;
    while (pq.size()){
        ii t = pq.top();
        pq . pop();
        int du = t.X;
        int u = t.Y;
        if (du != d[u]) continue;

        for (ii e: adj[u]){
            int v = e.Y;
            int uv = e.X;
            if (minimize(d[v],d[u] + uv))
                pq.push({d[v],v});
        }
    }
}
signed main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout .tie(0);
//    freopen(name".inp","r",stdin); freopen(name".out","w",stdout);
    cin >> numNode >> numEdge;
    cin >> S >> T >> U >> V;
    for (int i=1; i <= numEdge; ++i){
        int u,v,w;
        cin >> u >> v >> w;
        adj[u].push_back({w,v});
        adj[v].push_back({w,u});
    }
    dijkstra(S,dist[2]);
    dijkstra(U,dist[0]);
    dijkstra(V,dist[1]);
    for (int i=1; i <= numNode; ++i)
        id[i] = i;
    sort(id+1,id+1+numNode,[&](int x,int y){
        return dist[2][x] < dist[2][y];
    });
    for (int i=1; i <= numNode; ++i){
        int u = id[i];
        dp[0][u] = dist[0][u];
        dp[1][u] = dist[1][u];
        dp[2][u] = dist[0][u] + dist[1][u];

        for (ii e: adj[u]){
            int v = e.Y;
            if (dist[2][v] + e.X > dist[2][u]) continue;
            for (int k=0 ; k < 3; ++k)
                minimize(dp[k][u],dp[k][v]);
        }
        minimize(dp[2][u],min(dp[0][u] + dist[1][u],dp[1][u] + dist[0][u]));
    }
    cout << min(dp[2][T],dist[0][V]);
    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 18576 KB Output is correct
2 Correct 223 ms 18600 KB Output is correct
3 Correct 230 ms 18488 KB Output is correct
4 Correct 246 ms 18564 KB Output is correct
5 Correct 232 ms 18648 KB Output is correct
6 Correct 258 ms 18692 KB Output is correct
7 Correct 237 ms 18524 KB Output is correct
8 Correct 233 ms 18708 KB Output is correct
9 Correct 264 ms 18668 KB Output is correct
10 Correct 204 ms 18584 KB Output is correct
11 Correct 99 ms 13296 KB Output is correct
12 Correct 243 ms 18640 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 18584 KB Output is correct
2 Correct 234 ms 18700 KB Output is correct
3 Correct 269 ms 18708 KB Output is correct
4 Correct 243 ms 18592 KB Output is correct
5 Correct 254 ms 18660 KB Output is correct
6 Correct 232 ms 18524 KB Output is correct
7 Correct 246 ms 18592 KB Output is correct
8 Correct 238 ms 18560 KB Output is correct
9 Correct 234 ms 18588 KB Output is correct
10 Correct 242 ms 18620 KB Output is correct
11 Correct 97 ms 13284 KB Output is correct
12 Correct 267 ms 18608 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4044 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 13 ms 5468 KB Output is correct
5 Correct 9 ms 4044 KB Output is correct
6 Correct 3 ms 2816 KB Output is correct
7 Correct 5 ms 2764 KB Output is correct
8 Correct 3 ms 2892 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 7 ms 3976 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 18576 KB Output is correct
2 Correct 223 ms 18600 KB Output is correct
3 Correct 230 ms 18488 KB Output is correct
4 Correct 246 ms 18564 KB Output is correct
5 Correct 232 ms 18648 KB Output is correct
6 Correct 258 ms 18692 KB Output is correct
7 Correct 237 ms 18524 KB Output is correct
8 Correct 233 ms 18708 KB Output is correct
9 Correct 264 ms 18668 KB Output is correct
10 Correct 204 ms 18584 KB Output is correct
11 Correct 99 ms 13296 KB Output is correct
12 Correct 243 ms 18640 KB Output is correct
13 Correct 247 ms 18584 KB Output is correct
14 Correct 234 ms 18700 KB Output is correct
15 Correct 269 ms 18708 KB Output is correct
16 Correct 243 ms 18592 KB Output is correct
17 Correct 254 ms 18660 KB Output is correct
18 Correct 232 ms 18524 KB Output is correct
19 Correct 246 ms 18592 KB Output is correct
20 Correct 238 ms 18560 KB Output is correct
21 Correct 234 ms 18588 KB Output is correct
22 Correct 242 ms 18620 KB Output is correct
23 Correct 97 ms 13284 KB Output is correct
24 Correct 267 ms 18608 KB Output is correct
25 Correct 9 ms 4044 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 13 ms 5468 KB Output is correct
29 Correct 9 ms 4044 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 5 ms 2764 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 7 ms 3976 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2764 KB Output is correct
40 Correct 261 ms 18012 KB Output is correct
41 Correct 225 ms 18528 KB Output is correct
42 Correct 226 ms 18684 KB Output is correct
43 Correct 98 ms 13288 KB Output is correct
44 Correct 110 ms 13380 KB Output is correct
45 Correct 200 ms 19332 KB Output is correct
46 Correct 218 ms 18564 KB Output is correct
47 Correct 240 ms 18600 KB Output is correct
48 Correct 97 ms 13316 KB Output is correct
49 Correct 204 ms 17988 KB Output is correct
50 Correct 215 ms 18664 KB Output is correct
51 Correct 243 ms 18632 KB Output is correct