# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930311 | Lukap | Commuter Pass (JOI18_commuter_pass) | C++14 | 474 ms | 35152 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>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 500;
const ll INF = 1e16;
int n, m;
int s,t,u,v;
vector<pair<int, ll> > susjedi[MAXN], parent[MAXN], dag[MAXN];
int bio[MAXN], bio2[MAXN];
queue<int> q;
ll distu[MAXN], distv[MAXN], dists[MAXN];
pair<ll, ll> dp[MAXN];
ll rj = INF;
set<pair<ll, ll> > sett;
void bfs (int x) {
for(int i = 0; i < n; i++){
if(i == s){
sett.insert(make_pair(0,s));
dists[s] = 0;
continue;
}
sett.insert(make_pair(INF,i));
dists[i] = INF;
}
# | 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... |