# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167941 | ricardsjansons | Commuter Pass (JOI18_commuter_pass) | C++20 | 192 ms | 19616 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define remin(a,b...) a=min({a,b})
#define remax(a,b...) a=max({a,b})
#define ll long long
#define ld long double
#define pii array<int,2>
#define pll array<ll,2>
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vii vector<array<int,2>>
#define vll vector<array<ll,2>>
#define v2d(T) vector<vector<T>>
#define v3d(T) vector<vector<vector<T>>>
#define pub push_back
#define tup make_tuple
using namespace std;
const ll C=1e9;
const ll M=2e5;
ll n,m,s,t,u,v;
vector<vll> adj;
vl dij(int x){
vl d(n+1,C*M);
vb vis(n+1);
d[x]=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... |