oj.uz

답안 #1064556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064556 2024-08-18T14:31:31 Z EkinOnal Price List (POI13_cen) C++17
90 / 100
 1743 ms 17356 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+5);
 
	for(int i=0;i<m;i++){
		int x,y; cin>>x>>y;
		adj[x].pb(y); adj[y].pb(x);
	}
 
	for(int i=1;i<=n;i++) sort(adj[i].begin(),adj[i].end());
	vector<vi> adj2=adj;
 
	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;}
		}
	}
 
	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);
 
			}
		
		}
 
	}
//	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

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 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

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2396 KB Output is correct
2 Correct 22 ms 2396 KB Output is correct
3 Correct 18 ms 2484 KB Output is correct
4 Correct 17 ms 2396 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 317 ms 7120 KB Output is correct
2 Correct 369 ms 7116 KB Output is correct
3 Correct 44 ms 5464 KB Output is correct
4 Correct 58 ms 7248 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 477 ms 11984 KB Output is correct
2 Correct 186 ms 10580 KB Output is correct
3 Correct 105 ms 12632 KB Output is correct
4 Correct 105 ms 12368 KB Output is correct
5 Correct 929 ms 12816 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 14284 KB Output is correct
2 Correct 128 ms 10792 KB Output is correct
3 Correct 109 ms 13020 KB Output is correct
4 Correct 106 ms 12468 KB Output is correct
5 Correct 1308 ms 14536 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 495 ms 16688 KB Output is correct
2 Correct 261 ms 14932 KB Output is correct
3 Correct 120 ms 14184 KB Output is correct
4 Correct 101 ms 12624 KB Output is correct
5 Correct 1444 ms 16188 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 15700 KB Output is correct
2 Correct 300 ms 15644 KB Output is correct
3 Correct 130 ms 14932 KB Output is correct
4 Correct 102 ms 12624 KB Output is correct
5 Correct 1624 ms 17356 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 16208 KB Output is correct
2 Correct 138 ms 16260 KB Output is correct
3 Correct 142 ms 16716 KB Output is correct
4 Correct 103 ms 12508 KB Output is correct
5 Correct 1743 ms 17216 KB Output is correct