oj.uz

Submission #191317

# Submission time Handle Problem Language Result Execution time Memory
191317 2020-01-14T14:44:28 Z balbit Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 590 ms 23152 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}

const int maxn = 1e5+5;

vector<pii> g[maxn]; // to, weight. 1-based
ll ds[maxn], dt[maxn], du[maxn], dv[maxn];

void dij(ll d[], int S){
    priority_queue<pii, vector<pii>, greater<pii> > pq; // Distance, node
    fill(d, d+maxn, inf);
    d[S]=0; pq.push({0,S});
    while (!pq.empty()) {
        ll w = pq.top().f, v = pq.top().s;
        pq.pop();
        if (w != d[v]) {
            continue;
        }
        for (pii &e : g[v]) {
            if (d[e.f] > d[v] + e.s) {
                d[e.f] = d[v] + e.s;
                pq.push({d[e.f],e.f});
            }
        }
    }
}

bool B[maxn]; // black
ll mnu[maxn]; // Min distance to u walking on s-t shortest path
signed main(){
    IOS();
    int n, m; cin>>n>>m;
    int s,t,u,v;
    cin>>s>>t>>u>>v;
    REP(i,m) {
        int a, b, c; cin>>a>>b>>c;
        g[a].pb({b,c});
        g[b].pb({a,c});
    }
    dij(ds,s);
    REP1(i,n) {
        bug(i, ds[i]);
    }
    dij(dt,t);
    dij(dv,v);
    dij(du,u);
        ll re = inf;
    ll tg = ds[t]; assert(tg == dt[s]);
    {
        vector<int> q;
        fill(mnu, mnu+maxn, inf);
        static int seen[maxn];
        seen[s]=1;
        REP1(i,n) q.pb(i);
        sort(ALL(q), [](int a, int b){return ds[a]<ds[b];});
        REP(i,n) {
            int at = q[i];
            MN(mnu[at], du[at]);
            for (pii &e : g[at]) {
                int to = e.f;
                if (ds[at] + e.s + dt[to] == ds[t]) {
                    MN(mnu[to], mnu[at]);
                }
            }
            bug(at,mnu[at],dv[at]);
            MN(re, mnu[at] + dv[at]);
        }
    }

    {
        swap(s,t); swap(ds,dt);
        vector<int> q;
        fill(mnu, mnu+maxn, inf);
        static int seen[maxn];
        seen[s]=1;
        REP1(i,n) q.pb(i);
        sort(ALL(q), [](int a, int b){return ds[a]<ds[b];});
        REP(i,n) {
            int at = q[i];
            MN(mnu[at], du[at]);
            for (pii &e : g[at]) {
                int to = e.f;
                if (ds[at] + e.s + dt[to] == ds[t]) {
                    MN(mnu[to], mnu[at]);
                }
            }
            bug(at,mnu[at],dv[at]);
            MN(re, mnu[at] + dv[at]);
        }
    }
    cout<<min(re, du[v])<<endl;

}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:100:20: warning: variable 'seen' set but not used [-Wunused-but-set-variable]
         static int seen[maxn];
                    ^~~~
commuter_pass.cpp:122:20: warning: variable 'seen' set but not used [-Wunused-but-set-variable]
         static int seen[maxn];
                    ^~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 471 ms 20304 KB Output is correct
