# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1123411 | whoknow | Commuter Pass (JOI18_commuter_pass) | C++20 | 462 ms | 21548 KiB |
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define MAXN 100005
#define ii pair<ll,int>
#define bit(i,j) ((i>>j)&1)
#define sz(i) (int)i.size()
#define endl '\n'
using namespace std;
const ll INF = 1e18 + 7;
int n, m, S, T, U, V;
vector<ii>g[MAXN];
namespace sub1
{
ll d[4][MAXN], dp1[MAXN], dp2[MAXN];
void bfs(int k, int st)
{
for(int i = 1; i <= n; i++)
d[k][i] = INF;
priority_queue<ii, vector<ii>, greater<ii>>q;
q.push({0, st});
d[k][st] = 0;
while(q.empty() != 1)
{
ii top = q.top();
q.pop();
ll kc = top.F;
int u = top.S;
for(ii i : g[u])
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |