제출 #36517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36517		WhipppedCream	새로운 문제 (POI13_cen)	C++14	60 / 100	329 ms	28936 KiB

cen

#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vvi vector< vi >
#define vii vector< ii >
#define mp make_pair
#define pb push_back
const int maxn = 1e5+5;
int n, m, k, a, b;
vector<int> adj[maxn];
set<int> has[maxn];
vector<int> active[maxn];
bool vis[maxn];
int dist[maxn];
int dist2[maxn];
void bfs(int *dist)
{
    for(int i = 1; i<= n; i++) dist[i] = 1e9;
    dist[k] = 0;
    queue<int> Q; Q.push(k);
    while(!Q.empty())
    {
        int u = Q.front(); Q.pop();
        for(auto v : adj[u])
        {
            if(dist[v]> dist[u]+1)
            {
                dist[v] = dist[u]+1;
                Q.push(v);
            }
        }
    }
}
void bfs2(int *dist)
{
    for(int i = 1; i<= n; i++) dist[i] = 1e9;
    queue<int> Q; Q.push(k);
    dist[k] = 0; vis[k] = 1;
    for(int i = 1; i<= n; i++) active[i] = adj[i];
    while(!Q.empty())
    {
        int u = Q.front(); Q.pop();
        for(auto v : adj[u])
        {
            vector<int> temp;
            for(auto w : active[v])
            {
                if(vis[w]) continue;
                if(has[u].find(w) != has[u].end()) continue;
                vis[w] = 1;
                dist[w] = dist[u]+1;
                Q.push(w);
                temp.pb(w);
            }
            active[v] = temp;
        }
    }
}
int main()
{
    //#ifndef atom
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    //#endif
    scanf("%d %d %d %d %d", &n, &m, &k, &a, &b);
    for(int i = 1; i<= m; i++)
    {
        int a, b; scanf("%d %d", &a, &b);
        adj[a].pb(b); adj[b].pb(a);
        has[a].insert(b); has[b].insert(a);
    }
    bfs(dist); bfs2(dist2);
    //for(int i = 1; i<= n; i++) printf("%d\n", dist2[i]);
    for(int i = 1; i<= n; i++)
    {
        int x = (dist[i]/2)*min(2*a, b)+(dist[i]%2)*a;
        int y = 2e9;
        if(dist2[i] != 1e9) y = dist2[i]*b;
        printf("%d\n", min(x, y));
    }
}

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

cen.cpp: In function 'int main()':
cen.cpp:70:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d %d", &n, &m, &k, &a, &b);
                                                ^
cen.cpp:73:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int a, b; scanf("%d %d", &a, &b);
                                         ^

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