#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
const ll INF = 1e15;
int N, M, K, A, B;
pii E[MAXN+10];
vector<int> adj[MAXN/2+10], adj2[MAXN/2+10];
ll dist1[MAXN+10], dist2[MAXN+10];
bool vis1[MAXN+10], vis2[MAXN+10];
struct Queue
{
int v, w, p;
};
bool f(int u, int v) { return binary_search(adj2[u].begin(), adj2[u].end(), v); }
int main()
{
int i, j;
scanf("%d%d%d%d%d", &N, &M, &K, &A, &B);
for(i=1; i<=M; i++)
{
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
adj2[u].push_back(v);
adj2[v].push_back(u);
}
for(i=1; i<=N; i++) sort(adj2[i].begin(), adj2[i].end());
for(i=1; i<=N; i++) dist1[i]=dist2[i]=INF;
queue<Queue> Q;
Q.push({K, 0, 0}); vis1[K]=1; dist1[K]=0;
while(!Q.empty())
{
Queue now=Q.front(); Q.pop();
for(auto nxt : adj[now.v])
{
if(vis1[nxt]) continue;
dist1[nxt]=now.w+1;
vis1[nxt]=true;
Q.push({nxt, now.w+1, 0});
}
}
Q.push({K, 0, -1}); vis2[K]=1; dist2[K]=0;
while(!Q.empty())
{
Queue now=Q.front(); Q.pop();
if(now.p==-1)
{
for(auto nxt : adj[now.v])
{
Q.push({nxt, now.w, now.v});
}
}
else
{
for(auto &nxt : adj[now.v])
{
if(vis2[nxt]) continue;
if(f(nxt, now.p)) continue;
Q.push({nxt, now.w+1, -1});
vis2[nxt]=true;
dist2[nxt]=now.w+1;
nxt=-1;
}
vector<int> V;
for(auto it : adj[now.v]) if(it!=-1) V.push_back(it);
adj[now.v]=V;
}
}
for(i=1; i<=N; i++)
{
if(dist1[i]%2==0) printf("%lld\n", min(dist1[i]*A, dist1[i]/2*B));
else printf("%lld\n", min({dist1[i]*A, dist1[i]/2*B+A, dist2[i]*B}));
}
}
Compilation message
cen.cpp: In function 'int main()':
cen.cpp:27:9: warning: unused variable 'j' [-Wunused-variable]
int i, j;
^
cen.cpp:29:7: 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:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &u, &v);
~~~~~^~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
4992 KB |
Output is correct |
2 |
Correct |
7 ms |
4992 KB |
Output is correct |
3 |
Correct |
7 ms |
4992 KB |
Output is correct |
4 |
Incorrect |
7 ms |
4992 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
4992 KB |
Output is correct |
2 |
Correct |
8 ms |
5120 KB |
Output is correct |
3 |
Correct |
7 ms |
4992 KB |
Output is correct |
4 |
Correct |
7 ms |
5120 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
5120 KB |
Output is correct |
2 |
Correct |
9 ms |
5120 KB |
Output is correct |
3 |
Incorrect |
8 ms |
5120 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
6144 KB |
Output is correct |
2 |
Correct |
19 ms |
6144 KB |
Output is correct |
3 |
Incorrect |
24 ms |
6136 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
8952 KB |
Output is correct |
2 |
Correct |
42 ms |
8952 KB |
Output is correct |
3 |
Incorrect |
47 ms |
7672 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
81 ms |
11640 KB |
Output is correct |
2 |
Correct |
71 ms |
10664 KB |
Output is correct |
3 |
Incorrect |
148 ms |
11356 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
98 ms |
12920 KB |
Output is correct |
2 |
Correct |
86 ms |
10872 KB |
Output is correct |
3 |
Incorrect |
203 ms |
11512 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
145 ms |
14212 KB |
Output is correct |
2 |
Correct |
147 ms |
13180 KB |
Output is correct |
3 |
Incorrect |
158 ms |
12152 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
125 ms |
13560 KB |
Output is correct |
2 |
Correct |
156 ms |
13468 KB |
Output is correct |
3 |
Incorrect |
161 ms |
12536 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
129 ms |
13944 KB |
Output is correct |
2 |
Correct |
123 ms |
13816 KB |
Output is correct |
3 |
Incorrect |
166 ms |
13816 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |