oj.uz

Submission #389620

# Submission time Handle Problem Language Result Execution time Memory
389620 2021-04-14T09:53:08 Z talant117408 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 98 ms 4168 KB 
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 1e9+7;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const ll INF = 1e18;
ll buy[103][1003], sell[103][1003];
ll graph[103][103], graph2[103][103], profit[103][103];
int n, K;

void floyd_warshall(ll g[103][103]) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= n; k++) {
				g[j][k] = min(g[j][k], g[j][i]+g[i][k]);
			}
		}
	}
}

int main() {
	do_not_disturb
	
	int m;
	cin >> n >> m >> K;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			graph[i][j] = INF;
		}
		for (int j = 1; j <= K; j++) {
			cin >> buy[i][j] >> sell[i][j];
		}
	}
	for (int i = 0; i < m; i++) {
		int x, y, w;
		cin >> x >> y >> w;
		graph[x][y] = w;
	}
	floyd_warshall(graph);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= K; k++) {
				if (buy[i][k] != -1 && sell[j][k] != -1) {
					profit[i][j] = max(profit[i][j], sell[j][k]-buy[i][k]);
				}
			}
		}
	}
	
	ll l = 1, r = 1e9;
	ll ans = 0;
	while (l <= r) {
		ll mid = (l+r) >> 1ll;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				graph2[i][j] = mid*min(graph[i][j], INF/mid)-profit[i][j];
			}
		}
		floyd_warshall(graph2);
		bool flag = 0;
		for (int i = 1; i <= n; i++) if (graph2[i][i] <= 0) flag = 1;
		if (flag) {
			ans = max(ans, mid);
			l = mid+1;
		}
		else {
			r = mid-1;
		}
	}
	
	cout << ans << endl;
	
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3308 KB Output is correct
2 Correct 35 ms 1272 KB Output is correct
3 Correct 36 ms 1228 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 6 ms 844 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 6 ms 716 KB Output is correct
11 Correct 6 ms 816 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 6 ms 852 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 6 ms 844 KB Output is correct
3 Correct 1 ms 464 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 816 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 6 ms 840 KB Output is correct
11 Correct 6 ms 844 KB Output is correct
12 Correct 6 ms 888 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 6 ms 844 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 6 ms 844 KB Output is correct
18 Correct 6 ms 844 KB Output is correct
19 Correct 7 ms 852 KB Output is correct
20 Correct 7 ms 940 KB Output is correct
21 Correct 6 ms 844 KB Output is correct
22 Correct 6 ms 848 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 7 ms 944 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 6 ms 880 KB Output is correct
31 Correct 6 ms 832 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 1 ms 332 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 7 ms 944 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 6 ms 880 KB Output is correct
7 Correct 6 ms 832 KB Output is correct
8 Correct 42 ms 1612 KB Output is correct
9 Correct 95 ms 3864 KB Output is correct
10 Correct 39 ms 1484 KB Output is correct
11 Correct 43 ms 1740 KB Output is correct
12 Correct 48 ms 1724 KB Output is correct
13 Correct 38 ms 1516 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 844 KB Output is correct
2 Correct 6 ms 840 KB Output is correct
3 Correct 6 ms 844 KB Output is correct
4 Correct 6 ms 888 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 6 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 6 ms 844 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 7 ms 940 KB Output is correct
13 Correct 6 ms 844 KB Output is correct
14 Correct 6 ms 848 KB Output is correct
15 Correct 7 ms 844 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 42 ms 1612 KB Output is correct
18 Correct 95 ms 3864 KB Output is correct
19 Correct 39 ms 1484 KB Output is correct
20 Correct 43 ms 1740 KB Output is correct
21 Correct 48 ms 1724 KB Output is correct
22 Correct 38 ms 1516 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 7 ms 944 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 6 ms 880 KB Output is correct
29 Correct 6 ms 832 KB Output is correct
30 Correct 64 ms 3308 KB Output is correct
31 Correct 35 ms 1272 KB Output is correct
32 Correct 36 ms 1228 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 6 ms 844 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 6 ms 716 KB Output is correct
40 Correct 6 ms 816 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 36 ms 1360 KB Output is correct
44 Correct 39 ms 1484 KB Output is correct
45 Correct 57 ms 2528 KB Output is correct
46 Correct 39 ms 1484 KB Output is correct
47 Correct 39 ms 1612 KB Output is correct
48 Correct 39 ms 1612 KB Output is correct
49 Correct 97 ms 3984 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 36 ms 1356 KB Output is correct
53 Correct 38 ms 1484 KB Output is correct
54 Correct 37 ms 1356 KB Output is correct
55 Correct 37 ms 1392 KB Output is correct
56 Correct 36 ms 1356 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 8 ms 980 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 8 ms 1028 KB Output is correct
61 Correct 98 ms 4164 KB Output is correct
62 Correct 98 ms 4168 KB Output is correct
63 Correct 1 ms 332 KB Output is correct