Submission #772644

# Submission time Handle Problem Language Result Execution time Memory
772644 2023-07-04T09:42:06 Z bgnbvnbv Robot (JOI21_ho_t4) C++14
100 / 100
135 ms 29508 KB
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
#define int long long
const ll maxN=3e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll n,m;
struct edge
{
    ll u,v,c,w;

}e[maxN];
// co 2 cach noi 1 la noi tu u->v
// 2 la tu 1 dinh ke cua u noi den u va tu u noi den v ( dinh ke va v cung mau )
vector<ll>g[maxN];
ll d[maxN];
priority_queue<pli,vector<pli>,greater<pli>>q;
ll mn[maxN],sum[maxN];
void solve()
{
    cin >> n >> m ;
    for(int i=1;i<=m;i++)
    {
        cin >> e[i].u >> e[i].v >> e[i].c >> e[i].w;
        g[e[i].u].pb(i);
        g[e[i].v].pb(i);
        mn[i]=inf;
        sum[i]=0;
    }
    q.push({0,1});
    d[1]=0;
    for(int i=2;i<=n;i++) d[i]=inf;
    while(!q.empty())
    {
        ll u=q.top().se;
        ll dis=q.top().fi;
        q.pop();
        if(dis>d[u]) continue;
        for(auto id:g[u])
        {
            int v=u^e[id].u^e[id].v;
            int w=e[id].w;
            int c=e[id].c;
            mn[c]=min(mn[c],d[v]);
            sum[c]+=w;
        }
        for(auto id:g[u])
        {
            int v=u^e[id].u^e[id].v;
            int w=e[id].w;
            int c=e[id].c;

            if(d[v]>d[u]+min(w,sum[c]-w))
            {
                d[v]=d[u]+min(w,sum[c]-w);
                q.push({d[v],v});
            }
            if(d[v]>mn[c]+sum[c]-w)
            {
                d[v]=mn[c]+sum[c]-w;
                q.push({d[v],v});
            }
            //if(v==3) cout << d[v]<<' '<<u<<' '<<mn[c]<<'\n';
            //if(v==2) cout <<d[v]<<' '<<u<<' '<<d[u]<<'\n';
        }
        for(auto id:g[u])
        {
            int v=u^e[id].u^e[id].v;
            int w=e[id].w;
            int c=e[id].c;
            mn[c]=inf;
            sum[c]=0;
        }
    }
    if(d[n]>=inf) cout << -1;
    else cout << d[n];
    //cout << '\n'<<d[2];
}
signed main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:75:17: warning: unused variable 'v' [-Wunused-variable]
   75 |             int v=u^e[id].u^e[id].v;
      |                 ^
Main.cpp:76:17: warning: unused variable 'w' [-Wunused-variable]
   76 |             int w=e[id].w;
      |                 ^
# Verdict Execution time Memory Grader output
1 Correct 3 ms 7388 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7384 KB Output is correct
4 Correct 4 ms 7384 KB Output is correct
5 Correct 4 ms 7388 KB Output is correct
6 Correct 3 ms 7384 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7392 KB Output is correct
9 Correct 4 ms 7508 KB Output is correct
10 Correct 4 ms 7508 KB Output is correct
11 Correct 4 ms 7592 KB Output is correct
12 Correct 4 ms 7508 KB Output is correct
13 Correct 4 ms 7532 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7404 KB Output is correct
16 Correct 4 ms 7620 KB Output is correct
17 Correct 4 ms 7508 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7508 KB Output is correct
20 Correct 4 ms 7528 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 15460 KB Output is correct
2 Correct 20 ms 10988 KB Output is correct
3 Correct 52 ms 20300 KB Output is correct
4 Correct 27 ms 12896 KB Output is correct
5 Correct 102 ms 29116 KB Output is correct
6 Correct 98 ms 29100 KB Output is correct
7 Correct 87 ms 28360 KB Output is correct
8 Correct 106 ms 27844 KB Output is correct
9 Correct 114 ms 27780 KB Output is correct
10 Correct 62 ms 20100 KB Output is correct
11 Correct 44 ms 17548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 7388 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7384 KB Output is correct
4 Correct 4 ms 7384 KB Output is correct
5 Correct 4 ms 7388 KB Output is correct
6 Correct 3 ms 7384 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7392 KB Output is correct
9 Correct 4 ms 7508 KB Output is correct
10 Correct 4 ms 7508 KB Output is correct
11 Correct 4 ms 7592 KB Output is correct
12 Correct 4 ms 7508 KB Output is correct
13 Correct 4 ms 7532 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7404 KB Output is correct
16 Correct 4 ms 7620 KB Output is correct
17 Correct 4 ms 7508 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7508 KB Output is correct
20 Correct 4 ms 7528 KB Output is correct
21 Correct 36 ms 15460 KB Output is correct
22 Correct 20 ms 10988 KB Output is correct
23 Correct 52 ms 20300 KB Output is correct
24 Correct 27 ms 12896 KB Output is correct
25 Correct 102 ms 29116 KB Output is correct
26 Correct 98 ms 29100 KB Output is correct
27 Correct 87 ms 28360 KB Output is correct
28 Correct 106 ms 27844 KB Output is correct
29 Correct 114 ms 27780 KB Output is correct
30 Correct 62 ms 20100 KB Output is correct
31 Correct 44 ms 17548 KB Output is correct
32 Correct 50 ms 21784 KB Output is correct
33 Correct 56 ms 19552 KB Output is correct
34 Correct 87 ms 23096 KB Output is correct
35 Correct 66 ms 20676 KB Output is correct
36 Correct 80 ms 21436 KB Output is correct
37 Correct 84 ms 25276 KB Output is correct
38 Correct 84 ms 28044 KB Output is correct
39 Correct 69 ms 25444 KB Output is correct
40 Correct 111 ms 29140 KB Output is correct
41 Correct 135 ms 29292 KB Output is correct
42 Correct 106 ms 27676 KB Output is correct
43 Correct 45 ms 17804 KB Output is correct
44 Correct 76 ms 27756 KB Output is correct
45 Correct 102 ms 24184 KB Output is correct
46 Correct 76 ms 22860 KB Output is correct
47 Correct 109 ms 24628 KB Output is correct
48 Correct 122 ms 29508 KB Output is correct