제출 #36207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36207		WhipppedCream	새로운 문제 (POI13_cen)	C++14	0 / 100	113 ms	11204 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];
vector< ii > adj2[maxn];
int dist[maxn];
ll len[maxn];
ll cost(int x)
{
    return 1LL*min(2*a, b)*(x/2)+a*(x%2);
}
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<= n; i++) dist[i] = len[i] = 1e9;
    for(int i = 1; i<= m; i++)
    {
        int a, b; scanf("%d %d", &a, &b);
        adj[a].pb(b); adj[b].pb(a);
    }
    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);
            }
        }
    }
    for(int i = 1; i<= n; i++) len[i] = cost(dist[i]);
    for(int i = 1; i<= n; i++)
    {
        for(auto v : adj[i])
        {
            if(v == k) continue;
            if(dist[i]%2 == dist[v]%2)
            {
                len[i] = min(1LL*len[i], cost(dist[v]+1));
                len[v] = min(1LL*len[v], cost(dist[i]+1));
            }
        }
    }
    for(int i = 1; i<= n; i++) printf("%lld\n", len[i]);
}

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

cen.cpp: In function 'int main()':
cen.cpp:29: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:33: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: 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