Submission #1064548

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1064548	2024-08-18T14:21:10 Z	EkinOnal	Price List (POI13_cen)	C++17	90 / 100	151 ms	17004 KB

//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
#define MAX 200007
#define pb push_back
#define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 1e9+7;
const int INF = 1e18;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;;b>>=1;}return ans;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod))%mod;}
 
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
 
 
void solve(){
	int n,m,k,a,b; cin>>n>>m>>k>>a>>b;
 
	vector<vi> adj(n+1);
 
	for(int i=0;i<m;i++){
		int x,y; cin>>x>>y;
		adj[x].pb(y); adj[y].pb(x);
	}
 
	vi used(n+5),dist(n+5,INF); dist[k]=0;
	queue<int> q; q.push(k);
	while(q.size()){
		auto node = q.front();
		q.pop();
		used[node]=true;
 
		for(auto u : adj[node]){
			if(used[u]) continue; 
			if(dist[u]>dist[node]+1)
				{q.push(u); dist[u]=dist[node]+1;}
		}
	}
	for(int i=1;i<=n;i++) sort(adj[i].begin(),adj[i].end());
	vector<vi> adj2=adj;
 
	vi dist1(n+5,INF),vis(n+5); dist1[k]=0; vis[k]=true;
	q.push(k);
	while(q.size()){
		int node = q.front();
		q.pop();
	//	if(dist[node.s]!=node.f) continue;
 
		for(auto nxt1 : adj[node]){
			for(auto nxt2 : adj2[nxt1]){
 
				if(vis[nxt2]) continue;
				if (binary_search(adj[node].begin(), adj[node].end(), nxt2))
                    continue;
 
                dist1[nxt2]=dist1[node]+1;
                vis[nxt2]=true;
                q.push(nxt2);
 
			}
			vi v;
			for(auto nxt2:adj2[nxt1]){
				if(vis[nxt2]==false) v.pb(nxt2);
			} 
			swap(adj2[nxt1],v);
		}
 
	}
//	for(int i=1;i<=n;i++) cout<<dist[i]<<"\n";;
	for(int i=1;i<=n;i++){
		if(dist[i]%2) cout<<min({dist[i]*a,(dist[i]/2)*b+a,dist1[i]*b})<<endl;
		else cout<<min(dist[i]*a,(dist[i]/2)*b)<<endl;
	}
 
 
 
	return;
}
 
int32_t main() {
//	freopen("hayfeast.in", "r", stdin);
//	freopen("hayfeast.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);   
    int t=1;
 //   cin >> t;
    while (t--) solve();
 
    return 0;
}

Subtask #1
0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	348 KB	Output isn't correct
3	Halted	0 KB	-

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	2396 KB	Output is correct
2	Correct	21 ms	2384 KB	Output is correct
3	Correct	19 ms	2396 KB	Output is correct
4	Correct	18 ms	2396 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	53 ms	6912 KB	Output is correct
2	Correct	52 ms	6940 KB	Output is correct
3	Correct	43 ms	5464 KB	Output is correct
4	Correct	57 ms	7252 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	97 ms	11824 KB	Output is correct
2	Correct	91 ms	10600 KB	Output is correct
3	Correct	108 ms	12632 KB	Output is correct
4	Correct	104 ms	12384 KB	Output is correct
5	Correct	103 ms	12712 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	14308 KB	Output is correct
2	Correct	88 ms	10860 KB	Output is correct
3	Correct	107 ms	13140 KB	Output is correct
4	Correct	110 ms	12624 KB	Output is correct
5	Correct	113 ms	14292 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	138 ms	16688 KB	Output is correct
2	Correct	124 ms	14940 KB	Output is correct
3	Correct	128 ms	14248 KB	Output is correct
4	Correct	100 ms	12372 KB	Output is correct
5	Correct	129 ms	15668 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	141 ms	15696 KB	Output is correct
2	Correct	128 ms	15700 KB	Output is correct
3	Correct	126 ms	14928 KB	Output is correct
4	Correct	103 ms	12624 KB	Output is correct
5	Correct	146 ms	17004 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	138 ms	16212 KB	Output is correct
2	Correct	140 ms	16208 KB	Output is correct
3	Correct	151 ms	16720 KB	Output is correct
4	Correct	102 ms	12628 KB	Output is correct
5	Correct	131 ms	16976 KB	Output is correct

Submission #1064548

Compilation message