oj.uz

Submission #57305

# Submission time Handle Problem Language Result Execution time Memory
57305 2018-07-14T14:09:08 Z MatheusLealV Travelling Merchant (APIO17_merchant) C++17
21 / 100
 1000 ms 2812 KB 
#include <bits/stdc++.h>
#define N 150
#define K 1050
#define f first
#define s second
using namespace std;
#define int long long
typedef long long ll;
typedef pair<ll, ll> pii;

ll inf = 2000000000000000000;

ll n, m, k, dist[N][N], best_cost[N][N], B[N][K], S[N][K];

ll E[N][N], dp[N][N];

vector< pii > grafo[N];

void dijkstra(int ini)
{
	priority_queue < pii, vector< pii >, greater < pii > > pq;

	for(int i = 1; i <= n; i++) dist[ini][i] = inf;

	dist[ini][ini] = 0;

	pq.push({0, ini});

	while(!pq.empty())
	{
		int x = pq.top().s;

		ll d = pq.top().f;

		pq.pop();

		if(d > dist[ini][x]) continue;

		for(auto v: grafo[x])
		{
			if(dist[ini][v.f] > dist[ini][x] + v.s)
			{
				dist[ini][v.f] = dist[ini][x] + v.s;

				pq.push({dist[ini][v.f], v.f});
			}
		}
	}
}

bool solve(ll x)
{	
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			for(int q = 1; q <= k; q++)
			{
				if(B[i][q] == -1 or S[j][q] == -1) continue;

				ll C = -B[i][q] + S[j][q];

				best_cost[i][j] = max(best_cost[i][j], C);
			}

			//cout<<"CUSTO "<<i<<" "<<j<<" "<<best_cost[i][j]<<"\n";
		}
	}

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			dp[i][j] = inf;

	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			if(i == j or dist[i][j] == inf) continue;

			E[i][j] = -best_cost[i][j] + x*dist[i][j];

			dp[i][j] = E[i][j];

			//cout<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
		}

		dp[i][i] = inf;
	}

	for(int q = 1; q <= n; q++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				dp[i][j] = min(dp[i][j], dp[i][q] + dp[q][j]);

	for(int i = 1; i <= n; i++)
	{
		if(dp[i][i] <= 0)
		{
			//cout<<"CICLO NEGATIVO "<<i<<"\n";

			return true;
		}
	}

	return false;
}	

int32_t main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>m>>k;

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= k; j++) cin>>B[i][j]>>S[i][j];

	for(int i = 1, a, b; i <= m; i++)
	{
		ll c;

		cin>>a>>b>>c;

		grafo[a].push_back({b, c});
	}

	for(int i = 1; i <= n; i++) dijkstra(i);

	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			for(int q = 1; q <= k; q++)
			{
				if(B[i][q] == -1 or S[j][q] == -1) continue;

				ll C = -B[i][q] + S[j][q];

				best_cost[i][j] = max(best_cost[i][j], C);
			}

			//cout<<"CUSTO "<<i<<" "<<j<<" "<<best_cost[i][j]<<"\n";
		}
	}

	ll ini = 0LL, fim = 10000000000LL, mid, best;

	while(fim >= ini)
	{
		mid = (ini + fim)/2;

		if(solve(mid))
		{
			best = mid;

			ini = mid + 1;
		}

		else fim = mid - 1;
	}

	cout<<best<<"\n";
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 470 ms 2424 KB Output is correct
2 Incorrect 61 ms 2424 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2424 KB Output is correct
2 Correct 12 ms 2424 KB Output is correct
3 Correct 19 ms 2424 KB Output is correct
4 Correct 18 ms 2424 KB Output is correct
5 Correct 22 ms 2424 KB Output is correct
6 Correct 3 ms 2424 KB Output is correct
7 Correct 17 ms 2424 KB Output is correct
8 Correct 17 ms 2424 KB Output is correct
9 Correct 22 ms 2424 KB Output is correct
10 Correct 23 ms 2424 KB Output is correct
11 Correct 25 ms 2424 KB Output is correct
12 Correct 24 ms 2424 KB Output is correct
13 Correct 16 ms 2424 KB Output is correct
14 Correct 14 ms 2424 KB Output is correct
15 Correct 24 ms 2424 KB Output is correct
16 Correct 12 ms 2424 KB Output is correct
17 Correct 26 ms 2424 KB Output is correct
18 Correct 3 ms 2424 KB Output is correct
19 Correct 23 ms 2424 KB Output is correct
20 Correct 24 ms 2424 KB Output is correct
21 Correct 22 ms 2424 KB Output is correct
22 Correct 12 ms 2424 KB Output is correct
23 Correct 10 ms 2424 KB Output is correct
24 Correct 10 ms 2424 KB Output is correct
25 Correct 16 ms 2424 KB Output is correct
26 Correct 3 ms 2424 KB Output is correct
27 Correct 15 ms 2424 KB Output is correct
28 Correct 17 ms 2424 KB Output is correct
29 Correct 10 ms 2424 KB Output is correct
30 Correct 2 ms 2424 KB Output is correct
31 Correct 17 ms 2424 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 2424 KB Output is correct
2 Execution timed out 1069 ms 2812 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2424 KB Output is correct
2 Correct 12 ms 2424 KB Output is correct
3 Correct 19 ms 2424 KB Output is correct
4 Correct 18 ms 2424 KB Output is correct
5 Correct 22 ms 2424 KB Output is correct
6 Correct 3 ms 2424 KB Output is correct
7 Correct 17 ms 2424 KB Output is correct
8 Correct 17 ms 2424 KB Output is correct
9 Correct 22 ms 2424 KB Output is correct
10 Correct 23 ms 2424 KB Output is correct
11 Correct 25 ms 2424 KB Output is correct
12 Correct 24 ms 2424 KB Output is correct
13 Correct 16 ms 2424 KB Output is correct
14 Correct 14 ms 2424 KB Output is correct
15 Correct 24 ms 2424 KB Output is correct
16 Correct 12 ms 2424 KB Output is correct
17 Correct 214 ms 2424 KB Output is correct
18 Execution timed out 1069 ms 2812 KB Time limit exceeded
19 Halted 0 ms 0 KB -