oj.uz

Submission #566691

# Submission time Handle Problem Language Result Execution time Memory
566691 2022-05-22T16:25:37 Z ngpin04 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 171 ms 3348 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
	return l + rd() % (r - l + 1);
}
const int N = 105; 
const int K = 1005;
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

long long cost[N][N];
long long dis[N][N];

int prof[N][N];
int d[N][N];
int b[N][K];
int s[N][K];
int cnt[N];
int n,m,k;

bool inq[N];

bool solve(int x) {
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++)
		dis[i][j] = -ooo;

	for (int i = 1; i <= n; i++)
	for (int k = 1; k <= n; k++)  
	for (int j = 1; j <= n; j++) if (d[i][j] < oo && d[j][k] < oo) {
		if (i == j && j == k)
			continue;
		// cerr << i << " " << j << " " << k << "\n";
		// cerr << prof[j][k] << "\n";
		// cerr << d[i][j] << " " << d[j][k] << "\n";
		maxi(dis[i][k], prof[j][k] - 1LL * (d[i][j] + d[j][k]) * x);
	}

	// for (int i = 1; i <= n; i++)
	// for (int j = 1; j <= n; j++)
	// 	cerr << i << " " << j << " " << cost[i][j] << "\n";

	for (int j = 1; j <= n; j++)
	for (int i = 1; i <= n; i++)
	for (int k = 1; k <= n; k++)
		maxi(dis[i][k], dis[i][j] + dis[j][k]);

	for (int i = 1; i <= n; i++) 
		if (dis[i][i] >= 0)
			return true;

	return false;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	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];

	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++)
		if (i != j)
			d[i][j] = oo;

	for (int i = 1; i <= m; i++) {
		int u,v,w;
		cin >> u >> v >> w;
		mini(d[u][v], w);
	}

	for (int j = 1; j <= n; j++)
	for (int i = 1; i <= n; i++)
	for (int k = 1; k <= n; k++)
		mini(d[i][k], d[i][j] + d[j][k]);

	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++)
	for (int it = 1; it <= k; it++)  
		if (s[j][it] != -1 && b[i][it] != -1)
			maxi(prof[i][j], s[j][it] - b[i][it]);

	int lo = 0;
	int hi = oo + 1;
	while (hi - lo > 1) {
		int mid = (lo + hi) >> 1;
		if (solve(mid))
			lo = mid;
		else
			hi = mid;
	}

	cout << lo;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 1236 KB Output is correct
2 Correct 75 ms 1236 KB Output is correct
3 Correct 76 ms 1236 KB Output is correct
4 Correct 12 ms 724 KB Output is correct
5 Correct 14 ms 792 KB Output is correct
6 Correct 11 ms 716 KB Output is correct
7 Correct 15 ms 828 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 12 ms 716 KB Output is correct
10 Correct 12 ms 724 KB Output is correct
11 Correct 13 ms 796 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 13 ms 824 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 716 KB Output is correct
2 Correct 15 ms 828 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 12 ms 716 KB Output is correct
5 Correct 12 ms 724 KB Output is correct
6 Correct 13 ms 796 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 13 ms 824 KB Output is correct
9 Correct 14 ms 808 KB Output is correct
10 Correct 13 ms 716 KB Output is correct
11 Correct 13 ms 836 KB Output is correct
12 Correct 12 ms 724 KB Output is correct
13 Correct 20 ms 848 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 11 ms 724 KB Output is correct
16 Correct 14 ms 808 KB Output is correct
17 Correct 12 ms 824 KB Output is correct
18 Correct 13 ms 832 KB Output is correct
19 Correct 16 ms 852 KB Output is correct
20 Correct 15 ms 852 KB Output is correct
21 Correct 14 ms 832 KB Output is correct
22 Correct 15 ms 852 KB Output is correct
23 Correct 15 ms 892 KB Output is correct
24 Correct 11 ms 724 KB Output is correct
25 Correct 21 ms 724 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 19 ms 852 KB Output is correct
28 Correct 17 ms 856 KB Output is correct
29 Correct 16 ms 868 KB Output is correct
30 Correct 14 ms 836 KB Output is correct
31 Correct 14 ms 820 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 724 KB Output is correct
2 Correct 1 ms 368 KB Output is correct
3 Correct 19 ms 852 KB Output is correct
4 Correct 17 ms 856 KB Output is correct
5 Correct 16 ms 868 KB Output is correct
6 Correct 14 ms 836 KB Output is correct
7 Correct 14 ms 820 KB Output is correct
8 Correct 132 ms 1272 KB Output is correct
9 Correct 171 ms 3044 KB Output is correct
10 Correct 122 ms 1364 KB Output is correct
11 Correct 140 ms 1492 KB Output is correct
12 Correct 133 ms 1492 KB Output is correct
13 Correct 100 ms 1248 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 808 KB Output is correct
2 Correct 13 ms 716 KB Output is correct
3 Correct 13 ms 836 KB Output is correct
4 Correct 12 ms 724 KB Output is correct
5 Correct 20 ms 848 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 11 ms 724 KB Output is correct
8 Correct 14 ms 808 KB Output is correct
9 Correct 12 ms 824 KB Output is correct
10 Correct 13 ms 832 KB Output is correct
11 Correct 16 ms 852 KB Output is correct
12 Correct 15 ms 852 KB Output is correct
13 Correct 14 ms 832 KB Output is correct
14 Correct 15 ms 852 KB Output is correct
15 Correct 15 ms 892 KB Output is correct
16 Correct 11 ms 724 KB Output is correct
17 Correct 132 ms 1272 KB Output is correct
18 Correct 171 ms 3044 KB Output is correct
19 Correct 122 ms 1364 KB Output is correct
20 Correct 140 ms 1492 KB Output is correct
21 Correct 133 ms 1492 KB Output is correct
22 Correct 100 ms 1248 KB Output is correct
23 Correct 21 ms 724 KB Output is correct
24 Correct 1 ms 368 KB Output is correct
25 Correct 19 ms 852 KB Output is correct
26 Correct 17 ms 856 KB Output is correct
27 Correct 16 ms 868 KB Output is correct
28 Correct 14 ms 836 KB Output is correct
29 Correct 14 ms 820 KB Output is correct
30 Correct 98 ms 1236 KB Output is correct
31 Correct 75 ms 1236 KB Output is correct
32 Correct 76 ms 1236 KB Output is correct
33 Correct 12 ms 724 KB Output is correct
34 Correct 14 ms 792 KB Output is correct
35 Correct 11 ms 716 KB Output is correct
36 Correct 15 ms 828 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 12 ms 716 KB Output is correct
39 Correct 12 ms 724 KB Output is correct
40 Correct 13 ms 796 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 13 ms 824 KB Output is correct
43 Correct 84 ms 1284 KB Output is correct
44 Correct 86 ms 1344 KB Output is correct
45 Correct 97 ms 1684 KB Output is correct
46 Correct 82 ms 1332 KB Output is correct
47 Correct 79 ms 1340 KB Output is correct
48 Correct 83 ms 1344 KB Output is correct
49 Correct 144 ms 3148 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 96 ms 1268 KB Output is correct
53 Correct 103 ms 1376 KB Output is correct
54 Correct 92 ms 1312 KB Output is correct
55 Correct 92 ms 1276 KB Output is correct
56 Correct 99 ms 1356 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 17 ms 856 KB Output is correct
59 Correct 19 ms 852 KB Output is correct
60 Correct 15 ms 848 KB Output is correct
61 Correct 126 ms 3348 KB Output is correct
62 Correct 125 ms 3328 KB Output is correct
63 Correct 1 ms 372 KB Output is correct