oj.uz

Submission #914596

# Submission time Handle Problem Language Result Execution time Memory
914596 2024-01-22T11:14:37 Z dsyz Travelling Merchant (APIO17_merchant) C++17
100 / 100
 66 ms 4340 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
ll N,M,K;
ll buy[105][1005], sell[105][1005];
ll profit[105][105], graph1[105][105], graph2[105][105];
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	cin>>N>>M>>K;
	for(ll i = 0;i < N;i++){
		for(ll j = 0;j < N;j++){
			graph1[i][j] = 1e18;
		}
	}
	for(ll i = 0;i < N;i++){
		for(ll j = 0;j < K;j++){
			cin>>buy[i][j]>>sell[i][j]; //if buy[i][j] or sell[i][j] = -1 that means type j item cannot be bought/sold respectively at node i
		}
	}
	for(ll i = 0;i < M;i++){
		ll a,b,c;
		cin>>a>>b>>c;
		a--, b--;
		graph1[a][b] = c; //directed edge from a to b with weight c
	}
	for(ll k = 0;k < N;k++){
		for(ll i = 0;i < N;i++){
			for(ll j = 0;j < N;j++){
				graph1[i][j] = min(graph1[i][j],graph1[i][k] + graph1[k][j]);
			}
		}
	}
	for(ll i = 0;i < N;i++){
		for(ll j = 0;j < N;j++){
			for(ll k = 0;k < K;k++){ //note that this is not floyd warshall, just normal nested for loops to loop though buy[node i][item type k] and sell[node j][item type k]
				if(buy[i][k] != -1 && sell[j][k] != -1){
					profit[i][j] = max(profit[i][j],sell[j][k] - buy[i][k]); //if we buy at node i and then sell at node j, we can keep on buying the same type of most optimal item since there is infinite stock of the same type 
				}
			}
		}
	}
	ll high = 1e9 + 5;
	ll low = 0;
	while(high - low > 1){
		ll mid = (high + low) / 2;
		for(ll i = 0;i < N;i++){
			for(ll j = 0;j < N;j++){
				if(graph1[i][j] >= 1e18) graph2[i][j] = 1e18 - profit[i][j];
				else graph2[i][j] = (mid * graph1[i][j]) - profit[i][j];
			}
		}
		for(ll k = 0;k < N;k++){
			for(ll i = 0;i < N;i++){
				for(ll j = 0;j < N;j++){
					graph2[i][j] = min(graph2[i][j],graph2[i][k] + graph2[k][j]);
				}
			}
		}
		bool hasnegativecycle = false;
		for(ll i = 0;i < N;i++){
			if(graph2[i][i] <= 0){
				hasnegativecycle = true;
			}
		}
		if(hasnegativecycle){
			low = mid;
		}else{
			high = mid;
		}
	}
	cout<<low<<'\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 3420 KB Output is correct
2 Correct 27 ms 1368 KB Output is correct
3 Correct 28 ms 1440 KB Output is correct
4 Correct 4 ms 952 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 856 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 856 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 5 ms 860 KB Output is correct
4 Correct 5 ms 984 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 31 ms 1628 KB Output is correct
9 Correct 53 ms 3932 KB Output is correct
10 Correct 32 ms 1628 KB Output is correct
11 Correct 30 ms 1884 KB Output is correct
12 Correct 31 ms 1884 KB Output is correct
13 Correct 29 ms 1628 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 1084 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 4 ms 1048 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 992 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 976 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 5 ms 988 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 31 ms 1628 KB Output is correct
18 Correct 53 ms 3932 KB Output is correct
19 Correct 32 ms 1628 KB Output is correct
20 Correct 30 ms 1884 KB Output is correct
21 Correct 31 ms 1884 KB Output is correct
22 Correct 29 ms 1628 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 5 ms 984 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 46 ms 3420 KB Output is correct
31 Correct 27 ms 1368 KB Output is correct
32 Correct 28 ms 1440 KB Output is correct
33 Correct 4 ms 952 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 4 ms 860 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 4 ms 856 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 4 ms 856 KB Output is correct
43 Correct 28 ms 1368 KB Output is correct
44 Correct 30 ms 1628 KB Output is correct
45 Correct 43 ms 2652 KB Output is correct
46 Correct 30 ms 1628 KB Output is correct
47 Correct 30 ms 1628 KB Output is correct
48 Correct 30 ms 1960 KB Output is correct
49 Correct 54 ms 4176 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 28 ms 1500 KB Output is correct
53 Correct 30 ms 1372 KB Output is correct
54 Correct 29 ms 1616 KB Output is correct
55 Correct 28 ms 1372 KB Output is correct
56 Correct 28 ms 1372 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 1112 KB Output is correct
59 Correct 5 ms 1116 KB Output is correct
60 Correct 5 ms 1116 KB Output is correct
61 Correct 55 ms 4340 KB Output is correct
62 Correct 66 ms 4176 KB Output is correct
63 Correct 0 ms 344 KB Output is correct