oj.uz

답안 #244422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244422 2020-07-04T05:16:50 Z arnold518 Price List (POI13_cen) C++14
100 / 100
 1955 ms 9712 KB 
#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];

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(adj[u].begin(), adj[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);
	}
	for(i=1; i<=N; i++) sort(adj[i].begin(), adj[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;
			}
		}
	}

	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);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 5196 KB Output is correct
2 Correct 390 ms 5240 KB Output is correct
3 Correct 33 ms 4864 KB Output is correct
4 Correct 49 ms 5624 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 6904 KB Output is correct
2 Correct 155 ms 6264 KB Output is correct
3 Correct 75 ms 6776 KB Output is correct
4 Correct 105 ms 6624 KB Output is correct
5 Correct 1022 ms 7284 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 593 ms 7800 KB Output is correct
2 Correct 74 ms 7160 KB Output is correct
3 Correct 80 ms 7928 KB Output is correct
4 Correct 101 ms 7672 KB Output is correct
5 Correct 1367 ms 8948 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 425 ms 8696 KB Output is correct
2 Correct 161 ms 9208 KB Output is correct
3 Correct 85 ms 8312 KB Output is correct
4 Correct 86 ms 7672 KB Output is correct
5 Correct 1620 ms 9712 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 8184 KB Output is correct
2 Correct 155 ms 8132 KB Output is correct
3 Correct 83 ms 7544 KB Output is correct
4 Correct 78 ms 6648 KB Output is correct
5 Correct 1745 ms 8948 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 8436 KB Output is correct
2 Correct 78 ms 8312 KB Output is correct
3 Correct 96 ms 8312 KB Output is correct
4 Correct 80 ms 6600 KB Output is correct
5 Correct 1955 ms 8948 KB Output is correct