# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174143 | JuanJL | Event Hopping (BOI22_events) | C++20 | 704 ms | 8596 KiB |
#include <bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define forn(i,a,b) for(int i = a; i < b; i++)
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
typedef int ll;
const int MAXN = 1000+4;
vector<ll> adj[MAXN];
ll n;
ll dijkstra(ll start, ll end){
vector<ll> cost(n,-1);
vector<bool> visit(n,false);
priority_queue<pair<ll,ll>> pq;
pq.push({0,start});
while(!pq.empty()){
ll nd = pq.top().snd;
ll cst = pq.top().fst*-1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |