oj.uz

Submission #656303

# Submission time Handle Problem Language Result Execution time Memory
656303 2022-11-06T19:13:19 Z Dec0Dedd Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 317 ms 24768 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pii pair<ll, int>

const int N = 1e5+1;
const ll INF = 1e18;

bool vis[N];

vector<pii> G[N];
vector<int> G2[N];
int n, m, ind[N];

ll ans=INF, dx[N], dy[N], mx[N], my[N];

void dijk(int s, ll *d) {
   for (int i=1; i<=n; ++i) d[i]=INF;
   d[s]=0;

   priority_queue<pii, vector<pii>, greater<pii>> pq;
   pq.push({0, s});

   while (!pq.empty()) {
      ll x=pq.top().first, v=pq.top().second; pq.pop();
      if (x > d[v]) continue;

      for (auto z : G[v]) {
         ll w=z.first, u=z.second;
         if (d[u] > d[v]+w) {
            d[u]=d[v]+w;
            pq.push({d[u], u});
         }
      }
   }
}

void bfs() {
   queue<int> q;
   for (int i=1; i<=n; ++i) {
      if (ind[i] == 0) q.push(i); 
   }

   while (!q.empty()) {
      int v=q.front(); q.pop();
      mx[v]=min(mx[v], dx[v]), my[v]=min(my[v], dy[v]);
      ans=min({ans, dx[v]+my[v], mx[v]+dy[v]});

      for (auto u : G2[v]) {
         --ind[u];
         mx[u]=min(mx[u], mx[v]), my[u]=min(my[u], my[v]);
         if (ind[u] == 0) q.push(u); 
      }
   }
}

int main() {
   ios_base::sync_with_stdio(0);
   cin.tie(NULL);
   cout.tie(NULL);
   cin>>n>>m;

   int s, t; cin>>s>>t;
   int x, y; cin>>x>>y;

   ll ds[n+1]={}, dt[n+1]={};
   for (int i=1; i<=m; ++i) {
      int a, b, c; cin>>a>>b>>c;
      G[a].push_back({c, b});
      G[b].push_back({c, a});
   } dijk(s, ds), dijk(t, dt);

   ll k=ds[t];
   for (int i=1; i<=n; ++i) {
      for (auto z : G[i]) {
         if (ds[i]+dt[z.second]+z.first == k) G2[i].push_back(z.second);
         if (ds[z.second]+dt[i]+z.first == k) G2[z.second].push_back(i);
      }
   }

   for (int i=1; i<=n; ++i) dx[i]=dy[i]=mx[i]=my[i]=INF;
   dijk(x, dx), dijk(y, dy);
   memset(vis, false, sizeof(vis));

   for (int i=1; i<=n; ++i) {
      for (auto u : G2[i]) ++ind[u];
   }
   bfs();

   ans=min(ans, dx[y]);
   cout<<ans<<"\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 23184 KB Output is correct
2 Correct 281 ms 22344 KB Output is correct
3 Correct 302 ms 23808 KB Output is correct
4 Correct 251 ms 23120 KB Output is correct
5 Correct 292 ms 23108 KB Output is correct
6 Correct 270 ms 23304 KB Output is correct
7 Correct 298 ms 23228 KB Output is correct
8 Correct 293 ms 23104 KB Output is correct
9 Correct 260 ms 21848 KB Output is correct
10 Correct 217 ms 21728 KB Output is correct
11 Correct 127 ms 16792 KB Output is correct
12 Correct 272 ms 21872 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 22284 KB Output is correct
2 Correct 306 ms 22252 KB Output is correct
3 Correct 297 ms 22072 KB Output is correct
4 Correct 300 ms 22368 KB Output is correct
5 Correct 291 ms 22432 KB Output is correct
6 Correct 284 ms 22992 KB Output is correct
7 Correct 304 ms 23376 KB Output is correct
8 Correct 285 ms 22260 KB Output is correct
9 Correct 305 ms 22444 KB Output is correct
10 Correct 284 ms 22132 KB Output is correct
11 Correct 126 ms 17180 KB Output is correct
12 Correct 307 ms 23052 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6484 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 16 ms 8020 KB Output is correct
5 Correct 10 ms 6588 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5296 KB Output is correct
9 Correct 3 ms 5168 KB Output is correct
10 Correct 9 ms 6612 KB Output is correct
11 Correct 3 ms 5156 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 3 ms 5168 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 23184 KB Output is correct
2 Correct 281 ms 22344 KB Output is correct
3 Correct 302 ms 23808 KB Output is correct
4 Correct 251 ms 23120 KB Output is correct
5 Correct 292 ms 23108 KB Output is correct
6 Correct 270 ms 23304 KB Output is correct
7 Correct 298 ms 23228 KB Output is correct
8 Correct 293 ms 23104 KB Output is correct
9 Correct 260 ms 21848 KB Output is correct
10 Correct 217 ms 21728 KB Output is correct
11 Correct 127 ms 16792 KB Output is correct
12 Correct 272 ms 21872 KB Output is correct
13 Correct 288 ms 22284 KB Output is correct
14 Correct 306 ms 22252 KB Output is correct
15 Correct 297 ms 22072 KB Output is correct
16 Correct 300 ms 22368 KB Output is correct
17 Correct 291 ms 22432 KB Output is correct
18 Correct 284 ms 22992 KB Output is correct
19 Correct 304 ms 23376 KB Output is correct
20 Correct 285 ms 22260 KB Output is correct
21 Correct 305 ms 22444 KB Output is correct
22 Correct 284 ms 22132 KB Output is correct
23 Correct 126 ms 17180 KB Output is correct
24 Correct 307 ms 23052 KB Output is correct
25 Correct 9 ms 6484 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 16 ms 8020 KB Output is correct
29 Correct 10 ms 6588 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 4 ms 5332 KB Output is correct
32 Correct 4 ms 5296 KB Output is correct
33 Correct 3 ms 5168 KB Output is correct
34 Correct 9 ms 6612 KB Output is correct
35 Correct 3 ms 5156 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 4 ms 5076 KB Output is correct
38 Correct 3 ms 5204 KB Output is correct
39 Correct 3 ms 5168 KB Output is correct
40 Correct 240 ms 22832 KB Output is correct
41 Correct 266 ms 22044 KB Output is correct
42 Correct 273 ms 22308 KB Output is correct
43 Correct 142 ms 18408 KB Output is correct
44 Correct 172 ms 18256 KB Output is correct
45 Correct 317 ms 24700 KB Output is correct
46 Correct 298 ms 24712 KB Output is correct
47 Correct 269 ms 23208 KB Output is correct
48 Correct 145 ms 18284 KB Output is correct
49 Correct 219 ms 22824 KB Output is correct
50 Correct 294 ms 24004 KB Output is correct
51 Correct 289 ms 24768 KB Output is correct