Submission #956342

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
956342	2024-04-01T16:20:30 Z	serifefedartar	Price List (POI13_cen)	C++17	100 / 100	58 ms	16112 KB

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

#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 20
const ll MOD = 998244353;
const ll MAXN = 1e5 + 100;

#define int long long
vector<vector<int>> graph, graph2;
int dist1[MAXN], dist2[MAXN], vis[MAXN];

signed main() {
    fast
    int n, m, k, a, b;
    cin >> n >> m >> k >> a >> b;

    graph = vector<vector<int>>(n+1, vector<int>());
    for (int i = 0; i < m; i++) {
        int q, p;
        cin >> q >> p;
        graph[q].push_back(p);
        graph[p].push_back(q);
    }
    graph2 = graph;
    for (int i = 1; i <= n; i++)
        sort(graph[i].begin(), graph[i].end());

    queue<pair<int,int>> q;
    q.push({0, k});
    for (int i = 0; i <= n; i++)
        dist1[i] = dist2[i] = 1e15;
    dist2[k] = dist1[k] = 0;
    while (!q.empty()) {
        int node = q.front().s;
        q.pop();

        if (vis[node])
            continue;
        vis[node] = true;

        for (auto u : graph[node]) {
            if (dist1[u] > dist1[node] + 1) {
                dist1[u] = dist1[node] + 1;
                q.push({dist1[u], u});
            }
        }
    }
    
    for (int i = 0; i <= n; i++)
        vis[i] = false;
    q.push({0, k});
    vis[k] = true;
    while (!q.empty()) {
        int node = q.front().s;
        q.pop();

        for (auto node1 : graph[node]) {
            for (auto node2 : graph2[node1]) {
                if (vis[node2])
                    continue;
                /*
                if (*lower_bound(graph[node].begin(), graph[node].end(), node2) == node2)
                    continue;
                */
                if (binary_search(graph[node].begin(), graph[node].end(), node2))
                    continue;

                dist2[node2] = dist2[node] + 1;
                vis[node2] = true;
                q.push({dist2[node2], node2});
            }

            vector<int> v;
            for (auto node2 : graph2[node1])
                if (!vis[node2])
                    v.push_back(node2);
            swap(graph2[node1], v);
        }
    }

    for (int i = 1; i <= n; i++) {
        if (dist1[i] % 2 == 0)
            cout << min(dist1[i] * a, (dist1[i] / 2) * b) << "\n";
        else
            cout << min({dist1[i] * a, dist2[i] * b, (dist1[i] / 2) * b + a}) << "\n";
    }
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	2 ms	2396 KB	Output is correct
3	Correct	1 ms	2552 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2904 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4088 KB	Output is correct
2	Correct	7 ms	3932 KB	Output is correct
3	Correct	7 ms	4164 KB	Output is correct
4	Correct	7 ms	4188 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	7736 KB	Output is correct
2	Correct	19 ms	7736 KB	Output is correct
3	Correct	18 ms	6492 KB	Output is correct
4	Correct	24 ms	8272 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	11312 KB	Output is correct
2	Correct	36 ms	10068 KB	Output is correct
3	Correct	46 ms	11608 KB	Output is correct
4	Correct	43 ms	12116 KB	Output is correct
5	Correct	35 ms	12756 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	12984 KB	Output is correct
2	Correct	38 ms	10320 KB	Output is correct
3	Correct	46 ms	11884 KB	Output is correct
4	Correct	41 ms	12372 KB	Output is correct
5	Correct	41 ms	14172 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	14892 KB	Output is correct
2	Correct	42 ms	13656 KB	Output is correct
3	Correct	50 ms	12884 KB	Output is correct
4	Correct	43 ms	12120 KB	Output is correct
5	Correct	56 ms	15600 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	13904 KB	Output is correct
2	Correct	48 ms	13904 KB	Output is correct
3	Correct	52 ms	13288 KB	Output is correct
4	Correct	43 ms	12416 KB	Output is correct
5	Correct	51 ms	16112 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	48 ms	14416 KB	Output is correct
2	Correct	47 ms	14428 KB	Output is correct
3	Correct	58 ms	14928 KB	Output is correct
4	Correct	47 ms	11652 KB	Output is correct
5	Correct	48 ms	15444 KB	Output is correct

Submission #956342

Compilation message