# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167738 | diana | Commuter Pass (JOI18_commuter_pass) | C++20 | 2097 ms | 75832 KiB |
#include <bits/stdc++.h>
#pragma GCC oprimize("O3, unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define edge pair<ll, int>
#define c first
#define vi second
using namespace std;
typedef long long ll;
const int N = 1e5+5;
const ll M = 1e18;
int n, m, s, t, u, v;
vector<edge> graf[N];
class vertex
{
private:
int v;
vector<ll> dist;
bool dw;
void dijkstra()
{
if(dw)
return;
dist.assign(n+5, M);
priority_queue<edge, vector<edge>, greater<edge>> pq;
bool vis[n] = {};
pq.push({0, v});
dist[v] = 0;
# | 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... |