oj.uz

Submission #114984

# Submission time Handle Problem Language Result Execution time Memory
114984 2019-06-04T09:49:50 Z Mercenary Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 538 ms 23504 KB 
#include<bits/stdc++.h>

using namespace std;
#define taskname "A"
#define pb	push_back
#define mp 	make_pair
#ifndef LOCAL
#define cerr if(0)cout
#endif

typedef long double ld;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,int> lli;

const int maxn = 1e5 + 5;
const ll inf = (ll)1e18;

ll d[4][maxn];
vector<ii> adj[maxn];

void dij(int start , ll d[]){
    priority_queue<lli,vector<lli>,greater<lli>> pq;
    fill_n(d , maxn , inf);
    pq.push(mp(0ll,start));
    d[start] = 0;
    while(!pq.empty()){
        auto u = pq.top();pq.pop();
        if(d[u.second] != u.first)continue;
        for(ii c : adj[u.second]){
            if(d[c.first] > u.first + c.second){
                d[c.first] = u.first + c.second;
                pq.push(mp(d[c.first],c.first));
            }
        }
    }
}

ll dp[maxn][3];
int n , m , s , t , u , v;

void DFS(int u){
//    cout << u << endl;
    if(dp[u][0] != inf)return;
    cerr << u << " ";
    dp[u][0] = min(dp[u][0] , d[0][u]);
    dp[u][1] = min(dp[u][1] , d[1][u]);
    dp[u][2] = d[0][u] + d[1][u];
    for(ii c : adj[u]){
        if(d[2][u] + c.second + d[3][c.first] == d[2][t]){
            DFS(c.first);
            dp[u][2] = min(dp[u][2] , min(dp[u][0],dp[c.first][0]) + dp[u][1]);
            dp[u][2] = min(dp[u][2] , dp[u][0] + min(dp[u][1],dp[c.first][1]));
            dp[u][2] = min(dp[u][2] , dp[c.first][2]);
        }
    }
    for(ii c : adj[u]){
        if(d[2][u] + c.second + d[3][c.first] == d[2][t]){
            dp[u][0] = min(dp[u][0],dp[c.first][0]);
            dp[u][1] = min(dp[u][1],dp[c.first][1]);
        }
    }
}

void enter(){
    cin >> n >> m;
    cin >> s >> t >> u >> v;
    for(int i = 1 ; i <= m ; ++i){
        int u , v , c;cin >> u >> v >> c;
        adj[u].pb(mp(v,c));
        adj[v].pb(mp(u,c));
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    enter();
    dij(u , d[0]);
    dij(v , d[1]);
    dij(s , d[2]);
    dij(t , d[3]);
    fill_n(&dp[0][0],maxn*3,inf);
    DFS(s);
    cout << min(dp[s][2],d[0][v]);
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:80:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:81:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 19248 KB Output is correct
2 Correct 400 ms 18372 KB Output is correct
3 Correct 412 ms 23504 KB Output is correct
4 Correct 401 ms 20268 KB Output is correct
5 Correct 459 ms 18056 KB Output is correct
6 Correct 386 ms 19180 KB Output is correct
7 Correct 458 ms 18156 KB Output is correct
8 Correct 416 ms 18200 KB Output is correct
9 Correct 365 ms 18940 KB Output is correct
10 Correct 367 ms 19160 KB Output is correct
11 Correct 198 ms 16632 KB Output is correct
12 Correct 404 ms 18912 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 20396 KB Output is correct
2 Correct 415 ms 20748 KB Output is correct
3 Correct 403 ms 20052 KB Output is correct
4 Correct 430 ms 20564 KB Output is correct
5 Correct 491 ms 21180 KB Output is correct
6 Correct 441 ms 22964 KB Output is correct
7 Correct 484 ms 23356 KB Output is correct
8 Correct 421 ms 20652 KB Output is correct
9 Correct 493 ms 20952 KB Output is correct
10 Correct 436 ms 20200 KB Output is correct
11 Correct 206 ms 18340 KB Output is correct
12 Correct 454 ms 23320 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 9208 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 23 ms 10260 KB Output is correct
5 Correct 16 ms 9216 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 9 ms 8320 KB Output is correct
8 Correct 10 ms 8320 KB Output is correct
9 Correct 10 ms 8320 KB Output is correct
10 Correct 14 ms 9208 KB Output is correct
11 Correct 9 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 17 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 19248 KB Output is correct
2 Correct 400 ms 18372 KB Output is correct
3 Correct 412 ms 23504 KB Output is correct
4 Correct 401 ms 20268 KB Output is correct
5 Correct 459 ms 18056 KB Output is correct
6 Correct 386 ms 19180 KB Output is correct
7 Correct 458 ms 18156 KB Output is correct
8 Correct 416 ms 18200 KB Output is correct
9 Correct 365 ms 18940 KB Output is correct
10 Correct 367 ms 19160 KB Output is correct
11 Correct 198 ms 16632 KB Output is correct
12 Correct 404 ms 18912 KB Output is correct
13 Correct 408 ms 20396 KB Output is correct
14 Correct 415 ms 20748 KB Output is correct
15 Correct 403 ms 20052 KB Output is correct
16 Correct 430 ms 20564 KB Output is correct
17 Correct 491 ms 21180 KB Output is correct
18 Correct 441 ms 22964 KB Output is correct
19 Correct 484 ms 23356 KB Output is correct
20 Correct 421 ms 20652 KB Output is correct
21 Correct 493 ms 20952 KB Output is correct
22 Correct 436 ms 20200 KB Output is correct
23 Correct 206 ms 18340 KB Output is correct
24 Correct 454 ms 23320 KB Output is correct
25 Correct 16 ms 9208 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 9 ms 8192 KB Output is correct
28 Correct 23 ms 10260 KB Output is correct
29 Correct 16 ms 9216 KB Output is correct
30 Correct 9 ms 8192 KB Output is correct
31 Correct 9 ms 8320 KB Output is correct
32 Correct 10 ms 8320 KB Output is correct
33 Correct 10 ms 8320 KB Output is correct
34 Correct 14 ms 9208 KB Output is correct
35 Correct 9 ms 8192 KB Output is correct
36 Correct 8 ms 8192 KB Output is correct
37 Correct 17 ms 8192 KB Output is correct
38 Correct 9 ms 8192 KB Output is correct
39 Correct 9 ms 8192 KB Output is correct
40 Correct 394 ms 19548 KB Output is correct
41 Correct 433 ms 18864 KB Output is correct
42 Correct 401 ms 18932 KB Output is correct
43 Correct 241 ms 17272 KB Output is correct
44 Correct 229 ms 17320 KB Output is correct
45 Correct 385 ms 18120 KB Output is correct
46 Correct 408 ms 17908 KB Output is correct
47 Correct 392 ms 18888 KB Output is correct
48 Correct 254 ms 14204 KB Output is correct
49 Correct 351 ms 19120 KB Output is correct
50 Correct 381 ms 18068 KB Output is correct
51 Correct 408 ms 18268 KB Output is correct