oj.uz

Submission #461177

# Submission time Handle Problem Language Result Execution time Memory
461177 2021-08-09T13:29:05 Z Killer2501 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 391 ms 27192 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "asd"
#define pll pair<ll, ll>
#define pii pair<pll, ll>
#define fi first
#define se second

using namespace std;
const ll mod = 1e15+7;
const ll N = 2e5+5;
const int base = 313;
ll n, m, t, k, T, ans, tong, a[N], b[N], s, u, v, d[N][4], dp[N][4];
vector<pll> adj[N];
vector<ll> kq;

ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
void dij(ll ui, ll id)
{
    for(int i = 1; i <= n; i ++)d[i][id] = mod;
    priority_queue< pll, vector<pll>, greater<pll> > pq;
    pq.push({0, ui});
    d[ui][id] = 0;
    while(!pq.empty())
    {
        pll u = pq.top();
        pq.pop();
        if(u.fi != d[u.se][id])continue;
        for(pll v : adj[u.se])
        {
            if(d[v.se][id] > u.fi + v.fi)
            {
                d[v.se][id] = u.fi + v.fi;
                pq.push({d[v.se][id], v.se});
            }
        }
    }
}
void sol()
{
    cin >> n >> m >> s >> t >> u >> v;
    for(int i = 1; i <= m; i ++)
    {
        ll x, y, w;
        cin >> x >> y >> w;
        adj[x].pb({w, y});
        adj[y].pb({w, x});
    }
    dij(s, 0);
    dij(u, 1);
    dij(v, 2);
    queue<ll> q;
    for(int i = 1; i <= n; i ++)
    {
        dp[i][0] = dp[i][1] = dp[i][2] = mod;
        for(pll vi : adj[i])
        {
            if(d[i][0] + vi.fi == d[vi.se][0])++a[vi.se];
        }
    }
    q.push(s);
    while(!q.empty())
    {
        ll ui = q.front();
        q.pop();
        dp[ui][0] = min(dp[ui][0], d[ui][1]);
        dp[ui][1] = min(dp[ui][1], d[ui][2]);
        dp[ui][2] = min(dp[ui][2], min(dp[ui][0] + d[ui][2], dp[ui][1] + d[ui][1]));
        for(pll vi : adj[ui])
        {
            if(d[vi.se][0] == d[ui][0] + vi.fi)
            {
                --a[vi.se];
                dp[vi.se][0] = min(dp[vi.se][0], dp[ui][0]);
                dp[vi.se][1] = min(dp[vi.se][1], dp[ui][1]);
                dp[vi.se][2] = min(dp[vi.se][2], dp[ui][2]);
                if(!a[vi.se])q.push(vi.se);
            }
        }
    }
    cout << min(dp[t][2], d[u][2]);
}
int main()
{
    if(fopen(task".INP", "r"))
    {
       freopen(task".INP", "r", stdin);
       freopen(task".OUT", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
5 1
1 2
2 3
3 4
4 5
*/

Compilation message

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

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 26504 KB Output is correct
2 Correct 327 ms 26044 KB Output is correct
3 Correct 325 ms 26224 KB Output is correct
4 Correct 327 ms 26308 KB Output is correct
5 Correct 335 ms 25928 KB Output is correct
6 Correct 343 ms 26356 KB Output is correct
7 Correct 340 ms 25976 KB Output is correct
8 Correct 348 ms 26028 KB Output is correct
9 Correct 348 ms 26936 KB Output is correct
10 Correct 298 ms 27192 KB Output is correct
11 Correct 154 ms 19268 KB Output is correct
12 Correct 368 ms 26716 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 26172 KB Output is correct
2 Correct 385 ms 26104 KB Output is correct
3 Correct 391 ms 26096 KB Output is correct
4 Correct 390 ms 26188 KB Output is correct
5 Correct 360 ms 26108 KB Output is correct
6 Correct 333 ms 26228 KB Output is correct
7 Correct 344 ms 26128 KB Output is correct
8 Correct 347 ms 26044 KB Output is correct
9 Correct 350 ms 26080 KB Output is correct
10 Correct 347 ms 26000 KB Output is correct
11 Correct 146 ms 19268 KB Output is correct
12 Correct 324 ms 26240 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6732 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 20 ms 8524 KB Output is correct
5 Correct 12 ms 6696 KB Output is correct
6 Correct 4 ms 5160 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5324 KB Output is correct
9 Correct 4 ms 5164 KB Output is correct
10 Correct 12 ms 6740 KB Output is correct
11 Correct 3 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 4 ms 5036 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 26504 KB Output is correct
2 Correct 327 ms 26044 KB Output is correct
3 Correct 325 ms 26224 KB Output is correct
4 Correct 327 ms 26308 KB Output is correct
5 Correct 335 ms 25928 KB Output is correct
6 Correct 343 ms 26356 KB Output is correct
7 Correct 340 ms 25976 KB Output is correct
8 Correct 348 ms 26028 KB Output is correct
9 Correct 348 ms 26936 KB Output is correct
10 Correct 298 ms 27192 KB Output is correct
11 Correct 154 ms 19268 KB Output is correct
12 Correct 368 ms 26716 KB Output is correct
13 Correct 369 ms 26172 KB Output is correct
14 Correct 385 ms 26104 KB Output is correct
15 Correct 391 ms 26096 KB Output is correct
16 Correct 390 ms 26188 KB Output is correct
17 Correct 360 ms 26108 KB Output is correct
18 Correct 333 ms 26228 KB Output is correct
19 Correct 344 ms 26128 KB Output is correct
20 Correct 347 ms 26044 KB Output is correct
21 Correct 350 ms 26080 KB Output is correct
22 Correct 347 ms 26000 KB Output is correct
23 Correct 146 ms 19268 KB Output is correct
24 Correct 324 ms 26240 KB Output is correct
25 Correct 12 ms 6732 KB Output is correct
26 Correct 3 ms 5032 KB Output is correct
27 Correct 3 ms 5028 KB Output is correct
28 Correct 20 ms 8524 KB Output is correct
29 Correct 12 ms 6696 KB Output is correct
30 Correct 4 ms 5160 KB Output is correct
31 Correct 5 ms 5196 KB Output is correct
32 Correct 5 ms 5324 KB Output is correct
33 Correct 4 ms 5164 KB Output is correct
34 Correct 12 ms 6740 KB Output is correct
35 Correct 3 ms 5068 KB Output is correct
36 Correct 3 ms 5068 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 4 ms 5036 KB Output is correct
39 Correct 4 ms 5068 KB Output is correct
40 Correct 307 ms 26316 KB Output is correct
41 Correct 334 ms 26780 KB Output is correct
42 Correct 328 ms 26880 KB Output is correct
43 Correct 151 ms 19392 KB Output is correct
44 Correct 170 ms 19416 KB Output is correct
45 Correct 315 ms 26700 KB Output is correct
46 Correct 331 ms 25756 KB Output is correct
47 Correct 363 ms 26332 KB Output is correct
48 Correct 152 ms 18856 KB Output is correct
49 Correct 295 ms 25768 KB Output is correct
50 Correct 323 ms 25980 KB Output is correct
51 Correct 302 ms 25988 KB Output is correct