Submission #890387

#	Time	Username	Problem	Language	Result	Execution time	Memory
890387		vjudge1	Evacuation plan (IZhO18_plan)	C++17	23 / 100	1383 ms	115852 KiB

plan

#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 3e5+5;
struct que { ll u, v; } c[N];
vector<pair<ll, ll>> g[N], t;
ll d[N], ans[N];

void kigash() {
    ll n, m, k, q;
    cin>>n>>m;
    map<pair<ll, ll>, bool> edge;
    for(ll i=1; i<=m; i++) {
        ll u, v, w;
        cin>>u>>v>>w;
        edge[{u, v}] = edge[{v, u}] = 1;
        g[u].pb({v, w}), g[v].pb({u, w});
    }
    cin>>k;
    set<pair<ll, ll>> st;
    for(ll i=1; i<=n; i++) d[i] = inf;
    while(k--) {
        ll v;
        cin>>v;
        st.insert({0, v}), d[v] = 0;
    }
    while(!st.empty()) {
        ll v = (*st.begin()).ss;
        st.erase(st.begin());
        for(auto [to, w]: g[v]) {
            if(d[to]>d[v]+w) {
                st.erase({d[to], to});
                d[to] = d[v]+w;
                st.insert({d[to], to});
            }
        }
    }
    for(ll i=1; i<=n; i++) t.pb({d[i], i});
    sort(rall(t));
    cin>>q;
    while(q--) {
        ll u, v;
        cin>>u>>v;
        if(edge[{u, v}]) cout<<min(d[u], d[v])<<"\n";
        else cout<<"Arman abi skibidi dop dop dop\n";
    }
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

Compilation message (stderr)

plan.cpp: In function 'void freopen(std::string)':
plan.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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