| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 637153 | 2022-08-31T16:28:31 Z | ghostwriter | Crocodile's Underground City (IOI11_crocodile) | C++14 | 0 ms | 0 KB |
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
Tran The Bao
CTL - Da Lat
Cay ngay cay dem nhung deo duoc cong nhan
*/
#define int long long
struct Vertex {
int u, Min, Min1;
Vertex() {}
Vertex(int u, int Min, int Min1) : u(u), Min(Min), Min1(Min1) {}
};
struct cmp {
bool operator()(Vertex a, Vertex b) {
return a.Min1 > b.Min1;
}
};
const int oo = 1e9 + 1;
const int NMAX = 1e5 + 1;
pi d[NMAX];
vpi adj[NMAX];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
FOR(i, 0, N - 1) d[i] = {oo, oo};
FOR(i, 0, M - 1) {
int u = R[i][0], v = R[i][1], w = L[i];
adj[u].pb({v, w});
adj[v].pb({u, w});
}
priority_queue<Vertex, vector<Vertex>, cmp> pq;
FOR(i, 0, K - 1) {
int u = P[i];
d[u] = {0, 0};
pq.push(Vertex(u, 0, 0));
}
WHILE(!pq.empty()) {
Vertex cur = pq.top();
pq.pop();
int u = cur.u, Min = cur.Min, Min1 = cur.Min1;
if (Min1 > d[u].nd) continue;
assert(Min <= Min1);
EACH(j, adj[u]) {
int v = j.st, w = j.nd;
if (d[v].nd > Min1 + w) {
d[v].nd = Min1 + w;
if (d[v].st > d[v].nd) swap(d[v].st, d[v].nd);
pq.push(Vertex(v, d[v].st, d[v].nd));
}
}
}
return d[0].nd;
}
/*
5 4 3
0 1 2
0 2 3
3 2 1
2 4 4
1
3
4
7
5 7 2
0 2 4
0 3 3
3 2 2
2 1 10
0 1 100
0 4 7
3 4 9
1
3
14
*/