oj.uz

Submission #36211

# Submission time Handle Problem Language Result Execution time Memory
36211 2017-12-06T10:45:34 Z WhipppedCream Price List (POI13_cen) C++14
0 / 100
 123 ms 8600 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];
int odd[maxn];
int eve[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++) odd[i] = eve[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);
    }
    eve[k] = 0;
    queue<ii> Q; Q.push(ii(k, 0));
    while(!Q.empty())
    {
        int u = Q.front().X; int par = Q.front().Y; Q.pop();
        for(auto v : adj[u])
        {
            if(par)
            {
                if(eve[v]> odd[u]+1)
                {
                    eve[v] = odd[u]+1;
                    Q.push(ii(v, 0));
                }
            }
            else
            {
                if(odd[v]> eve[u]+1)
                {
                    odd[v] = eve[u]+1;
                    Q.push(ii(v, 1));
                }
            }
        }
    }
    for(int i = 1; i<= n; i++) printf("%lld\n", min(cost(odd[i]), cost(eve[i])));
}

Compilation message

cen.cpp: In function 'int main()':
cen.cpp:60:80: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
     for(int i = 1; i<= n; i++) printf("%lld\n", min(cost(odd[i]), cost(eve[i])));
                                                                                ^
cen.cpp:28: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:32: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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 0 ms 5144 KB Output is correct
3 Incorrect 0 ms 5144 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 3 ms 5144 KB Output is correct
3 Incorrect 0 ms 5144 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 0 ms 5144 KB Output is correct
3 Incorrect 0 ms 5144 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5544 KB Output is correct
2 Correct 9 ms 5544 KB Output is correct
3 Incorrect 13 ms 5540 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 6728 KB Output is correct
2 Correct 23 ms 6728 KB Output is correct
3 Incorrect 33 ms 6068 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 7692 KB Output is correct
2 Correct 43 ms 7296 KB Output is correct
3 Incorrect 83 ms 7388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 8108 KB Output is correct
2 Correct 63 ms 7276 KB Output is correct
3 Incorrect 76 ms 7520 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 8600 KB Output is correct
2 Correct 79 ms 8072 KB Output is correct
3 Incorrect 103 ms 7784 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8196 KB Output is correct
2 Correct 99 ms 8196 KB Output is correct
3 Incorrect 106 ms 7784 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8312 KB Output is correct
2 Correct 106 ms 8180 KB Output is correct
3 Incorrect 123 ms 8312 KB Output isn't correct
4 Halted 0 ms 0 KB -