oj.uz

Submission #705738

# Submission time Handle Problem Language Result Execution time Memory
705738 2023-03-05T04:24:07 Z cig32 Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 11184 KB 
#pragma GCC optimize("Ofast")
#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++) { // O(nm)
    vector<pair<int, int> > adj[n+1], rev[n+1];
    bool in[n+1];
    deque<int> q;
    for(int i=1; i<=m; i++) {
      if(e[i].first.first != b && e[i].first.second != b) {
        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 tg, now;
    for(int i=1; i<=n; i++) in[i] = 0;
    in[1] = 1;
    q.push_back(1);
    tg = rnd(3, 12), now = 0;
    while(q.size()) {
      int f = q.front();
      q.pop_front();
      in[f] = 0;
      for(pair<int, int> x: adj[f]) {
        if(dist1[b][x.first] > dist1[b][f] + x.second) {
          dist1[b][x.first] = dist1[b][f] + x.second;
          if(!in[x.first]) {
            in[x.first] = 1;
            now++;
            if(now == tg) tg = rnd(3, 12), now = 0, q.push_front(x.first);
            q.push_back(x.first);
          }
        }
      }
    }
 
    in[n] = 1;
    q.push_back(n);
    tg = rnd(3, 12), now = 0;
    while(q.size()) {
      int f = q.front();
      q.pop_front();
      in[f] = 0;
      for(pair<int, int> x: adj[f]) {
        if(distn[b][x.first] > distn[b][f] + x.second) {
          distn[b][x.first] = distn[b][f] + x.second;
          if(!in[x.first]) {
            in[x.first] = 1;
            now++;
            if(now == tg) tg = rnd(3, 12), now = 0, q.push_front(x.first);
            q.push_back(x.first);
          }
        }
      }
    }
 
    in[1] = 1;
    q.push_back(1);
    tg = rnd(3, 12), now = 0;
    while(q.size()) {
      int f = q.front();
      q.pop_front();
      in[f] = 0;
      for(pair<int, int> x: rev[f]) {
        if(rev1[b][x.first] > rev1[b][f] + x.second) {
          rev1[b][x.first] = rev1[b][f] + x.second;
          if(!in[x.first]) {
            in[x.first] = 1;
            now++;
            if(now == tg) tg = rnd(3, 12), now = 0, q.push_front(x.first);
            q.push_back(x.first);
          }
        }
      }
    }
 
    in[n] = 1;
    q.push_back(n);
    tg = rnd(3, 12), now = 0;
    while(q.size()) {
      int f = q.front();
      q.pop_front();
      in[f] = 0;
      for(pair<int, int> x: rev[f]) {
        if(revn[b][x.first] > revn[b][f] + x.second) {
          revn[b][x.first] = revn[b][f] + x.second;
          if(!in[x.first]) {
            in[x.first] = 1;
            now++;
            if(now == tg) tg = rnd(3, 12), now = 0, q.push_front(x.first);
            q.push_back(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";
}
/*
5 6
1 2 1 10000
2 5 1 10000
5 3 1 10000
2 3 10 1
2 4 1 10000
4 1 1 10000
 
2 2
1 2 3 4
1 2 3 9
 
3 4
1 2 3 4
2 3 3 9
2 1 3 10
2 3 3 11
 
2 7
1 2 1 1
1 2 1 7
1 2 1 3
1 2 1 4
1 2 1 5
1 2 1 6
1 2 1 9
*/

Compilation message

ho_t4.cpp: In function 'int32_t main()':
ho_t4.cpp:164: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]
  164 |     for(int j=0; j<adj[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~~
ho_t4.cpp:169: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]
  169 |     for(int j=0; j<adj[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2276 KB Output is correct
2 Correct 5 ms 2132 KB Output is correct
3 Correct 29 ms 2280 KB Output is correct
4 Correct 31 ms 2280 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 6 ms 2128 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 55 ms 2252 KB Output is correct
11 Correct 58 ms 2276 KB Output is correct
12 Correct 67 ms 2256 KB Output is correct
13 Correct 20 ms 2388 KB Output is correct
14 Correct 28 ms 2264 KB Output is correct
15 Correct 26 ms 2268 KB Output is correct
16 Correct 27 ms 2300 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 593 ms 10056 KB Output is correct
2 Correct 589 ms 9816 KB Output is correct
3 Correct 628 ms 10064 KB Output is correct
4 Correct 41 ms 2372 KB Output is correct
5 Correct 22 ms 2272 KB Output is correct
6 Correct 11 ms 2120 KB Output is correct
7 Correct 7 ms 2096 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 452 ms 10488 KB Output is correct
10 Correct 471 ms 10740 KB Output is correct
11 Correct 568 ms 10292 KB Output is correct
12 Correct 548 ms 10380 KB Output is correct
13 Correct 555 ms 10032 KB Output is correct
14 Correct 596 ms 11184 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2280 KB Output is correct
2 Correct 7 ms 2132 KB Output is correct
3 Correct 357 ms 7976 KB Output is correct
4 Correct 6 ms 2132 KB Output is correct
5 Correct 464 ms 9812 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 424 ms 10588 KB Output is correct
9 Correct 422 ms 10416 KB Output is correct
10 Correct 456 ms 9860 KB Output is correct
11 Correct 481 ms 9824 KB Output is correct
12 Correct 473 ms 10228 KB Output is correct
13 Correct 0 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 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 464 ms 10364 KB Output is correct
20 Correct 461 ms 9888 KB Output is correct
21 Correct 470 ms 10000 KB Output is correct
22 Correct 467 ms 9972 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2276 KB Output is correct
2 Correct 5 ms 2132 KB Output is correct
3 Correct 29 ms 2280 KB Output is correct
4 Correct 31 ms 2280 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 6 ms 2128 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 55 ms 2252 KB Output is correct
11 Correct 58 ms 2276 KB Output is correct
12 Correct 67 ms 2256 KB Output is correct
13 Correct 20 ms 2388 KB Output is correct
14 Correct 28 ms 2264 KB Output is correct
15 Correct 26 ms 2268 KB Output is correct
16 Correct 27 ms 2300 KB Output is correct
17 Correct 593 ms 10056 KB Output is correct
18 Correct 589 ms 9816 KB Output is correct
19 Correct 628 ms 10064 KB Output is correct
20 Correct 41 ms 2372 KB Output is correct
21 Correct 22 ms 2272 KB Output is correct
22 Correct 11 ms 2120 KB Output is correct
23 Correct 7 ms 2096 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 452 ms 10488 KB Output is correct
26 Correct 471 ms 10740 KB Output is correct
27 Correct 568 ms 10292 KB Output is correct
28 Correct 548 ms 10380 KB Output is correct
29 Correct 555 ms 10032 KB Output is correct
30 Correct 596 ms 11184 KB Output is correct
31 Correct 24 ms 2280 KB Output is correct
32 Correct 7 ms 2132 KB Output is correct
33 Correct 357 ms 7976 KB Output is correct
34 Correct 6 ms 2132 KB Output is correct
35 Correct 464 ms 9812 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 424 ms 10588 KB Output is correct
39 Correct 422 ms 10416 KB Output is correct
40 Correct 456 ms 9860 KB Output is correct
41 Correct 481 ms 9824 KB Output is correct
42 Correct 473 ms 10228 KB Output is correct
43 Correct 0 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 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 320 KB Output is correct
49 Correct 464 ms 10364 KB Output is correct
50 Correct 461 ms 9888 KB Output is correct
51 Correct 470 ms 10000 KB Output is correct
52 Correct 467 ms 9972 KB Output is correct
53 Correct 596 ms 9712 KB Output is correct
54 Correct 568 ms 9936 KB Output is correct
55 Correct 599 ms 9920 KB Output is correct
56 Correct 30 ms 2296 KB Output is correct
57 Correct 32 ms 2304 KB Output is correct
58 Correct 631 ms 8248 KB Output is correct
59 Correct 680 ms 8336 KB Output is correct
60 Correct 693 ms 8072 KB Output is correct
61 Correct 632 ms 8224 KB Output is correct
62 Correct 637 ms 8080 KB Output is correct
63 Correct 653 ms 8196 KB Output is correct
64 Execution timed out 1082 ms 5328 KB Time limit exceeded
65 Halted 0 ms 0 KB -