oj.uz

Submission #533316

# Submission time Handle Problem Language Result Execution time Memory
533316 2022-03-05T12:39:42 Z Rafi22 Robot (JOI21_ho_t4) C++14
100 / 100
 1066 ms 120572 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=100007;

vector<pair<int,pair<int,ll>>>G[N];
map<int,vector<pair<int,ll>>>G1[N];
ll d[N];
map<int,ll>sum[N];
bool odw[N];
map<int,ll>D[N];
map<int,ll>was[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m,a,b,c;
    ll x;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>a>>b>>c>>x;
        G[a].pb({b,{c,x}});
        G1[a][c].pb({b,x});
        G[b].pb({a,{c,x}});
        G1[b][c].pb({a,x});
        sum[a][c]+=x;
        sum[b][c]+=x;
    }
    priority_queue<pair<ll,pair<int,int>>>Q;
    d[1]=inf;
    for(int i=2;i<=n;i++) d[i]=infl;
    Q.push({-inf,{1,0}});
    while(!Q.empty())
    {
        int v=Q.top().nd.st;
        int x=Q.top().nd.nd;
        ll t=-Q.top().st;
        Q.pop();
        if(x==0)
        {
            if(odw[v]) continue;
            odw[v]=1;
            for(auto u:G[v])
            {
                ll X=min(u.nd.nd,sum[v][u.nd.st]-u.nd.nd);
                if(t+X<d[u.st])
                {
                    d[u.st]=t+X;
                    Q.push({-(t+X),{u.st,0}});
                }
                X=u.nd.nd;
                if(D[u.st][u.nd.st]==0||t<D[u.st][u.nd.st])
                {
                    D[u.st][u.nd.st]=t;
                    Q.push({-(t),{u.st,u.nd.st}});
                }
            }
        }
        if(x>0)
        {
            if(was[v][x]) continue;
            was[v][x]=1;
            for(auto u:G1[v][x])
            {
                ll X=sum[v][x]-u.nd;
                if(t+X<d[u.st])
                {
                    d[u.st]=t+X;
                    Q.push({-(t+X),{u.st,0}});
                }
            }
        }
    }
    if(d[n]==infl) cout<<-1;
    else cout<<d[n]-inf;

    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21444 KB Output is correct
2 Correct 10 ms 21340 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 10 ms 21448 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 10 ms 21400 KB Output is correct
7 Correct 12 ms 21684 KB Output is correct
8 Correct 10 ms 21452 KB Output is correct
9 Correct 14 ms 22316 KB Output is correct
10 Correct 13 ms 22248 KB Output is correct
11 Correct 12 ms 21964 KB Output is correct
12 Correct 12 ms 21916 KB Output is correct
13 Correct 16 ms 21920 KB Output is correct
14 Correct 13 ms 21964 KB Output is correct
15 Correct 12 ms 21852 KB Output is correct
16 Correct 13 ms 21964 KB Output is correct
17 Correct 14 ms 21980 KB Output is correct
18 Correct 11 ms 21604 KB Output is correct
19 Correct 13 ms 21836 KB Output is correct
20 Correct 12 ms 21896 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 49940 KB Output is correct
2 Correct 92 ms 35800 KB Output is correct
3 Correct 235 ms 47900 KB Output is correct
4 Correct 141 ms 40360 KB Output is correct
5 Correct 1018 ms 114744 KB Output is correct
6 Correct 799 ms 104440 KB Output is correct
7 Correct 334 ms 79512 KB Output is correct
8 Correct 522 ms 78216 KB Output is correct
9 Correct 536 ms 78344 KB Output is correct
10 Correct 368 ms 69364 KB Output is correct
11 Correct 158 ms 46428 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21444 KB Output is correct
2 Correct 10 ms 21340 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 10 ms 21448 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 10 ms 21400 KB Output is correct
7 Correct 12 ms 21684 KB Output is correct
8 Correct 10 ms 21452 KB Output is correct
9 Correct 14 ms 22316 KB Output is correct
10 Correct 13 ms 22248 KB Output is correct
11 Correct 12 ms 21964 KB Output is correct
12 Correct 12 ms 21916 KB Output is correct
13 Correct 16 ms 21920 KB Output is correct
14 Correct 13 ms 21964 KB Output is correct
15 Correct 12 ms 21852 KB Output is correct
16 Correct 13 ms 21964 KB Output is correct
17 Correct 14 ms 21980 KB Output is correct
18 Correct 11 ms 21604 KB Output is correct
19 Correct 13 ms 21836 KB Output is correct
20 Correct 12 ms 21896 KB Output is correct
21 Correct 216 ms 49940 KB Output is correct
22 Correct 92 ms 35800 KB Output is correct
23 Correct 235 ms 47900 KB Output is correct
24 Correct 141 ms 40360 KB Output is correct
25 Correct 1018 ms 114744 KB Output is correct
26 Correct 799 ms 104440 KB Output is correct
27 Correct 334 ms 79512 KB Output is correct
28 Correct 522 ms 78216 KB Output is correct
29 Correct 536 ms 78344 KB Output is correct
30 Correct 368 ms 69364 KB Output is correct
31 Correct 158 ms 46428 KB Output is correct
32 Correct 145 ms 45852 KB Output is correct
33 Correct 192 ms 46196 KB Output is correct
34 Correct 456 ms 74476 KB Output is correct
35 Correct 336 ms 61924 KB Output is correct
36 Correct 335 ms 68440 KB Output is correct
37 Correct 393 ms 73900 KB Output is correct
38 Correct 366 ms 81592 KB Output is correct
39 Correct 189 ms 53308 KB Output is correct
40 Correct 529 ms 79244 KB Output is correct
41 Correct 549 ms 79732 KB Output is correct
42 Correct 545 ms 88388 KB Output is correct
43 Correct 239 ms 53936 KB Output is correct
44 Correct 448 ms 68284 KB Output is correct
45 Correct 383 ms 71328 KB Output is correct
46 Correct 354 ms 70852 KB Output is correct
47 Correct 345 ms 72088 KB Output is correct
48 Correct 1066 ms 120572 KB Output is correct