oj.uz

Submission #57320

# Submission time Handle Problem Language Result Execution time Memory
57320 2018-07-14T14:39:22 Z MatheusLealV Travelling Merchant (APIO17_merchant) C++17
100 / 100
 116 ms 3940 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;

bool can[N][N];

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 dfs(int x, int ini)
{
	for(auto v: grafo[x])
	{
		if(can[ini][v.f]) continue;

		can[ini][v.f] = 1;

		dfs(v.f, ini);
	}
}

ll find_ciclo()
{
	ll ans = 0;

	for(int i = 1; i <= n; i++)
	{
		can[i][i] = true;

		dfs(i, i);
	}

	for(int i = 1; i <= n; i++)
	{
		if(can[1][i] and can[i][1])
		{
			ll cima = best_cost[1][i];

			ll baixo = dist[i][1] + dist[1][i];

			if(baixo != 0) ans = max(ans, cima/baixo);
		}
	}

	return ans;
}

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

ll resp_todos_iguais(ll x)
{
	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(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) return true;

	return false;
}

ll solve2()
{
	ll ini = 0, fim = 1000000050, mid, best;

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

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

			ini = mid + 1;
		}

		else fim = mid - 1;
	}

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

bool igual = true;

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];

			if(B[i][j] != S[i][j]) igual = false;
		}
	}

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

	if(!igual)
	{
		ll ini = 0LL, fim = 1000000010LL, mid, best;

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

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

				ini = mid + 1;
			}

			else fim = mid - 1;
		}

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

	else solve2();
}

Compilation message

merchant.cpp: In function 'll solve2()':
merchant.cpp:200:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2808 KB Output is correct
2 Correct 45 ms 2808 KB Output is correct
3 Correct 69 ms 2808 KB Output is correct
4 Correct 13 ms 2808 KB Output is correct
5 Correct 9 ms 2808 KB Output is correct
6 Correct 8 ms 2808 KB Output is correct
7 Correct 10 ms 2808 KB Output is correct
8 Correct 2 ms 2808 KB Output is correct
9 Correct 8 ms 2808 KB Output is correct
10 Correct 9 ms 2808 KB Output is correct
11 Correct 15 ms 2808 KB Output is correct
12 Correct 3 ms 2808 KB Output is correct
13 Correct 10 ms 2808 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2808 KB Output is correct
2 Correct 102 ms 3244 KB Output is correct
3 Correct 56 ms 3244 KB Output is correct
4 Correct 55 ms 3244 KB Output is correct
5 Correct 52 ms 3244 KB Output is correct
6 Correct 49 ms 3244 KB Output is correct
7 Correct 10 ms 2808 KB Output is correct
8 Correct 2 ms 2808 KB Output is correct
9 Correct 10 ms 2808 KB Output is correct
10 Correct 10 ms 2808 KB Output is correct
11 Correct 10 ms 2808 KB Output is correct
12 Correct 10 ms 2808 KB Output is correct
13 Correct 9 ms 2808 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2808 KB Output is correct
2 Correct 9 ms 2808 KB Output is correct
3 Correct 9 ms 2808 KB Output is correct
4 Correct 8 ms 2808 KB Output is correct
5 Correct 9 ms 2808 KB Output is correct
6 Correct 2 ms 2808 KB Output is correct
7 Correct 9 ms 2808 KB Output is correct
8 Correct 9 ms 2808 KB Output is correct
9 Correct 12 ms 2808 KB Output is correct
10 Correct 12 ms 2808 KB Output is correct
11 Correct 10 ms 2808 KB Output is correct
12 Correct 9 ms 2808 KB Output is correct
13 Correct 10 ms 2808 KB Output is correct
14 Correct 9 ms 2808 KB Output is correct
15 Correct 19 ms 2808 KB Output is correct
16 Correct 9 ms 2808 KB Output is correct
17 Correct 54 ms 2808 KB Output is correct
18 Correct 102 ms 3244 KB Output is correct
19 Correct 56 ms 3244 KB Output is correct
20 Correct 55 ms 3244 KB Output is correct
21 Correct 52 ms 3244 KB Output is correct
22 Correct 49 ms 3244 KB Output is correct
23 Correct 10 ms 2808 KB Output is correct
24 Correct 2 ms 2808 KB Output is correct
25 Correct 10 ms 2808 KB Output is correct
26 Correct 10 ms 2808 KB Output is correct
27 Correct 10 ms 2808 KB Output is correct
28 Correct 10 ms 2808 KB Output is correct
29 Correct 9 ms 2808 KB Output is correct
30 Correct 46 ms 3244 KB Output is correct
31 Correct 64 ms 3244 KB Output is correct
32 Correct 88 ms 3576 KB Output is correct
33 Correct 71 ms 3576 KB Output is correct
34 Correct 50 ms 3576 KB Output is correct
35 Correct 50 ms 3576 KB Output is correct
36 Correct 102 ms 3636 KB Output is correct
37 Correct 2 ms 3636 KB Output is correct
38 Correct 2 ms 3636 KB Output is correct
39 Correct 48 ms 3636 KB Output is correct
40 Correct 51 ms 3636 KB Output is correct
41 Correct 47 ms 3636 KB Output is correct
42 Correct 47 ms 3636 KB Output is correct
43 Correct 47 ms 3636 KB Output is correct
44 Correct 2 ms 3636 KB Output is correct
45 Correct 11 ms 3636 KB Output is correct
46 Correct 11 ms 3636 KB Output is correct
47 Correct 13 ms 3636 KB Output is correct
48 Correct 112 ms 3928 KB Output is correct
49 Correct 116 ms 3940 KB Output is correct
50 Correct 2 ms 3940 KB Output is correct
51 Correct 78 ms 2808 KB Output is correct
52 Correct 45 ms 2808 KB Output is correct
53 Correct 69 ms 2808 KB Output is correct
54 Correct 13 ms 2808 KB Output is correct
55 Correct 9 ms 2808 KB Output is correct
56 Correct 8 ms 2808 KB Output is correct
57 Correct 10 ms 2808 KB Output is correct
58 Correct 2 ms 2808 KB Output is correct
59 Correct 8 ms 2808 KB Output is correct
60 Correct 9 ms 2808 KB Output is correct
61 Correct 15 ms 2808 KB Output is correct
62 Correct 3 ms 2808 KB Output is correct
63 Correct 10 ms 2808 KB Output is correct