oj.uz

Submission #443703

# Submission time Handle Problem Language Result Execution time Memory
443703 2021-07-11T14:08:46 Z zaneyu Robot (JOI21_ho_t4) C++14
100 / 100
 1156 ms 62652 KB 
/*input
5 7
2 3 7 1
1 4 5 1
4 5 3 1
3 4 7 1
2 4 3 1
3 5 6 1
1 2 5 1
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=double;
using pii=pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=5e5+5;
const int maxlg=__lg(maxn)+2;
map<pii,int> mp;
int cnt=0;
vector<pair<pii,int>> v[maxn];
ll sum[maxn];
void add(int a,int b,int c,int d){
    if(!mp.count({a,c})){
        mp[{a,c}]=++cnt;
        v[a].pb({{cnt,0},0});
    }   
    int z=mp[{a,c}];
    v[z].pb({{b,c},d});
    sum[z]+=d;
}
ll dist[maxn];
priority_queue<pii,vector<pii>,greater<pii>> pq;
void upd(int x,ll d){
    if(dist[x]<=d) return;
    dist[x]=d;
    pq.push({dist[x],x});
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    cnt=n-1;
    REP(i,m){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        --a,--b;
        add(a,b,c,d);
        add(b,a,c,d);
    }
    REP(i,cnt+1) dist[i]=INF64;
    dist[0]=0;
    pq.push({0,0});
    while(!pq.empty()){
        int z=pq.top().s;
        ll d=pq.top().f;
        pq.pop();
        if(dist[z]<d) continue;
        if(z<n){
            for(auto x:v[z]){
                int col=x.f.f;
                for(auto a:v[col]){
                    upd(a.f.f,d+min((ll)a.s,sum[col]-a.s));
                    upd(mp[a.f],d);
                }
            }
        }
        else{
            for(auto x:v[z]){
                upd(x.f.f,d+sum[z]-x.s);
            }
        }
    }
    if(dist[n-1]==INF64) dist[n-1]=-1;
    cout<<dist[n-1];
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12052 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 12060 KB Output is correct
4 Correct 7 ms 12068 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 7 ms 12060 KB Output is correct
7 Correct 8 ms 12232 KB Output is correct
8 Correct 7 ms 12108 KB Output is correct
9 Correct 11 ms 12440 KB Output is correct
10 Correct 10 ms 12492 KB Output is correct
11 Correct 9 ms 12384 KB Output is correct
12 Correct 9 ms 12236 KB Output is correct
13 Correct 9 ms 12364 KB Output is correct
14 Correct 10 ms 12336 KB Output is correct
15 Correct 8 ms 12204 KB Output is correct
16 Correct 10 ms 12300 KB Output is correct
17 Correct 9 ms 12364 KB Output is correct
18 Correct 8 ms 12236 KB Output is correct
19 Correct 9 ms 12236 KB Output is correct
20 Correct 11 ms 12292 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 28084 KB Output is correct
2 Correct 111 ms 19820 KB Output is correct
3 Correct 321 ms 30524 KB Output is correct
4 Correct 180 ms 22876 KB Output is correct
5 Correct 1072 ms 61276 KB Output is correct
6 Correct 916 ms 55748 KB Output is correct
7 Correct 543 ms 45856 KB Output is correct
8 Correct 711 ms 42564 KB Output is correct
9 Correct 766 ms 42700 KB Output is correct
10 Correct 548 ms 39180 KB Output is correct
11 Correct 229 ms 29044 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12052 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 12060 KB Output is correct
4 Correct 7 ms 12068 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 7 ms 12060 KB Output is correct
7 Correct 8 ms 12232 KB Output is correct
8 Correct 7 ms 12108 KB Output is correct
9 Correct 11 ms 12440 KB Output is correct
10 Correct 10 ms 12492 KB Output is correct
11 Correct 9 ms 12384 KB Output is correct
12 Correct 9 ms 12236 KB Output is correct
13 Correct 9 ms 12364 KB Output is correct
14 Correct 10 ms 12336 KB Output is correct
15 Correct 8 ms 12204 KB Output is correct
16 Correct 10 ms 12300 KB Output is correct
17 Correct 9 ms 12364 KB Output is correct
18 Correct 8 ms 12236 KB Output is correct
19 Correct 9 ms 12236 KB Output is correct
20 Correct 11 ms 12292 KB Output is correct
21 Correct 301 ms 28084 KB Output is correct
22 Correct 111 ms 19820 KB Output is correct
23 Correct 321 ms 30524 KB Output is correct
24 Correct 180 ms 22876 KB Output is correct
25 Correct 1072 ms 61276 KB Output is correct
26 Correct 916 ms 55748 KB Output is correct
27 Correct 543 ms 45856 KB Output is correct
28 Correct 711 ms 42564 KB Output is correct
29 Correct 766 ms 42700 KB Output is correct
30 Correct 548 ms 39180 KB Output is correct
31 Correct 229 ms 29044 KB Output is correct
32 Correct 330 ms 29312 KB Output is correct
33 Correct 252 ms 28600 KB Output is correct
34 Correct 702 ms 40764 KB Output is correct
35 Correct 515 ms 34328 KB Output is correct
36 Correct 512 ms 37612 KB Output is correct
37 Correct 600 ms 41404 KB Output is correct
38 Correct 628 ms 49724 KB Output is correct
39 Correct 384 ms 33584 KB Output is correct
40 Correct 771 ms 43876 KB Output is correct
41 Correct 788 ms 44240 KB Output is correct
42 Correct 887 ms 49476 KB Output is correct
43 Correct 347 ms 30656 KB Output is correct
44 Correct 633 ms 40640 KB Output is correct
45 Correct 603 ms 37912 KB Output is correct
46 Correct 549 ms 38352 KB Output is correct
47 Correct 547 ms 39944 KB Output is correct
48 Correct 1156 ms 62652 KB Output is correct