oj.uz

Submission #132205

# Submission time Handle Problem Language Result Execution time Memory
132205 2019-07-18T13:11:14 Z baluteshih Travelling Merchant (APIO17_merchant) C++14
0 / 100
 94 ms 3960 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define ALL(v) v.begin(),v.end()
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const ll INF=1e18;
pll buy[105][1005];
ll dis[105][105],earn[105][105],dp[105][105];

int main()
{jizz
	ll n,m,k,a,b,w,l=0,r=1e9;
	cin >> n >> m >> k;
	for(int i=1;i<=n;++i)
		for(int j=0;j<k;++j)
			cin >> buy[i][j].F >> buy[i][j].S;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			dis[i][j]=INF;
	while(m--)
		cin >> a >> b >> w,dis[a][b]=min(w,dis[a][b]);
	for(int k=1;k<=n;++k)
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			if(i!=j)
				for(int t=0;t<k;++t)
					if(~buy[i][t].F&&~buy[j][t].S)
						earn[i][j]=max(earn[i][j],buy[j][t].S-buy[i][t].F);
	while(l<r)
	{
		ll mid=(l+r)/2+1,tmp=-INF;
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				dp[i][j]=earn[i][j]-dis[i][j]*mid;
		for(int k=1;k<=n;++k)
			for(int i=1;i<=n;++i)
				for(int j=1;j<=n;++j)
					dp[i][j]=max(dp[i][j],dp[i][k]+dp[k][j]);
		for(int i=1;i<=n;++i)
			tmp=max(tmp,dp[i][i]);
		if(tmp>=0) l=mid;
		else r=mid-1;
	}
	cout << l << "\n";
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 3320 KB Output is correct
2 Correct 40 ms 988 KB Output is correct
3 Correct 40 ms 888 KB Output is correct
4 Correct 7 ms 632 KB Output is correct
5 Correct 8 ms 632 KB Output is correct
6 Correct 8 ms 632 KB Output is correct
7 Correct 8 ms 760 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 8 ms 632 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Incorrect 9 ms 632 KB Output isn't correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1016 KB Output is correct
2 Correct 8 ms 632 KB Output is correct
3 Correct 8 ms 808 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 9 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 8 ms 760 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1276 KB Output is correct
2 Correct 94 ms 3960 KB Output is correct
3 Correct 42 ms 1144 KB Output is correct
4 Correct 46 ms 1400 KB Output is correct
5 Correct 46 ms 1500 KB Output is correct
6 Correct 41 ms 1144 KB Output is correct
7 Correct 8 ms 760 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 760 KB Output is correct
10 Correct 9 ms 760 KB Output is correct
11 Incorrect 9 ms 760 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1016 KB Output is correct
2 Correct 8 ms 632 KB Output is correct
3 Correct 8 ms 808 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 9 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 8 ms 760 KB Output isn't correct
8 Halted 0 ms 0 KB -