oj.uz

Submission #364282

# Submission time Handle Problem Language Result Execution time Memory
364282 2021-02-08T19:38:31 Z tushar_2658 Olympic Bus (JOI20_ho_t4) C++14
5 / 100
 1000 ms 3692 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 205;
using ll = long long;
ll inf = 1e18;

struct E {
  int x, id;
  ll c, d;
  E(int _x, ll _c, ll _d, int _id){
    x = _x, c = _c, d = _d;
    id = _id;
  }
  E(){}
};

vector<E> edges[maxn], g[maxn];
ll dis[2][maxn];
int par[2][maxn];
vector<int> candidates;
int n, m;

void dijkstra(int id, int s){
  memset(dis[id], 63, sizeof dis[id]);
  dis[id][s] = 0;
  using pii = pair<ll, int>;
  priority_queue<pii, vector<pii>, greater<pii>> pq;
  pq.push({0, s});
  vector<bool> vis(n + 1);
  while(!pq.empty()){
    pii src = pq.top();
    pq.pop();
    for(auto i : edges[src.second]){
      ll cost = dis[id][src.second] + i.c;
      if(dis[id][i.x] > cost){
        dis[id][i.x] = cost;
        par[id][i.x] = i.id;
        pq.push({cost, i.x});
      }
    }
  }
}

ll ans = inf;
ll dis1[2][maxn];

void dijkstra1(int id, int s){
  memset(dis1[id], 63, sizeof dis1[id]);
  dis1[id][s] = 0;
  using pii = pair<ll, int>;
  priority_queue<pii, vector<pii>, greater<pii>> pq;
  pq.push({0, s});
  vector<bool> vis(n + 1);
  while(!pq.empty()){
    pii src = pq.top();
    pq.pop();
    for(auto i : g[src.second]){
      ll cost = dis1[id][src.second] + i.c;
      if(dis1[id][i.x] > cost){
        dis1[id][i.x] = cost;
        pq.push({cost, i.x});
      }
    }
  }
}

ll check(int id){
  ll D = 0;
  for(int i = 1; i <= n; ++i)g[i].clear();
  for(int i = 1; i <= n; ++i){
    for(auto j : edges[i]){
      if(j.id != id){
        g[i].push_back(j);
      }else {
        g[j.x].push_back(E(i, j.c, j.d, j.id));
        D = j.d;
      }
    }
  }
  dijkstra1(0, 1);
  dijkstra1(1, n);
  return D + dis1[0][n] + dis1[1][1];
}

int main(int argc, char const *argv[])
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  cin >> n >> m;
  for(int i = 0; i < m; ++i){
    int u, v;
    ll C, D;
    cin >> u >> v >> C >> D;
    edges[u].push_back(E(v, C, D, i));
  }
  memset(par, -1, sizeof par);
  dijkstra(0, 1);
  dijkstra(1, n);
  for(int i = 0; i < 2; ++i){
    for(int j = 1; j <= n; ++j){
      if(par[i][j] != -1){
        candidates.push_back({par[i][j]});
      }
    }
  }
  sort(candidates.begin(), candidates.end());
  candidates.erase(unique(candidates.begin(), candidates.end()), candidates.end());
  ans = min(ans, dis[0][n] + dis[1][1]);
  for(int i = 0; i < m; ++i){
    ans = min(ans, check(i));
  }
  cout << (ans > 1e16 ? -1 : ans) << '\n';

  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 57 ms 492 KB Output is correct
4 Correct 64 ms 492 KB Output is correct
5 Correct 26 ms 396 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 95 ms 500 KB Output is correct
11 Correct 88 ms 492 KB Output is correct
12 Correct 91 ms 748 KB Output is correct
13 Correct 37 ms 492 KB Output is correct
14 Correct 42 ms 492 KB Output is correct
15 Correct 38 ms 492 KB Output is correct
16 Correct 42 ms 492 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1048 ms 3692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 492 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Execution timed out 1088 ms 2924 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 57 ms 492 KB Output is correct
4 Correct 64 ms 492 KB Output is correct
5 Correct 26 ms 396 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 95 ms 500 KB Output is correct
11 Correct 88 ms 492 KB Output is correct
12 Correct 91 ms 748 KB Output is correct
13 Correct 37 ms 492 KB Output is correct
14 Correct 42 ms 492 KB Output is correct
15 Correct 38 ms 492 KB Output is correct
16 Correct 42 ms 492 KB Output is correct
17 Execution timed out 1048 ms 3692 KB Time limit exceeded
18 Halted 0 ms 0 KB -