Submission #90132

#	Time	Username	Problem	Language	Result	Execution time	Memory
90132		blast	Evacuation plan (IZhO18_plan)	C++14	23 / 100	586 ms	20512 KiB

plan

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair < int, int > pii;
typedef pair < long long, long long > pll;

const int N = 1e5 + 7, inf = 1e9 + 7;
const ll INF = 1e18 + 7;

const int X[] = {1, -1, 0, 0};
const int Y[] = {0, 0, 1, -1};

int n, m, d[N], k, ans, us[N], s, t;

vector < pii > g[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        d[i] = inf;
    }
    for (int i = 1, u, v, x; i <= m; i++) {
        cin >> u >> v >> x;
        g[u].push_back(make_pair(v, x));
        g[v].push_back(make_pair(u, x));
    }
    set < pair <int, int> > st;
    cin >> k;
    for (int i = 1, x; i <= k; i++) {
        cin >> x;
        d[x] = 0;
        st.insert(make_pair(0, x));
    }
    while(!st.empty()) {
        int x = st.begin() -> second;
        st.erase(st.begin());
        for (int i = 0; i < g[x].size(); ++i) {
            int to = g[x][i].first, len = g[x][i].second;
            if (d[x] + len < d[to]) {
                st.erase(make_pair(d[to], to));
                d[to] = d[x] + len;
                st.insert(make_pair(d[to], to));
            }
        }
    }
    int q;
    cin >> q;
    while(q--) {
        cin >> s >> t;
        cout << min(d[s], d[t]) << '\n';
    }
    return 0;
}

Compilation message (stderr)

plan.cpp: In function 'int main()':
plan.cpp:41:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < g[x].size(); ++i) {
                         ~~^~~~~~~~~~~~~

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