Submission #1153887

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1153887	2025-02-20 05:54:57	h1euct	Commuter Pass (JOI18_commuter_pass)	C++20	0 / 100	234 ms	21588 KiB

commuter_pass

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 fi first
#define se second
#define int long long
const int MX = 1e5 + 5;
const int MOD = 1e9 + 7;
int n, m, s, t, u, v;
vector<pair<int, int>> adj[MX];
int Ls[MX], Lt[MX];
void dijkstra(int i1, int L[]) {
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
  for (int i = 1; i <= n; i++) L[i] = 1e18;
  L[i1] = 0;
  q.push({L[i1], i1});
  while (!q.empty()) {
    int u = q.top().se;
    int du = q.top().fi;
    q.pop();
    if (du != L[u]) continue;
    for (auto it : adj[u]) {
      int v = it.se;
      int uv = it.fi;
      if (du + uv < L[v]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 16
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 45