# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426109 | someone | Crocodile's Underground City (IOI11_crocodile) | C++14 | 930 ms | 77984 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 "crocodile.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
struct Node {
ll i, t;
bool operator <(const Node& other) const {
return t > other.t;
}
};
const ll N = 1e5 + 10, INF = 1e18;
priority_queue<Node> q;
vector<ll> adj[N], len[N];
ll n, m, dist[N][2];
void Dijkstra() {
while(!q.empty()) {
Node node = q.top();
q.pop();
int i = node.i, t = adj[i].size();
if(dist[i][1] == node.t) {
for(int j = 0; j < t; j++) {
ll nex = adj[i][j],
time = dist[i][1] + len[i][j];
if(time < dist[nex][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... |