제출 #1116875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116875		Mher777	Evacuation plan (IZhO18_plan)	C++17	100 / 100	543 ms	70764 KiB

plan

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 100005, M = 30;
int sz[N], p[N], up[N][M][2], tin[N], tout[N];
vector<pii> g[N], gt[N];
int dist[N];
int n, m, k, q, timer, lg;

void dfs(int u = 1, int par = 1, int len = MAX) {
    tin[u] = ++timer;
    up[u][0][0] = par;
    up[u][0][1] = len;
    for (int l = 1; l <= lg; ++l) {
        up[u][l][0] = up[up[u][l - 1][0]][l - 1][0];
        len = min(len, up[up[u][l - 1][0]][l - 1][1]);
        up[u][l][1] = len;
    }
    for (auto to : gt[u]) {
        if (to.ff == par) continue;
        dfs(to.ff, u, to.ss);
    }
    tout[u] = ++timer;
}

bool upper(int x, int y) {
    return (tin[x] <= tin[y] && tout[x] >= tout[y]);
}

int lca(int x, int y) {
    if (upper(x, y)) return x;
    if (upper(y, x)) return y;
    for (int l = lg; l >= 0; --l) {
        if (!upper(up[x][l][0], y)) x = up[x][l][0];
    }
    return up[x][0][0];
}

int find_ans(int x, int y) {
    int lc = lca(x, y), ret = MAX;
    for (int l = lg; l >= 0; --l) {
        if (!upper(up[x][l][0], lc)) {
            ret = min(ret, up[x][l][1]);
            x = up[x][l][0];
        }
    }
    if (x != lc) {
        ret = min(ret, up[x][0][1]);
    }
    for (int l = lg; l >= 0; --l) {
        if (!upper(up[y][l][0], lc)) {
            ret = min(ret, up[y][l][1]);
            y = up[y][l][0];
        }
    }
    if (y != lc) {
        ret = min(ret, up[y][0][1]);
    }
    return ret;
}

void make_set(int x) {
    sz[x] = 1;
    p[x] = x;
}

int find_set(int x) {
    if (x == p[x]) return x;
    return p[x] = find_set(p[x]);
}

void union_sets(int x, int y) {
    x = find_set(x), y = find_set(y);
    if (x == y) return;
    if (sz[x] > sz[y]) swap(x, y);
    p[x] = y;
    sz[y] += sz[x];
}

void slv() {
    cin >> n >> m;
    lg = log2(n);
    for (int i = 0; i < m; ++i) {
        int x, y, w;
        cin >> x >> y >> w;
        g[x].pub({ y,w });
        g[y].pub({ x,w });
    }
    for (int i = 1; i <= n; ++i) {
        dist[i] = MAX;
        make_set(i);
    }
    cin >> k;
    priority_queue<pii> pq;
    for (int i = 0; i < k; ++i) {
        int x;
        cin >> x;
        dist[x] = 0;
        pq.push({ dist[x],x });
    }
    while (!pq.empty()) {
        int u = pq.top().ss, her = -pq.top().ff;
        pq.pop();
        if (her > dist[u]) continue;
        for (auto to : g[u]) {
            if (dist[to.ff] > dist[u] + to.ss) {
                dist[to.ff] = dist[u] + to.ss;
                pq.push({ -dist[to.ff],to.ff });
            }
        }
    }
    vector<pair<int, pii>> edge;
    for (int i = 1; i <= n; ++i) {
        for (auto& to : g[i]) {
            to.ss = min(dist[to.ff], dist[i]);
            edge.pub({ -to.ss,{i,to.ff} });
        }
    }
    sort(all(edge));
    for (auto elem : edge) {
        int u = elem.ss.ff, v = elem.ss.ss;
        if (find_set(u) == find_set(v)) continue;
        gt[u].pub({ v,-elem.ff });
        gt[v].pub({ u,-elem.ff });
        union_sets(u, v);
    }
    dfs();
    cin >> q;
    while (q--) {
        int x, y;
        cin >> x >> y;
        cout << find_ans(x, y) << '\n';
    }
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

plan.cpp: In function 'll range_sum(ll, ll)':
plan.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
plan.cpp: In function 'll bin_to_dec(std::string)':
plan.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 19 / 19
• Subtask 5: 46 / 46