oj.uz

Submission #244548

# Submission time Handle Problem Language Result Execution time Memory
244548 2020-07-04T09:31:55 Z arnold518 Price List (POI13_cen) C++14
0 / 100
 111 ms 13992 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], adj2[MAXN/2+10];

ll dist1[MAXN+10], dist2[MAXN+10];
bool vis1[MAXN+10], vis2[MAXN+10];

struct Queue
{
	int v, w;
};

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}); 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});
		}
	}

	Q.push({K, 0}); vis2[K]=1; dist2[K]=0;
	while(!Q.empty())
	{
		Queue now=Q.front(); Q.pop();
		for(auto nxt : adj[now.v])
		{
			for(auto &nxt2 : adj[nxt])
			{
				if(vis2[nxt2])
				{
					nxt2=-1;
					continue;
				}
				if(f(now.v, nxt2)) continue;
				nxt2=-1;
				Q.push({nxt2, now.w+1});
				dist2[nxt2]=now.w+1;
				vis2[nxt2]=true;
			}
			vector<int> V;
			for(auto it : adj[nxt]) if(it!=-1) V.push_back(it);
			swap(adj[nxt], 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);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 8 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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 5120 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 6144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 8616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 11304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 90 ms 12564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 111 ms 13992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 103 ms 13560 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 13688 KB Output isn't correct
2 Halted 0 ms 0 KB -