2 Correct 473 ms 19300 KB Output is correct
3 Correct 470 ms 19736 KB Output is correct
4 Correct 441 ms 20084 KB Output is correct
5 Correct 451 ms 19008 KB Output is correct
6 Correct 476 ms 20508 KB Output is correct
7 Correct 491 ms 19104 KB Output is correct
8 Correct 478 ms 19420 KB Output is correct
9 Correct 473 ms 19080 KB Output is correct
10 Correct 380 ms 18856 KB Output is correct
11 Correct 234 ms 13800 KB Output is correct
12 Correct 554 ms 19160 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 19324 KB Output is correct
2 Correct 551 ms 19320 KB Output is correct
3 Correct 485 ms 19308 KB Output is correct
4 Correct 497 ms 19364 KB Output is correct
5 Correct 515 ms 19220 KB Output is correct
6 Correct 468 ms 19008 KB Output is correct
7 Correct 486 ms 19268 KB Output is correct
8 Correct 486 ms 19140 KB Output is correct
9 Correct 590 ms 19244 KB Output is correct
10 Correct 505 ms 19440 KB Output is correct
11 Correct 235 ms 13144 KB Output is correct
12 Correct 458 ms 18248 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 8312 KB Output is correct
2 Correct 9 ms 6648 KB Output is correct
3 Correct 9 ms 6644 KB Output is correct
4 Correct 25 ms 9980 KB Output is correct
5 Correct 17 ms 8316 KB Output is correct
6 Correct 9 ms 6776 KB Output is correct
7 Correct 9 ms 6776 KB Output is correct
8 Correct 10 ms 6776 KB Output is correct
9 Correct 9 ms 6648 KB Output is correct
10 Correct 18 ms 8312 KB Output is correct
11 Correct 8 ms 6648 KB Output is correct
12 Correct 8 ms 6648 KB Output is correct
13 Correct 8 ms 6648 KB Output is correct
14 Correct 9 ms 6648 KB Output is correct
15 Correct 10 ms 6648 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 471 ms 20304 KB Output is correct
2 Correct 473 ms 19300 KB Output is correct
3 Correct 470 ms 19736 KB Output is correct
4 Correct 441 ms 20084 KB Output is correct
5 Correct 451 ms 19008 KB Output is correct
6 Correct 476 ms 20508 KB Output is correct
7 Correct 491 ms 19104 KB Output is correct
8 Correct 478 ms 19420 KB Output is correct
9 Correct 473 ms 19080 KB Output is correct
10 Correct 380 ms 18856 KB Output is correct
11 Correct 234 ms 13800 KB Output is correct
12 Correct 554 ms 19160 KB Output is correct
13 Correct 539 ms 19324 KB Output is correct
14 Correct 551 ms 19320 KB Output is correct
15 Correct 485 ms 19308 KB Output is correct
16 Correct 497 ms 19364 KB Output is correct
17 Correct 515 ms 19220 KB Output is correct
18 Correct 468 ms 19008 KB Output is correct
19 Correct 486 ms 19268 KB Output is correct
20 Correct 486 ms 19140 KB Output is correct
21 Correct 590 ms 19244 KB Output is correct
22 Correct 505 ms 19440 KB Output is correct
23 Correct 235 ms 13144 KB Output is correct
24 Correct 458 ms 18248 KB Output is correct
25 Correct 18 ms 8312 KB Output is correct
26 Correct 9 ms 6648 KB Output is correct
27 Correct 9 ms 6644 KB Output is correct
28 Correct 25 ms 9980 KB Output is correct
29 Correct 17 ms 8316 KB Output is correct
30 Correct 9 ms 6776 KB Output is correct
31 Correct 9 ms 6776 KB Output is correct
32 Correct 10 ms 6776 KB Output is correct
33 Correct 9 ms 6648 KB Output is correct
34 Correct 18 ms 8312 KB Output is correct
35 Correct 8 ms 6648 KB Output is correct
36 Correct 8 ms 6648 KB Output is correct
37 Correct 8 ms 6648 KB Output is correct
38 Correct 9 ms 6648 KB Output is correct
39 Correct 10 ms 6648 KB Output is correct
40 Correct 424 ms 23152 KB Output is correct
41 Correct 485 ms 22636 KB Output is correct
42 Correct 468 ms 22500 KB Output is correct
43 Correct 245 ms 14936 KB Output is correct
44 Correct 240 ms 14944 KB Output is correct
45 Correct 444 ms 21356 KB Output is correct
46 Correct 449 ms 21280 KB Output is correct
47 Correct 492 ms 23092 KB Output is correct
48 Correct 261 ms 14300 KB Output is correct
49 Correct 395 ms 22840 KB Output is correct
50 Correct 547 ms 21588 KB Output is correct
51 Correct 438 ms 21508 KB Output is correct