제출 #623661

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
623661	2022-08-06 08:58:00	valerikk	Escape Route (JOI21_escape_route)	C++17	35 / 100	2016 ms	145320 KiB

escape_route

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 "escape_route.h"
#include <algorithm>
#include <cassert>
#include <limits>
static const long long INF = 1e18;
static const int MAX_N = 61;
static const int MAX_M = 1771;
std::vector<long long> calculate_necessary_time(
  int N, int M, long long S, int Q, std::vector<int> A, std::vector<int> B,
  std::vector<long long> L, std::vector<long long> C, std::vector<int> U,
  std::vector<int> V, std::vector<long long> T) {
  std::vector<long long> answer(Q, INF);
  std::vector<std::vector<long long>> dists0(N);
  for (int start = 0; start < N; ++start) {
    std::vector<std::vector<long long>> l(N, std::vector<long long>(N, -1));
    std::vector<std::vector<long long>> c(N, std::vector<long long>(N, -1));
    for (int i = 0; i < M; ++i) {
      l[A[i]][B[i]] = l[B[i]][A[i]] = L[i];
      c[A[i]][B[i]] = c[B[i]][A[i]] = C[i]; 
    }
    std::vector<long long> dist(N, INF);
    std::vector<bool> used(N, false);
    dist[start] = 0;
    for (int it = 0; it < N; ++it) {
      int u = -1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 20 / 20
• Subtask 3: 10 / 10
• Subtask 4: 0 / 35
• Subtask 5: 0 / 30