oj.uz

Submission #706190

# Submission time Handle Problem Language Result Execution time Memory
706190 2023-03-06T04:20:41 Z cig32 Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 10844 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
int dist1[232][232];
int distn[232][232];
int rev1[232][232];
int revn[232][232];
int refer;
bool cmp5(pair<pair<int,int>,int> x, pair<pair<int,int>,int> y) {
  return revn[refer][x.first.first] + x.first.second < revn[refer][y.first.first] + y.first.second;
}
bool cmp6(pair<pair<int,int>,int> x, pair<pair<int,int>,int> y) {
  return rev1[refer][x.first.first] + x.first.second < rev1[refer][y.first.first] + y.first.second;
}

mt19937_64 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  return uniform_int_distribution<int>(x, y)(rng);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  pair<pair<int,int>,pair<int,int> > e[m+1];
  for(int i=1; i<=m; i++) { // O(m)
    cin >> e[i].first.first >> e[i].first.second >> e[i].second.first >> e[i].second.second;
  }
  for(int i=0; i<=n; i++) { // O(n^2)
    for(int j=0; j<=n; j++) {
      dist1[i][j] = distn[i][j] = rev1[i][j] = revn[i][j] = 1e18;
    }
    dist1[i][1] = 0;
    distn[i][n] = 0;
    rev1[i][1] = 0;
    revn[i][n] = 0;
  }
  for(int b=0; b<=n; b++) {
    int temp[n+1][n+1];
    vector<pair<int, int> > adj[n+1], rev[n+1];
    for(int i=0; i<=n; i++) for(int j=0; j<=n; j++) temp[i][j] = 1e18;
    for(int i=1; i<=m; i++) {
      if(e[i].first.first == b || e[i].first.second == b) continue;
      temp[e[i].first.first][e[i].first.second] = min(temp[e[i].first.first][e[i].first.second], e[i].second.first);
    }
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=n; j++) {
        if(temp[i][j] <= 1e16) adj[i].push_back({j, temp[i][j]});
      }
    }
    for(int i=0; i<=n; i++) for(int j=0; j<=n; j++) temp[i][j] = 1e18;
    for(int i=1; i<=m; i++) {
      if(e[i].first.first == b || e[i].first.second == b) continue;
      temp[e[i].first.second][e[i].first.first] = min(temp[e[i].first.second][e[i].first.first], e[i].second.first);
    }
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=n; j++) {
        if(temp[i][j] <= 1e16) rev[i].push_back({j, temp[i][j]});
      }
    }
    bool vis[n+1];
    priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > pq;
    pq.push({dist1[b][1], 1});
    for(int i=1; i<=n; i++) vis[i] = 0;
    while(pq.size()) {
      pair<int,int> t = pq.top(); pq.pop();
      if(!vis[t.second]) {
        vis[t.second] = 1;
        for(pair<int, int> x: adj[t.second]) {
          if(!vis[x.first] && dist1[b][x.first] > dist1[b][t.second]+x.second) {
            dist1[b][x.first] = dist1[b][t.second]+x.second;
            pq.push({dist1[b][x.first], x.first});
          }
        }
      }
    }
    pq.push({distn[b][n], n});
    for(int i=1; i<=n; i++) vis[i] = 0;
    while(pq.size()) {
      pair<int,int> t = pq.top(); pq.pop();
      if(!vis[t.second]) {
        vis[t.second] = 1;
        for(pair<int, int> x: adj[t.second]) {
          if(!vis[x.first] && distn[b][x.first] > distn[b][t.second]+x.second) {
            distn[b][x.first] = distn[b][t.second]+x.second;
            pq.push({distn[b][x.first], x.first});
          }
        }
      }
    }
    pq.push({rev1[b][1], 1});
    for(int i=1; i<=n; i++) vis[i] = 0;
    while(pq.size()) {
      pair<int,int> t = pq.top(); pq.pop();
      if(!vis[t.second]) {
        vis[t.second] = 1;
        for(pair<int, int> x: rev[t.second]) {
          if(!vis[x.first] && rev1[b][x.first] > rev1[b][t.second]+x.second) {
            rev1[b][x.first] = rev1[b][t.second]+x.second;
            pq.push({rev1[b][x.first], x.first});
          }
        }
      }
    }
    pq.push({revn[b][n], n});
    for(int i=1; i<=n; i++) vis[i] = 0;
    while(pq.size()) {
      pair<int,int> t = pq.top(); pq.pop();
      if(!vis[t.second]) {
        vis[t.second] = 1;
        for(pair<int, int> x: rev[t.second]) {
          if(!vis[x.first] && revn[b][x.first] > revn[b][t.second]+x.second) {
            revn[b][x.first] = revn[b][t.second]+x.second;
            pq.push({revn[b][x.first], x.first});
          }
        }
      }
    }
  }
  int ans = dist1[0][n] + distn[0][1];
  vector<pair<int,int> > adj[n+1], rev[n+1];
  vector<int> adj_id[n+1];
  for(int i=1; i<=m; i++) { // O(m)
    adj_id[e[i].first.first].push_back(i);
    adj[e[i].first.first].push_back({e[i].first.second, e[i].second.first});
    rev[e[i].first.second].push_back({e[i].first.first, e[i].second.first});
  }
  int cnt[n+1][n+1];
  for(int i=0; i<=n; i++) { // O(n^2)
    for(int j=0; j<=n; j++) {
      cnt[i][j] = 0;
    }
  }
  for(int i=1; i<=m; i++) { // O(m)
    cnt[e[i].first.first][e[i].first.second]++;
  }
  int opt1[n+1], opt2[n+1], opt3[n+1], opt4[n+1];
  for(int i=1; i<=n; i++) { // O(m)
    opt1[i] = opt2[i] = opt3[i] = opt4[i] = 1e18;
    for(pair<int, int> x: adj[i]) {
      opt1[i] = min(opt1[i], x.second + revn[i][x.first]);
      opt3[i] = min(opt3[i], x.second + rev1[i][x.first]);
    }
    for(pair<int, int> x: rev[i]) {
      opt2[i] = min(opt2[i], dist1[i][x.first] + x.second);
      opt4[i] = min(opt4[i], distn[i][x.first] + x.second);
    }
  }
  vector<pair<pair<int,int>, int> > opt5[n+1], opt6[n+1];
  for(int i=1; i<=n; i++) { // O(m log m)
    for(int j=0; j<adj[i].size(); j++) {
      opt5[i].push_back({adj[i][j], adj_id[i][j]});
    }
    refer = i;
    sort(opt5[i].begin(), opt5[i].end(), cmp5);
    for(int j=0; j<adj[i].size(); j++) {
      opt6[i].push_back({adj[i][j], adj_id[i][j]});
    }
    sort(opt6[i].begin(), opt6[i].end(), cmp6);
  }
  for(int i=1; i<=m; i++) { // O(m)
    int forward, backward;
    forward = dist1[e[i].first.first][e[i].first.second] + e[i].second.first;
    int mi = (e[i].first.first == n ? 0 : 1e18);
    mi = min(mi, opt1[e[i].first.first]);
    forward += mi;
    forward = min(forward, dist1[e[i].first.first][n]);
    
    int pt1 = (e[i].first.first == 1 ? 0 : 1e18);
    int pt2 = (e[i].first.first == n ? 0 : 1e18);
    pt1 = min(pt1, opt2[e[i].first.first]);
    for(pair<pair<int,int>, int> x: opt5[e[i].first.first]) {
      if(x.second == i) {
        continue;
      }
      pt2 = min(pt2, revn[e[i].first.first][x.first.first] + x.first.second);
      break;
    }
    forward = min(forward, pt1 + pt2);
    backward = distn[e[i].first.first][e[i].first.second] + e[i].second.first;
    mi = (e[i].first.first == 1 ? 0 : 1e18);
    mi = min(mi, opt3[e[i].first.first]);
    backward += mi;
    backward = min(backward, distn[e[i].first.first][1]);
    pt1 = (e[i].first.first == n ? 0 : 1e18);
    pt2 = (e[i].first.first == 1 ? 0 : 1e18);
    pt1 = min(pt1, opt4[e[i].first.first]);
    for(pair<pair<int,int>, int> x: opt6[e[i].first.first]) {
      if(x.second == i) {
        continue;
      }
      pt2 = min(pt2, rev1[e[i].first.first][x.first.first] + x.first.second);
      break;
    }
    backward = min(backward, pt1 + pt2);
    ans = min(ans, forward + backward + e[i].second.second);
    //cout << "flip pair<pair<int,int>,pair<int,int> > " << i << ": " << forward << " + " << backward << " + " << e[i].second.second << " = " << forward + backward + e[i].second.second << "\n";
  }
  cout << (ans <= 1e12 ? ans : -1) << "\n";
}

