# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298274 | shayan_p | Sky Walking (IOI19_walk) | C++17 | 4101 ms | 519948 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>
#include "walk.h"
#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int maxn = 13e6 + 10, inf = 2e9;
const ll INF = 2e18;
ll dis[maxn];
bool mark[maxn];
vector<pii> v[maxn];
ll digi(int a, int b){
fill(dis, dis + maxn, INF);
priority_queue<pli, vector<pli>, greater<pli> > pq;
dis[a] = 0;
pq.push({0, a});
while(sz(pq)){
int u = pq.top().S;
pq.pop();
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |