oj.uz

Submission #406967

# Submission time Handle Problem Language Result Execution time Memory
406967 2021-05-18T09:20:19 Z Magnam_Caritatem Travelling Merchant (APIO17_merchant) C++14
100 / 100
 91 ms 4164 KB 
/*
	Task	: Travelling_Merchant
	Author	: Phumipat C. [MAGCARI]
	Language: C++
	Created	: 18 May 2021 [15:03]
	Algo	: 
	Status	: 
*/
#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= (b); ++i)
#define repr(i, a, b) for(int i = a; i >= (b); --i)
#define all(x) begin(x),end(x)
#define allst(x,y) (x).begin()+y,(x).end()
#define rmdup(x) (x).resize(unique((x).begin(),(x).end())-(x).begin())
#define sz(x) (int)(x).size()
#define decp(x) fixed << setprecision(x)
#define MOD (LL )(1e9+7)
using namespace std;
using LL = long long;
using PII = pair<int ,int >;
using PLL = pair<long long ,long long >;
const int dir4[2][4] = {{1,-1,0,0},{0,0,1,-1}};
const int dir8[2][8] = {{-1,-1,-1,0,1,1,1,0},{-1,0,1,1,-1,0,1,-1}};
LL modN(LL a,LL b,LL c = MOD){
	if(b == 0)	return 1;
	if(b == 1)	return a%c;
	LL now = modN(a,b/2,c);
	if(b&1)	return (((now*now)%c)*(a%c))%c;
	else	return (now*now)%c;
}
const int N = 110;
const int mxK = 1010;
LL prof[N][N],dis[N][N],eff[N][N],buy[N][mxK],sell[N][mxK];
int n,m,K;
bool check(LL val){
	rep(i,1,n)	rep(j,1,n)	eff[i][j] = -1e18;
	rep(i,1,n){
		rep(j,1,n){
			if(dis[i][j] == 1e18)	continue;
			eff[i][j] = max(eff[i][j],prof[i][j] - val*dis[i][j]);
		}
	}
	rep(k,1,n){
		rep(i,1,n){
			rep(j,1,n){
				eff[i][j] = max(eff[i][j],eff[i][k] + eff[k][j]);
			}
		}
	}
	rep(i,1,n)
		if(eff[i][i]>=0)
			return true;
	return false;
}
void solve(){
	int u,v;
	LL w;
	cin >> n >> m >> K;
	rep(i,1,n)
		rep(j,1,K)
			cin >> buy[i][j] >> sell[i][j];
	rep(i,1,n)	rep(j,1,n)	dis[i][j] = 1e18;
	while(m--){
		cin >> u >> v >> w;
		dis[u][v] = min(dis[u][v],w);
	}
	rep(k,1,n){
		rep(i,1,n){
			rep(j,1,n){
				if(dis[i][k] == 1e18 || dis[k][j] == 1e18)	continue;
				dis[i][j] = min(dis[i][j],dis[i][k] + dis[k][j]);
			}
		}
	}
	rep(l,1,K){
		rep(i,1,n){
			rep(j,1,n){
				if(dis[i][j] == 1e18 || buy[i][l] == -1 || sell[j][l] == -1)	continue;
				prof[i][j] = max(prof[i][j],sell[j][l] - buy[i][l]);
			}
		}
	}
	
	LL l = 0,r = 1e9,mid;
	while(l<r){
		mid = (l+r+1)/2;
		if(check(mid))	l = mid;
		else			r = mid-1;
	}
	cout << l << '\n';
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int q = 1;
	// cin >> q;
	for(int Q=1;Q<=q;Q++){
		// cout << "Case #" << Q << ": ";
		solve();
	}
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 1988 KB Output is correct
2 Correct 37 ms 1308 KB Output is correct
3 Correct 38 ms 1304 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 7 ms 716 KB Output is correct
10 Correct 7 ms 716 KB Output is correct
11 Correct 6 ms 716 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 7 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 8 ms 844 KB Output is correct
4 Correct 8 ms 944 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 42 ms 1468 KB Output is correct
9 Correct 83 ms 2244 KB Output is correct
10 Correct 42 ms 1484 KB Output is correct
11 Correct 44 ms 1612 KB Output is correct
12 Correct 43 ms 1680 KB Output is correct
13 Correct 41 ms 1484 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 6 ms 844 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 7 ms 884 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 7 ms 844 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 8 ms 844 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 7 ms 844 KB Output is correct
15 Correct 8 ms 844 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 42 ms 1468 KB Output is correct
18 Correct 83 ms 2244 KB Output is correct
19 Correct 42 ms 1484 KB Output is correct
20 Correct 44 ms 1612 KB Output is correct
21 Correct 43 ms 1680 KB Output is correct
22 Correct 41 ms 1484 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 8 ms 944 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 7 ms 844 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 77 ms 1988 KB Output is correct
31 Correct 37 ms 1308 KB Output is correct
32 Correct 38 ms 1304 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 6 ms 716 KB Output is correct
36 Correct 7 ms 844 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 7 ms 716 KB Output is correct
39 Correct 7 ms 716 KB Output is correct
40 Correct 6 ms 716 KB Output is correct
41 Correct 1 ms 320 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 41 ms 1356 KB Output is correct
44 Correct 41 ms 1612 KB Output is correct
45 Correct 63 ms 2564 KB Output is correct
46 Correct 41 ms 1612 KB Output is correct
47 Correct 43 ms 1612 KB Output is correct
48 Correct 47 ms 1620 KB Output is correct
49 Correct 91 ms 4020 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 40 ms 1376 KB Output is correct
53 Correct 43 ms 1472 KB Output is correct
54 Correct 51 ms 1484 KB Output is correct
55 Correct 51 ms 1412 KB Output is correct
56 Correct 40 ms 1356 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 8 ms 972 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 8 ms 976 KB Output is correct
61 Correct 89 ms 4136 KB Output is correct
62 Correct 88 ms 4164 KB Output is correct
63 Correct 1 ms 332 KB Output is correct