oj.uz

Submission #407647

# Submission time Handle Problem Language Result Execution time Memory
407647 2021-05-19T04:13:25 Z nguot Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 608 ms 21744 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define fori(x,a,b) for (int x=a;x<=b;x++)
#define ford(x,a,b) for (int x=a;x>=b;x--)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define getbit(x,i) ((x>>i)&1)
#define batbit(x,i) (x|(1ll<<i))
#define tatbit(x,i) (x&~(1<<i))
#define gg exit(0);

const int maxn = 2e5 + 10;
int n,m,s,t,u,v;
vector<ii> ke[maxn];

vector<int> dij(int s)
{
    vector<int> f(n+5,1e15);
    priority_queue<ii,vector<ii>,greater<ii> > h;
    f[s] = 0;
    h.push({0,s});
    while(!h.empty())
    {
        ii tg = h.top();
        h.pop();
        int umin = tg.se,dmin = tg.fi;
        forv(v,ke[umin]) if(f[v.fi] > dmin + v.se)
        {
            f[v.fi] = dmin + v.se;
            h.push({f[v.fi],v.fi});
        }
    }
    return f;
}

// f[i] : dg di ngan nhat khi di toi uu tu u->i;
main()
{
    //freopen("task.inp","r",stdin);
    fasty;
   cin>>n>>m;
   cin>>s>>t>>u>>v;
   fori(i,1,m)
   {
       int x,y,c;cin>>x>>y>>c;
       ke[y].pb({x,c}),ke[x].pb({y,c});
   }
   vector<int> fs = dij(s);
   vector<int> ft = dij(t);
   vector<int> fu = dij(u);
   vector<int> fv = dij(v);

   int res = fu[v];
   fori(i,0,1)
   {
        vector<int> d(n+5,1e15),f(n+5,1e15);
        priority_queue<ii,vector<ii>,greater<ii> > h;
        h.push({0,s});
        d[s] = 0,f[s] = fu[s];
        while(!h.empty())
        {
            int umin,dmin;
            tie(dmin,umin) = h.top();
            h.pop();
            res = min(res,f[umin] + fv[umin]);
            forv(v,ke[umin]) if(fs[v.fi]+ft[v.fi]==fs[t])
            {
                f[v.fi] = min({f[v.fi],f[umin],fu[umin]});
                if(d[v.fi] > dmin + v.se)
                {
                    d[v.fi] = dmin + v.se;
                    h.push({d[v.fi],v.fi});
                }
            }
        }
        swap(fu,fv);
   }
   cout<<res;
}
/*
chon 1 dg di ngan nhat tu s->t,cho tat cac canh tren dg di nay = 0
sao cho dg di ngan nhat tu u->v la MIN
*/
//https://oj.uz/problem/view/JOI18_commuter_pass

Compilation message

commuter_pass.cpp:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   47 | main()
      | ^~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 21664 KB Output is correct
2 Correct 498 ms 20404 KB Output is correct
3 Correct 578 ms 20880 KB Output is correct
4 Correct 411 ms 21488 KB Output is correct
5 Correct 523 ms 20400 KB Output is correct
6 Correct 513 ms 21744 KB Output is correct
7 Correct 497 ms 20224 KB Output is correct
8 Correct 585 ms 20316 KB Output is correct
9 Correct 422 ms 20296 KB Output is correct
10 Correct 417 ms 20124 KB Output is correct
11 Correct 214 ms 14916 KB Output is correct
12 Correct 466 ms 20280 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 20540 KB Output is correct
2 Correct 516 ms 20512 KB Output is correct
3 Correct 560 ms 20452 KB Output is correct
4 Correct 539 ms 20364 KB Output is correct
5 Correct 580 ms 20476 KB Output is correct
6 Correct 545 ms 20768 KB Output is correct
7 Correct 608 ms 20948 KB Output is correct
8 Correct 477 ms 20388 KB Output is correct
9 Correct 512 ms 20460 KB Output is correct
10 Correct 510 ms 20352 KB Output is correct
11 Correct 175 ms 14960 KB Output is correct
12 Correct 536 ms 20836 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6284 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 21 ms 7668 KB Output is correct
5 Correct 13 ms 6392 KB Output is correct
6 Correct 5 ms 5052 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 6 ms 5196 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 12 ms 6364 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 5 ms 4940 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 6 ms 5068 KB Output is correct
15 Correct 6 ms 5052 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 21664 KB Output is correct
2 Correct 498 ms 20404 KB Output is correct
3 Correct 578 ms 20880 KB Output is correct
4 Correct 411 ms 21488 KB Output is correct
5 Correct 523 ms 20400 KB Output is correct
6 Correct 513 ms 21744 KB Output is correct
7 Correct 497 ms 20224 KB Output is correct
8 Correct 585 ms 20316 KB Output is correct
9 Correct 422 ms 20296 KB Output is correct
10 Correct 417 ms 20124 KB Output is correct
11 Correct 214 ms 14916 KB Output is correct
12 Correct 466 ms 20280 KB Output is correct
13 Correct 500 ms 20540 KB Output is correct
14 Correct 516 ms 20512 KB Output is correct
15 Correct 560 ms 20452 KB Output is correct
16 Correct 539 ms 20364 KB Output is correct
17 Correct 580 ms 20476 KB Output is correct
18 Correct 545 ms 20768 KB Output is correct
19 Correct 608 ms 20948 KB Output is correct
20 Correct 477 ms 20388 KB Output is correct
21 Correct 512 ms 20460 KB Output is correct
22 Correct 510 ms 20352 KB Output is correct
23 Correct 175 ms 14960 KB Output is correct
24 Correct 536 ms 20836 KB Output is correct
25 Correct 13 ms 6284 KB Output is correct
26 Correct 4 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 21 ms 7668 KB Output is correct
29 Correct 13 ms 6392 KB Output is correct
30 Correct 5 ms 5052 KB Output is correct
31 Correct 5 ms 5068 KB Output is correct
32 Correct 6 ms 5196 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 12 ms 6364 KB Output is correct
35 Correct 4 ms 4940 KB Output is correct
36 Correct 5 ms 4940 KB Output is correct
37 Correct 5 ms 5068 KB Output is correct
38 Correct 6 ms 5068 KB Output is correct
39 Correct 6 ms 5052 KB Output is correct
40 Correct 452 ms 21192 KB Output is correct
41 Correct 411 ms 20304 KB Output is correct
42 Correct 360 ms 20424 KB Output is correct
43 Correct 235 ms 14964 KB Output is correct
44 Correct 223 ms 14908 KB Output is correct
45 Correct 454 ms 21636 KB Output is correct
46 Correct 442 ms 21604 KB Output is correct
47 Correct 381 ms 21516 KB Output is correct
48 Correct 222 ms 14924 KB Output is correct
49 Correct 291 ms 21160 KB Output is correct
50 Correct 426 ms 20976 KB Output is correct
51 Correct 424 ms 21608 KB Output is correct