Submission #1184933

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184933		swishy123	Crocodile's Underground City (IOI11_crocodile)	C++20	100 / 100	652 ms	86368 KiB

crocodile

#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
#include <chrono>
#include <set>
#include <map>
#include <stack>
#include <functional>
#include <iomanip>
#include <queue>
#include <cassert>
#include <complex>
#include <cstring>
#include <memory>
#include <bitset>
#include <sstream>
#include <cmath>
#include <numeric>
#include <numbers>
#include <fstream>
#include "crocodile.h"

using namespace std;

#ifndef template
#ifndef define
 
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define pi pair<int, int>
#define nl cout << '\n';
#define x first
#define y second 
#define cbit(x) __builtin_popcountll(x)
#define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) 
#define siz(x) (int)x.size()
 
#endif
 
#ifndef print
void print(size_t x) {cout << x << ' ';}
void print(int x) {cout << x << ' ';}
void print(long long x) {cout << x << ' ';}
void print(float x) {cout << x << ' ';}
void print(long double x) {cout << x << ' ';}
void print(char x) {cout << x << ' ';}
void print(const char* x) {cout << x << ' ';}
void print(bool x) {cout << x << ' ';}
void print(string &x) {cout << x << ' ';}
 
template<typename T, typename V>
void print(pair<T, V> &p) {print(p.x); print(p.y);}
template<typename T>
void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);}
template<typename T>
void print(vector<vector<T>> v) {
    for (int i = 0; i < v.size(); i++){
        for (int j = 0; j < v[i].size(); j++)
            print(v[i][j]);
        nl;
    }
}
template <typename T, typename... V>
void print(T t, V&&... v) {print(t); print(v...);}
 
#endif
 
#ifndef read
void read(int &x) {cin >> x;}
void read(long long &x) {cin >> x;}
void read(unsigned &x) {cin >> x;}
void read(unsigned long long &x) {cin >> x;}
void read(float &x) {cin >> x;}
void read(long double &x) {cin >> x;}
void read(char &x) {cin >> x;}
void read(string &x) {cin >> x;}
void read(bool &x) {cin >> x;}
 
template<typename T> 
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++)
        read(v[i]);
}
template <typename T, typename... V>
void read(T &t, V&... v) {read(t); read(v...);}
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool maxi(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool mini(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}
template<class... Args>
auto vec(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector(n, args...);
    else
        return vector(n, vec(args...));
}

#endif

using namespace std;
const ll inf = 1e18;
const ll def = 1e5+1;
const ll mod = 1e9;

pair<pl, pl> cmb(pair<pl, pl> a, pl val){
    if (val.y == a.x.y)
        return {min(a.x, val), a.y};
    else if (val.y == a.y.y){
        if (val.x < a.x.x)
            return {val, a.x};
        else
            return {a.x, min(val, a.y)};
    }
    else{
        if (val.x < a.x.x)
            return {val, a.x};
        else
            return {a.x, min(val, a.y)};
    }
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    vector<vector<pi>> edg(N);
    for (int i = 0; i < M; i++){
        int u = R[i][0], v = R[i][1], w = L[i];
        edg[u].push_back({v, w});
        edg[v].push_back({u, w});
    }
    vector<pair<pl, pl>> dp(N, {{inf, -1}, {inf, -1}});
    priority_queue<pair<pair<pl, pl>, int>, vector<pair<pair<pl, pl>, int>>, greater<pair<pair<pl, pl>, int>>> pq;

    for (int i = 0; i < K; i++){
        int u = P[i];
        dp[u] = {{0, -1}, {0, -1}};
        pq.push({{{0, -1}, {0, -1}}, u});
    }
    while (pq.size()){
        int u = pq.top().y;
        auto val = pq.top().x;

        pq.pop();
        if (dp[u] != val)
            continue;
        for (auto [v, w] : edg[u]){
            auto nval = cmb(dp[v], {val.y.x + w, u});
            if (nval != dp[v]){
                pq.push({nval, v});
                dp[v] = nval;
            }
        }
    }
    return dp[0].y.x;
}

// void solve(){  
//     int n, m, k;
//     read(n, m, k);

//     int r[m][2], l[m], p[k];
//     for (int i = 0; i < m; i++)
//         read(r[i][0], r[i][1], l[i]);
//     for (int i = 0; i < k; i++)
//         read(p[i]);
//     print(travel_plan(n, m, r, l, k, p));
// }       

// /*
// 1 2 3 4 
// 2 3 4 1 
// */

// int32_t main(){
//     ios_base::sync_with_stdio(0);
//     cin.tie(0); cout.tie(0);

//     // if (ifstream("input.txt").good()){
//     //     freopen("input.txt", "r", stdin);
//     //     freopen("output.txt", "w", stdout);
//     // }

//     int t;  
//     t = 1;

//     while (t--){
//         solve();
//         nl;
//     }
// }

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11