Submission #629935

#	Time	Username	Problem	Language	Result	Execution time	Memory
629935		Abrar_Al_Samit	Olympic Bus (JOI20_ho_t4)	C++17	11 / 100	29 ms	5700 KiB

ho_t4

#include<bits/stdc++.h>
using namespace std;

const int MX = 205;
const long long INF = 1e17;
const int MXM = 5e4 + 5;

struct Edge {
  int from, to, len, invert, id;
  bool vip;

  Edge() {vip = 0;}
  Edge(int _from, int _to, int _len, int _invert, int _id) {
    from = _from, to = _to, len = _len, invert = _invert, id = _id;
    vip = 0;
  }
  bool operator< (const Edge &ot) const {
    return make_pair(vip, id) < make_pair(ot.vip, ot.id);
  }
} List[MXM];

int n, m;
vector<Edge>g[MX], gt[MX];
long long to_one[MX], to_n[MX], from_one[MX], from_n[MX];
int dad[MX];
bool marked[MX];


void dijkstra(int sc, int graph, int ban, long long *a) {
  fill(a+1, a+n+1, INF);
  memset(marked, 0, sizeof marked);

  a[sc] = 0;
  for(int i=0; i<n; ++i) {
    int v = -1;
    for(int j=1; j<=n; ++j) if(!marked[j] && (v==-1 || a[v]>a[j])) {
      v = j;
    }
    if(a[v]==INF) break;
    marked[v] = 1;

    for(auto e : (graph==0?g:gt)[v]) {
      if(a[e.to]>a[v]+e.len) {
        a[e.to] = a[v]+e.len;
        dad[e.to] = e.id;

      }
    }
  }
}
void mark(int f, int t) {
  int cur = f;
  while(cur!=t) {
    List[dad[cur]].vip = 1;
    cur = List[dad[cur]].from;
  }
}
void PlayGround() {
  cin>>n>>m;
  for(int i=0; i<m; ++i) {
    int u, v, c, d;
    cin>>u>>v>>c>>d;
    g[u].push_back(Edge(u, v, c, d, i));
    gt[v].push_back(Edge(v, u, c, d, i));

    List[i] = {u, v, c, d, i};
  }

  dijkstra(1, 0, -1, from_one);
  if(from_one[n]!=INF) mark(n, 1);

  dijkstra(n, 0, -1, from_n);
  if(from_n[1]!=INF) mark(1, n);

  dijkstra(1, 1, -1, to_one);
  dijkstra(n, 1, -1, to_n);

  for(int i=1; i<=n; ++i) {
    for(auto &e : g[i]) {
      e = List[e.id];
    }
  }
  long long ans = min(INF, from_one[n] + from_n[1]);

  sort(List, List+m);

  for(int i=0; i<m; ++i) {
    auto e = List[i];
    if(e.vip) {
      dijkstra(1, 0, e.id, from_one);
      dijkstra(n, 0, e.id, from_n);
    }

    long long u, v, c, d;
    u = e.from, v = e.to, c = e.len, d = e.invert;

    //1->v->u->n->1
    ans = min(ans, from_one[v]+to_n[u]+from_n[1]+c+d);

    //1->v->u->n->v->u->1
    ans = min(ans, from_one[v]+c+to_n[u]+from_n[v]+c+to_one[u]+d);

    //1->n->v->u->1
    ans = min(ans, from_one[n]+from_n[v]+to_one[u]+c+d);
  }

  if(ans==INF) ans = -1;
  cout<<ans<<'\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 11 / 11
• Subtask 3: 0 / 21
• Subtask 4: 0 / 63