# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955606 | bunhadasou | Commuter Pass (JOI18_commuter_pass) | C++14 | 262 ms | 38452 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define PB push_back
#define EB emplace_back
#define bit(n,i) ((n>>i)&1)
#define all(x) x.begin(),x.end()
#define ll long long
#define sz(x) (int)x.size()
#define TASK "cf"
using namespace std;
const int maxn=1e5+5;
vector<pair<int,int>> adj[maxn];
vector<int>to[maxn],adj2[maxn],radj[maxn];
int n,m;
int s,t,ss,tt;
bool check[maxn],check2[4][maxn];
ll d[maxn],d2[4][maxn];
void dijkstra(){
memset(check,0,sizeof(check));
memset(d,60,sizeof(d));
priority_queue<pair<ll,int>> pq;
pq.push(mp(0,s));
d[s]=0;
while(!pq.empty()){
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... |