Submission #1167734

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1167734	2025-03-16 12:35:35	kla	Commuter Pass (JOI18_commuter_pass)	C++20	0 / 100	794 ms	327680 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>
#pragma GCC optimize ("Ofast")
using namespace std;
vector<pair<int, int>>M[100001];
bool biju [100001];
long long U[100001]={};
long long V[100001]={};
long long bals[100001]={};
long long kopy[100001]={};
priority_queue<tuple<long long, int, long long, long long, long long>, vector<tuple<long long, int, long long, long long, long long>>, greater<tuple<long long, int, long long, long long, long long>>>pq;
long long nxt(){
    long long n;
    cin>>n;
    return n;
}
void DjikstrasimU(int sak){
    U[sak]=0, pq.push(make_tuple(0, sak, 0, 0, 0));
    while(pq.size()!=0){
        int v=get<1>(pq.top());
        long long att=get<0>(pq.top());
        pq.pop();
        for(auto c: M[v]){
            if(att+c.second<U[c.first]){
                    U[c.first]=att+c.second, pq.push(make_tuple(U[c.first], c.first, 0, 0, 0));
            }
        }
    }
}
void DjikstrasimV(int sak){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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