# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176540 | Tsagana | Commuter Pass (JOI18_commuter_pass) | C11 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second
using namespace std;
int n;
int pz[100010], pt[100010];
vector<vector<pair<int, int>>> adj;
vector<int> calc(int a) {
set<pair<int, int>> s;
s.insert({0, a});
vector<int> v(n + 1, 1e18);
v[a] = 0;
while (!s.empty()) {
auto curr = s.begin();
int sum = (*curr).F, i = (*curr).S;