# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30118 | cdemirer | 007 (CEOI14_007) | C++14 | 986 ms | 25796 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;
typedef pair<ll, ll> llp;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
int N, M;
int Z, D, SV1, SV2;
vvi edges;
int sv1dists[200000], sv2dists[200000];
void dijsktra(int *dists, int s) {
set<ii> S;
for (int i = 0; i < N; i++) {
if (i == s) {
dists[i] = 0;
S.insert(mp(dists[i], i));
continue;
}
dists[i] = (int)1e9;
S.insert(mp(dists[i], i));
}
while ( ! S.empty() ) {
ii x = *S.begin();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |