oj.uz

Submission #876405

# Submission time Handle Problem Language Result Execution time Memory
876405 2023-11-21T16:39:02 Z cpptowin Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 231 ms 94860 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf (int)2e18
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n,m;
vii ke[maxn];
void dijkstra1(int inp,int d[])
{
    priority_queue<pii,vii,greater<pii>> q;
    fo(i,1,n) d[i] = inf;
    d[inp] = 0;
    q.push({0,inp});
    while(q.size())
    {
        auto [du,u] = q.top();
        q.pop();
        if(du != d[u]) continue;
        for(auto [v,w] : ke[u])
        {
            if(d[v] > d[u] + w)
            {
                d[v] = d[u] + w;
                q.push({d[v],v});
            }
        }
    }
}
int du[maxn],dv[maxn],ds[maxn],dt[maxn];
int dpu[maxn],dpv[maxn];
vi adj[maxn];
array<int,3> edge[maxn];
int ans;
int vis[maxn];
void dfs(int u)
{
    vis[u] = 1;
    for(int v : adj[u])
    {
        if(!vis[v]) dfs(v);
        dpu[u] = min(dpu[u],min(dpu[v],du[v]));
        dpv[u] = min(dpv[u],min(dpv[v],dv[v]));
    }
    ans = min({ans,dpu[u] + dv[u],dpv[u] + du[u]});
}
int s,t,u,v;
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n >> m;
    cin >> s >> t >> u >> v;
    fo(i,1,m)
    {
        cin >> edge[i][0] >> edge[i][1] >> edge[i][2];
        ke[edge[i][0]].pb(edge[i][1],edge[i][2]);
        ke[edge[i][1]].pb(edge[i][0],edge[i][2]);
    }
    dijkstra1(u,du);
    dijkstra1(v,dv);
    dijkstra1(s,ds);
    dijkstra1(t,dt);
    fo(i,1,m)
    {
        if(ds[edge[i][0]] + edge[i][2] + dt[edge[i][1]] == ds[t]) adj[edge[i][0]].pb(edge[i][1]);
        if(ds[edge[i][1]] + edge[i][2] + dt[edge[i][0]] == ds[t]) adj[edge[i][1]].pb(edge[i][0]);
    }
    fo(i,1,n) dpu[i] = dpv[i] = 2e18;
    ans = du[v];
    dfs(s);
    cout << ans;
}

Compilation message

commuter_pass.cpp: In function 'void dijkstra1(long long int, long long int*)':
commuter_pass.cpp:32:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |         auto [du,u] = q.top();
      |              ^
commuter_pass.cpp:35:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |         for(auto [v,w] : ke[u])
      |                  ^
commuter_pass.cpp: At global scope:
commuter_pass.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main()
      | ^~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:68:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:69:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 84564 KB Output is correct
2 Correct 217 ms 84980 KB Output is correct
3 Correct 224 ms 90144 KB Output is correct
4 Correct 191 ms 86572 KB Output is correct
5 Correct 189 ms 85632 KB Output is correct
6 Correct 219 ms 84576 KB Output is correct
7 Correct 202 ms 86084 KB Output is correct
8 Correct 213 ms 85792 KB Output is correct
9 Correct 189 ms 84552 KB Output is correct
10 Correct 159 ms 87064 KB Output is correct
11 Correct 79 ms 81828 KB Output is correct
12 Correct 223 ms 89032 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 87108 KB Output is correct
2 Correct 216 ms 85936 KB Output is correct
3 Correct 227 ms 86820 KB Output is correct
4 Correct 219 ms 87428 KB Output is correct
5 Correct 216 ms 86488 KB Output is correct
6 Correct 221 ms 90500 KB Output is correct
7 Correct 218 ms 89804 KB Output is correct
8 Correct 220 ms 87524 KB Output is correct
9 Correct 224 ms 88008 KB Output is correct
10 Correct 218 ms 86992 KB Output is correct
11 Correct 82 ms 82060 KB Output is correct
12 Correct 231 ms 94860 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 63068 KB Output is correct
2 Correct 12 ms 61828 KB Output is correct
3 Correct 12 ms 62040 KB Output is correct
4 Correct 22 ms 67364 KB Output is correct
5 Correct 17 ms 63476 KB Output is correct
6 Correct 13 ms 62040 KB Output is correct
7 Correct 13 ms 62044 KB Output is correct
8 Correct 15 ms 62044 KB Output is correct
9 Correct 13 ms 61912 KB Output is correct
10 Correct 18 ms 63664 KB Output is correct
11 Correct 12 ms 61784 KB Output is correct
12 Correct 12 ms 61844 KB Output is correct
13 Correct 13 ms 61788 KB Output is correct
14 Correct 14 ms 61788 KB Output is correct
15 Correct 12 ms 61788 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 84564 KB Output is correct
2 Correct 217 ms 84980 KB Output is correct
3 Correct 224 ms 90144 KB Output is correct
4 Correct 191 ms 86572 KB Output is correct
5 Correct 189 ms 85632 KB Output is correct
6 Correct 219 ms 84576 KB Output is correct
7 Correct 202 ms 86084 KB Output is correct
8 Correct 213 ms 85792 KB Output is correct
9 Correct 189 ms 84552 KB Output is correct
10 Correct 159 ms 87064 KB Output is correct
11 Correct 79 ms 81828 KB Output is correct
12 Correct 223 ms 89032 KB Output is correct
13 Correct 213 ms 87108 KB Output is correct
14 Correct 216 ms 85936 KB Output is correct
15 Correct 227 ms 86820 KB Output is correct
16 Correct 219 ms 87428 KB Output is correct
17 Correct 216 ms 86488 KB Output is correct
18 Correct 221 ms 90500 KB Output is correct
19 Correct 218 ms 89804 KB Output is correct
20 Correct 220 ms 87524 KB Output is correct
21 Correct 224 ms 88008 KB Output is correct
22 Correct 218 ms 86992 KB Output is correct
23 Correct 82 ms 82060 KB Output is correct
24 Correct 231 ms 94860 KB Output is correct
25 Correct 17 ms 63068 KB Output is correct
26 Correct 12 ms 61828 KB Output is correct
27 Correct 12 ms 62040 KB Output is correct
28 Correct 22 ms 67364 KB Output is correct
29 Correct 17 ms 63476 KB Output is correct
30 Correct 13 ms 62040 KB Output is correct
31 Correct 13 ms 62044 KB Output is correct
32 Correct 15 ms 62044 KB Output is correct
33 Correct 13 ms 61912 KB Output is correct
34 Correct 18 ms 63664 KB Output is correct
35 Correct 12 ms 61784 KB Output is correct
36 Correct 12 ms 61844 KB Output is correct
37 Correct 13 ms 61788 KB Output is correct
38 Correct 14 ms 61788 KB Output is correct
39 Correct 12 ms 61788 KB Output is correct
40 Correct 188 ms 88032 KB Output is correct
41 Correct 202 ms 89216 KB Output is correct
42 Correct 187 ms 88820 KB Output is correct
43 Correct 88 ms 84308 KB Output is correct
44 Correct 91 ms 84368 KB Output is correct
45 Correct 228 ms 91228 KB Output is correct
46 Correct 212 ms 90892 KB Output is correct
47 Correct 194 ms 88360 KB Output is correct
48 Correct 90 ms 79700 KB Output is correct
49 Correct 166 ms 87608 KB Output is correct
50 Correct 196 ms 90336 KB Output is correct
51 Correct 203 ms 91040 KB Output is correct