oj.uz

Submission #786843

# Submission time Handle Problem Language Result Execution time Memory
786843 2023-07-18T13:39:06 Z winter0101 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 217 ms 23748 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
const int maxn=1e5+9;
const long long inf=2e15;
vector<pil>a[maxn];
int n,m;
struct cus{
int u;
long long w;
bool operator< (const cus &p)const {
return w>p.w;
}
};
vector<long long> sp(int u1){
vector<long long>dis;
dis.resize(n+1);
for1(i,1,n)dis[i]=inf;
dis[u1]=0;
vector<bool>visit;
visit.resize(n+1);
priority_queue<cus>c;
c.push({u1,0});
while (!c.empty()){
    auto u=c.top();
    c.pop();
    if (visit[u.u])continue;
    visit[u.u]=1;
    for (auto v:a[u.u]){
        long long newval=v.se+u.w;
        if (newval<dis[v.fi]){
            dis[v.fi]=newval;
            c.push({v.fi,newval});
        }
    }
}
return dis;
}
vector<long long>disu,disv;
long long f[maxn][2][2];
int s,t,u1,v1;
long long solve(){
vector<long long>dis;
dis.resize(n+1);
for1(i,1,n)dis[i]=inf;
for1(i,1,n){
for1(j,0,1){
for1(k,0,1){
f[i][j][k]=inf;
}
}
f[i][1][0]=disu[i];
f[i][1][1]=disu[i]+disv[i];
f[i][0][1]=disv[i];
}
dis[s]=0;
vector<bool>visit;
visit.resize(n+1);
priority_queue<cus>c;
c.push({s,0});
while (!c.empty()){
    auto u=c.top();
    c.pop();
    //if (u.u==2)cout<<u.w<<'\n';
    //cout<<u.u<<'\n';
    if (visit[u.u])continue;
    visit[u.u]=1;
    f[u.u][1][0]=min(f[u.u][1][0],disu[u.u]);
    f[u.u][0][1]=min(f[u.u][0][1],disv[u.u]);
    f[u.u][1][1]=min({f[u.u][1][1],f[u.u][1][0]+disv[u.u],f[u.u][0][1]+disu[u.u]});
    //if (u.u==2)cout<<u.w<<'\n';
    for (auto v:a[u.u]){
        long long newval=v.se+u.w;
        if (newval<dis[v.fi]){
            dis[v.fi]=newval;
            c.push({v.fi,newval});
            f[v.fi][1][0]=f[u.u][1][0];
            f[v.fi][1][1]=f[u.u][1][1];
            f[v.fi][0][1]=f[u.u][0][1];
        }
        else if (newval==dis[v.fi]){
            f[v.fi][1][0]=min(f[v.fi][1][0],f[u.u][1][0]);
            f[v.fi][1][1]=min(f[v.fi][1][1],f[u.u][1][1]);
            f[v.fi][0][1]=min(f[v.fi][0][1],f[u.u][0][1]);
        }
    }
}
return f[t][1][1];
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    cin>>n>>m;
    cin>>s>>t>>u1>>v1;
    for1(i,1,m){
    int u,v;
    long long w;
    cin>>u>>v>>w;
    a[u].pb({v,w});
    a[v].pb({u,w});
    }
    disu=sp(u1),disv=sp(v1);
    cout<<min(solve(),disu[v1]);
    //solve();
    //cout<<f[1][0][1];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 22548 KB Output is correct
2 Correct 214 ms 21420 KB Output is correct
3 Correct 217 ms 21048 KB Output is correct
4 Correct 204 ms 21340 KB Output is correct
5 Correct 198 ms 22460 KB Output is correct
6 Correct 192 ms 23748 KB Output is correct
7 Correct 189 ms 22504 KB Output is correct
8 Correct 189 ms 22460 KB Output is correct
9 Correct 165 ms 22344 KB Output is correct
10 Correct 135 ms 22220 KB Output is correct
11 Correct 75 ms 15356 KB Output is correct
12 Correct 187 ms 22464 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 21436 KB Output is correct
2 Correct 186 ms 21364 KB Output is correct
3 Correct 199 ms 21376 KB Output is correct
4 Correct 182 ms 21260 KB Output is correct
5 Correct 186 ms 21264 KB Output is correct
6 Correct 204 ms 21048 KB Output is correct
7 Correct 183 ms 21188 KB Output is correct
8 Correct 180 ms 21348 KB Output is correct
9 Correct 193 ms 21476 KB Output is correct
10 Correct 180 ms 21256 KB Output is correct
11 Correct 63 ms 14284 KB Output is correct
12 Correct 183 ms 21164 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4436 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 12 ms 6096 KB Output is correct
5 Correct 6 ms 4308 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 7 ms 4436 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 22548 KB Output is correct
2 Correct 214 ms 21420 KB Output is correct
3 Correct 217 ms 21048 KB Output is correct
4 Correct 204 ms 21340 KB Output is correct
5 Correct 198 ms 22460 KB Output is correct
6 Correct 192 ms 23748 KB Output is correct
7 Correct 189 ms 22504 KB Output is correct
8 Correct 189 ms 22460 KB Output is correct
9 Correct 165 ms 22344 KB Output is correct
10 Correct 135 ms 22220 KB Output is correct
11 Correct 75 ms 15356 KB Output is correct
12 Correct 187 ms 22464 KB Output is correct
13 Correct 181 ms 21436 KB Output is correct
14 Correct 186 ms 21364 KB Output is correct
15 Correct 199 ms 21376 KB Output is correct
16 Correct 182 ms 21260 KB Output is correct
17 Correct 186 ms 21264 KB Output is correct
18 Correct 204 ms 21048 KB Output is correct
19 Correct 183 ms 21188 KB Output is correct
20 Correct 180 ms 21348 KB Output is correct
21 Correct 193 ms 21476 KB Output is correct
22 Correct 180 ms 21256 KB Output is correct
23 Correct 63 ms 14284 KB Output is correct
24 Correct 183 ms 21164 KB Output is correct
25 Correct 7 ms 4436 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 12 ms 6096 KB Output is correct
29 Correct 6 ms 4308 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 7 ms 4436 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2688 KB Output is correct
40 Correct 157 ms 23196 KB Output is correct
41 Correct 172 ms 22372 KB Output is correct
42 Correct 166 ms 22464 KB Output is correct
43 Correct 57 ms 15476 KB Output is correct
44 Correct 59 ms 15420 KB Output is correct
45 Correct 137 ms 22088 KB Output is correct
46 Correct 137 ms 22044 KB Output is correct
47 Correct 163 ms 22276 KB Output is correct
48 Correct 74 ms 14920 KB Output is correct
49 Correct 145 ms 23184 KB Output is correct
50 Correct 157 ms 22052 KB Output is correct
51 Correct 139 ms 22020 KB Output is correct