제출 #287334

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
287334	2020-08-31 15:47:34	reymontada61	Olympic Bus (JOI20_ho_t4)	C++14	100 / 100	466 ms	4216 KiB

ho_t4

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m;
const int MXN = 205, MXM = 50005;
int apsp[MXN][MXN];
int eds[MXM][4];
vector<int> adj[MXN];
int mxh = INT_MAX * 1000ll;
int dist(int src, int dest, int skip) {
  int dists[MXN];
  for (int i=0; i<MXN; i++) dists[i] = mxh;
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> proc;
  proc.push({0, src});
  while (!proc.empty()) {
    auto x = proc.top(); proc.pop();
    int di = x.first, no = x.second;
    if (dists[no] < di) continue;
    dists[no] = di;
    for (auto ed: adj[no]) {
      if (ed != skip) {
        int ot = eds[ed][0] + eds[ed][1] - no;
        int we = eds[ed][2];
        if (dists[ot] > dists[no] + we) {
          dists[ot] = dists[no] + we;
          proc.push({dists[ot], ot});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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