Compilation message

ho_t4.cpp: In function 'int32_t main()':
ho_t4.cpp:152:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for(int j=0; j<adj[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~~
ho_t4.cpp:157:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |     for(int j=0; j<adj[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2252 KB Output is correct
2 Correct 31 ms 2132 KB Output is correct
3 Correct 74 ms 2184 KB Output is correct
4 Correct 67 ms 2188 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 30 ms 2132 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 84 ms 2188 KB Output is correct
11 Correct 75 ms 2204 KB Output is correct
12 Correct 72 ms 2188 KB Output is correct
13 Correct 51 ms 2184 KB Output is correct
14 Correct 55 ms 2188 KB Output is correct
15 Correct 56 ms 2180 KB Output is correct
16 Correct 58 ms 2180 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 9960 KB Output is correct
2 Correct 485 ms 9756 KB Output is correct
3 Correct 482 ms 10144 KB Output is correct
4 Correct 66 ms 2364 KB Output is correct
5 Correct 46 ms 2252 KB Output is correct
6 Correct 32 ms 2140 KB Output is correct
7 Correct 28 ms 2132 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 307 ms 10316 KB Output is correct
10 Correct 314 ms 10320 KB Output is correct
11 Correct 328 ms 9964 KB Output is correct
12 Correct 333 ms 9832 KB Output is correct
13 Correct 327 ms 9888 KB Output is correct
14 Correct 329 ms 10844 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2192 KB Output is correct
2 Correct 40 ms 2132 KB Output is correct
3 Correct 388 ms 8184 KB Output is correct
4 Correct 29 ms 2132 KB Output is correct
5 Correct 475 ms 9716 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 390 ms 10572 KB Output is correct
9 Correct 293 ms 10220 KB Output is correct
10 Correct 345 ms 9776 KB Output is correct
11 Correct 349 ms 9636 KB Output is correct
12 Correct 324 ms 10020 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 329 ms 10264 KB Output is correct
20 Correct 344 ms 9824 KB Output is correct
21 Correct 329 ms 9632 KB Output is correct
22 Correct 341 ms 9680 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2252 KB Output is correct
2 Correct 31 ms 2132 KB Output is correct
3 Correct 74 ms 2184 KB Output is correct
4 Correct 67 ms 2188 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 30 ms 2132 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 84 ms 2188 KB Output is correct
11 Correct 75 ms 2204 KB Output is correct
12 Correct 72 ms 2188 KB Output is correct
13 Correct 51 ms 2184 KB Output is correct
14 Correct 55 ms 2188 KB Output is correct
15 Correct 56 ms 2180 KB Output is correct
16 Correct 58 ms 2180 KB Output is correct
17 Correct 499 ms 9960 KB Output is correct
18 Correct 485 ms 9756 KB Output is correct
19 Correct 482 ms 10144 KB Output is correct
20 Correct 66 ms 2364 KB Output is correct
21 Correct 46 ms 2252 KB Output is correct
22 Correct 32 ms 2140 KB Output is correct
23 Correct 28 ms 2132 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 307 ms 10316 KB Output is correct
26 Correct 314 ms 10320 KB Output is correct
27 Correct 328 ms 9964 KB Output is correct
28 Correct 333 ms 9832 KB Output is correct
29 Correct 327 ms 9888 KB Output is correct
30 Correct 329 ms 10844 KB Output is correct
31 Correct 54 ms 2192 KB Output is correct
32 Correct 40 ms 2132 KB Output is correct
33 Correct 388 ms 8184 KB Output is correct
34 Correct 29 ms 2132 KB Output is correct
35 Correct 475 ms 9716 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 390 ms 10572 KB Output is correct
39 Correct 293 ms 10220 KB Output is correct
40 Correct 345 ms 9776 KB Output is correct
41 Correct 349 ms 9636 KB Output is correct
42 Correct 324 ms 10020 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 329 ms 10264 KB Output is correct
50 Correct 344 ms 9824 KB Output is correct
51 Correct 329 ms 9632 KB Output is correct
52 Correct 341 ms 9680 KB Output is correct
53 Correct 618 ms 9636 KB Output is correct
54 Correct 605 ms 9764 KB Output is correct
55 Correct 613 ms 9824 KB Output is correct
56 Correct 64 ms 2196 KB Output is correct
57 Correct 76 ms 2188 KB Output is correct
58 Correct 519 ms 8056 KB Output is correct
59 Correct 554 ms 7992 KB Output is correct
60 Correct 515 ms 8008 KB Output is correct
61 Correct 505 ms 8048 KB Output is correct
62 Correct 522 ms 8004 KB Output is correct
63 Correct 520 ms 7996 KB Output is correct
64 Execution timed out 1076 ms 4724 KB Time limit exceeded
65 Halted 0 ms 0 KB -