Submission #754750

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
754750	2023-06-08 13:35:44	bensonlzl	Commuter Pass (JOI18_commuter_pass)	C++14	16 / 100	382 ms	27068 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;
     
    typedef long long ll;
    typedef pair<ll,ll> pl;
     
    ll N, M, X, Y, S, T, U, V, C, mini = 1e18;
     
     
    ll distS[100005], distT[100005], distU[100005], distV[100005], dp[100005];
    int visit[100005];
    vector<pl> AdjList[100005];
    vector<int> dpList[100005];
     
     
    void dijkstra(int x, ll d[]){
      priority_queue<pl,vector<pl>,greater<pl> > pq;
      for (int i = 1; i <= N; ++i) d[i] = 1e16;
      d[x] = 0;
      pq.push(pl(0,x));
      while (!pq.empty()){
        pl t = pq.top();
        pq.pop();
        ll dt = t.first, v = t.second;
        if (d[v] != dt) continue;
        for (auto it : AdjList[v]){
          if (d[it.first] > d[v] + it.second){
            d[it.first] = d[v] + it.second;
            pq.push(pl(d[it.first],it.first));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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