Submission #102626

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
102626	2019-03-26T09:59:50 Z	someone_aa	Price List (POI13_cen)	C++17	90 / 100	410 ms	28492 KB

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 100100;
ll n, m, k, a, b;
ll dista[maxn], distb[maxn];

vector<int>g[maxn];
set<int>edge[maxn];
vector<int>unsolved[maxn];

bool visiteda[maxn], visitedb[maxn];

void bfs() {
    for(int i=1;i<=n;i++) dista[i] = 1e9;
    queue<int>q;
    visiteda[k] = true;
    dista[k] = 0;
    q.push(k);

    while(!q.empty()) {
        int curr = q.front();
        q.pop();
        for(int i:g[curr]) {
            if(!visiteda[i]) {
                visiteda[i] = true;
                dista[i] = dista[curr] + 1;
                q.push(i);
            }
        }
    }
}

void bfsb() {
    for(int i=1;i<=n;i++) {
        distb[i] = 1e9;
        unsolved[i] = g[i];
    }
    queue<int>q;
    visitedb[k] = true;
    distb[k] = 0;
    q.push(k);

    while(!q.empty()) {
        int curr = q.front(); q.pop();
        for(int i:g[curr]) {
            vector<int>temp;
            for(int j:unsolved[i]) {
                if(visitedb[j]) continue;
                temp.pb(j);
                if(edge[j].find(curr) != edge[j].end()) {
                    continue;
                }

                visitedb[j] = true;
                distb[j] = distb[curr] + 1;
                q.push(j);
            }
            unsolved[i] = temp;
        }
    }

}

int main() {
    cin>>n>>m>>k>>a>>b;

    int x, y;
    for(int i=0;i<m;i++) {
        cin>>x>>y;
        g[x].pb(y); g[y].pb(x);
        edge[x].insert(y); edge[y].insert(x);
    }

    bfs();
    bfsb();

    for(int i=1;i<=n;i++) {
        if(dista[i] % 2 == 0) {
            cout<<min(dista[i]*a, (dista[i]/2)*b)<<"\n";
        }
        else {
            ll cb = INT_MAX;
            if(visitedb[i]) cb = distb[i] * b;
            cout<<min(((dista[i]-1)/2*b)+a,cb)<<"\n";
        }
    }
}

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	9728 KB	Output is correct
2	Incorrect	13 ms	9700 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	9752 KB	Output is correct
2	Correct	11 ms	9728 KB	Output is correct
3	Correct	11 ms	9744 KB	Output is correct
4	Correct	11 ms	9816 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	9856 KB	Output is correct
2	Correct	16 ms	9856 KB	Output is correct
3	Correct	11 ms	9856 KB	Output is correct
4	Correct	14 ms	9856 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	52 ms	12004 KB	Output is correct
2	Correct	41 ms	11896 KB	Output is correct
3	Correct	60 ms	12396 KB	Output is correct
4	Correct	57 ms	12408 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	112 ms	17320 KB	Output is correct
2	Correct	113 ms	17204 KB	Output is correct
3	Correct	136 ms	16132 KB	Output is correct
4	Correct	185 ms	18552 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	296 ms	22816 KB	Output is correct
2	Correct	217 ms	21236 KB	Output is correct
3	Correct	316 ms	24552 KB	Output is correct
4	Correct	330 ms	24972 KB	Output is correct
5	Correct	213 ms	23652 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	281 ms	25520 KB	Output is correct
2	Correct	196 ms	21664 KB	Output is correct
3	Correct	364 ms	25464 KB	Output is correct
4	Correct	364 ms	25040 KB	Output is correct
5	Correct	248 ms	25648 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	355 ms	28164 KB	Output is correct
2	Correct	323 ms	26456 KB	Output is correct
3	Correct	402 ms	26220 KB	Output is correct
4	Correct	380 ms	24952 KB	Output is correct
5	Correct	307 ms	27232 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	343 ms	26996 KB	Output is correct
2	Correct	341 ms	27172 KB	Output is correct
3	Correct	389 ms	26616 KB	Output is correct
4	Correct	365 ms	25180 KB	Output is correct
5	Correct	350 ms	28352 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	370 ms	28000 KB	Output is correct
2	Correct	317 ms	27768 KB	Output is correct
3	Correct	403 ms	27960 KB	Output is correct
4	Correct	410 ms	25080 KB	Output is correct
5	Correct	332 ms	28492 KB	Output is correct

Submission #102626

Compilation message