제출 #1093189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093189		serifefedartar	새로운 문제 (POI13_cen)	C++17	0 / 100	24 ms	8540 KiB

cen

#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 21
const ll MOD = 1e9 + 7;
const ll MAXN = 1e5 + 100;

vector<vector<int>> graph;
int vis[MAXN], dist[MAXN];

int main() {
    fast;
    int N, M, K, A, B, u, v;
    cin >> N >> M >> K >> A >> B;

    graph = vector<vector<int>>(N+1, vector<int>());
    for (int i = 0; i < M; i++) {
        cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    queue<int> q;
    q.push(K);
    while (!q.empty()) {
        int node = q.front();
        q.pop();

        vis[node] = true;
        for (auto u : graph[node]) {
            if (!vis[u]) {
                dist[u] = dist[node] + 1;
                vis[u] = true;
                q.push(u);
            }
        }
    }

    for (int i = 1; i <= N; i++)
        cout << min(dist[i] * A, dist[i] / 2 * B + (dist[i] % 2) * A) << "\n";
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10