oj.uz

답안 #36204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36204 2017-12-06T10:31:58 Z WhipppedCream Price List (POI13_cen) C++14
0 / 100
 129 ms 10812 KB 
#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];
int len[maxn];
int cost(int x)
{
    return 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++)
    {
        if(i == k) continue;
        for(auto v : adj[i])
        {
            if(v == k) continue;
            if(dist[i]%2 == dist[v]%2)
            {
                len[i] = min(len[i], cost(dist[i]+1));
                len[v] = min(len[v], cost(dist[v]+1));
            }
        }
    }
    for(int i = 1; i<= n; i++) printf("%d\n", len[i]);
}

Compilation message

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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7488 KB Output is correct
2 Correct 0 ms 7488 KB Output is correct
3 Incorrect 0 ms 7488 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7488 KB Output is correct
2 Correct 0 ms 7488 KB Output is correct
3 Incorrect 3 ms 7488 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7488 KB Output is correct
2 Correct 3 ms 7488 KB Output is correct
3 Incorrect 0 ms 7488 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7888 KB Output is correct
2 Correct 9 ms 7888 KB Output is correct
3 Incorrect 16 ms 7884 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 8940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 9904 KB Output is correct
2 Correct 49 ms 9508 KB Output is correct
3 Incorrect 103 ms 9732 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 79 ms 10452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 113 ms 10812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 79 ms 10540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 10656 KB Output is correct
2 Correct 106 ms 10524 KB Output is correct
3 Incorrect 116 ms 10656 KB Output isn't correct
4 Halted 0 ms 0 KB -