Submission #426109

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
4261092021-06-13 14:14:23someoneCrocodile's Underground City (IOI11_crocodile)C++14
100 / 100
930 ms77984 KiB
#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])
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...