oj.uz

답안 #1064540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064540 2024-08-18T14:13:56 Z EkinOnal Price List (POI13_cen) C++17
80 / 100
 1749 ms 15560 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);
	}

	vector<vi> adj2=adj;
	for(int i=1;i<=n;i++) sort(adj[i].begin(),adj[i].end());
//	vector<vi> adj2=adj;

	vi dist1(n+5,INF),dist2(n+5,INF);
	dist1[k]=dist2[k]=0;

	vi vis(n+5); dist1[k]=0;
	queue<int> q; q.push(k);
	while(q.size()){
		auto node = q.front();
		q.pop();
		if(vis[node]) continue;
		vis[node]=true;

		for(auto u : adj[node]){
		//	if(vis[u]) continue; 
			if(dist1[u]>dist1[node]+1)
				{q.push(u); dist1[u]=dist1[node]+1;}
		}
	}

	vis=vi(n+5);

	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;

                dist2[nxt2]=dist2[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(dist1[i]%2) cout<<min({dist1[i]*a,(dist1[i]/2)*b+a,dist2[i]*b})<<endl;
		else cout<<min(dist1[i]*a,(dist1[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 348 KB Output is correct
2 Incorrect 0 ms 348 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 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

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

Subtask #5
0 / 10.0

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

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1749 ms 10704 KB Output is correct
2 Correct 117 ms 9576 KB Output is correct
3 Correct 158 ms 11096 KB Output is correct
4 Correct 108 ms 10840 KB Output is correct
5 Correct 106 ms 11732 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 13012 KB Output is correct
2 Correct 208 ms 9708 KB Output is correct
3 Correct 137 ms 11568 KB Output is correct
4 Correct 118 ms 10844 KB Output is correct
5 Correct 147 ms 13184 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 14892 KB Output is correct
2 Correct 666 ms 13256 KB Output is correct
3 Correct 128 ms 12456 KB Output is correct
4 Correct 132 ms 10908 KB Output is correct
5 Correct 126 ms 14532 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 591 ms 13888 KB Output is correct
2 Correct 182 ms 13904 KB Output is correct
3 Correct 129 ms 13052 KB Output is correct
4 Correct 118 ms 10832 KB Output is correct
5 Correct 183 ms 15560 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 14280 KB Output is correct
2 Correct 140 ms 14308 KB Output is correct
3 Correct 212 ms 15052 KB Output is correct
4 Correct 120 ms 10832 KB Output is correct
5 Correct 175 ms 15468 KB Output is correct