oj.uz

Submission #454777

# Submission time Handle Problem Language Result Execution time Memory
454777 2021-08-05T08:09:23 Z sean617 Travelling Merchant (APIO17_merchant) C++
100 / 100
 121 ms 4172 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#define N 105
using namespace std;

typedef long long ll;
ll n, m, k, tc, l, r, md, ans, M = 1e9, mx, B[N][1005], S[N][1005], di[N][N], d[N][N], pr[N][N];
struct str {
	ll z, c1, c2;
};

bool operator < (str p, str q) {
	return p.c1 * q.c2 < q.c1 * p.c2;
}
vector<str> a, b;
int main()
{
	ll i, j, t1, t2, t3, kk, us, ut;
	str t;
	cin >> n >> m >> k;
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= k; j++) {
			scanf ("%lld %lld", &B[i][j], &S[i][j]);
		}
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++) {
			di[i][j] = M;
		}
//		di[i][i] = 0;
	}
	for (i = 0; i < m; i++) {
		scanf ("%lld %lld %lld", &t1, &t2, &t3);
		di[t1][t2] = min(di[t1][t2], t3);
	}
	for (kk = 1; kk <= n; kk++) {
		for (i = 1; i <= n; i++) {
			for (j = 1; j <= n; j++) {
				di[i][j] = min(di[i][j], di[i][kk] +di[kk][j]);
			}
		}
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++) {
			if (i == j) continue;
//			if (di[i][j] == M) {a.push_back({i, j, -M}); continue;}
			for (kk = 1; kk <= k; kk++) {
				if (B[i][kk] != -1 && S[j][kk] != -1 && S[j][kk] - B[i][kk] > 0) pr[i][j] = max(pr[i][j], S[j][kk] - B[i][kk]);
			}
//			a.push_back({i, j, (mx == -1 ? 0 : mx)});
		}
	}
	ans = 0;
	l = 1;
	r = 1e9;
	bool up;
	while (l < r) {
		md = (l + r) / 2;
//		b.clear();
//		for (i = 0; i < a.size(); i++) {
//			t1 = a[i].z;
//			t2 = a[i].c1;
//			t3 = md * di[t1][t2] - a[i].c2;
//			d[t1][t2] = t3;
////			b.push_back({t1, t2, t3});
////			if (t3 > 0)
//		}
//		for (i =1; i <= n; i++) d[i][i] = 0;
//		for (i = 1; i <= n; i++) d[i] = M;
//		d[1] = 0;
//		for (i = 0; i <= n; i++) {
//			up = 0;
//			for (j = 0; j < b.size(); j++) {
//				t1 = b[j].z;
//				t2 = b[j].c1;
//				if (d[t1] + b[j].c2 < d[t2]) {d[t2] = d[t1] + b[j].c2; up = 1;}
//			}
//			if (!up) break;
//		}
		for (i = 1; i <= n; i++) {
			for (j = 1; j <= n; j++) {
				d[i][j] = di[i][j] * md - pr[i][j];
			}
		}
		for (kk =1; kk <= n; kk++) {
			for (i = 1; i <= n; i++) {
				for (j = 1; j <= n; j++) d[i][j] = min(d[i][j], d[i][kk] + d[kk][j]);
			}
		}
		for (i = 1; i <= n; i++) if (d[i][i] <= 0) break;
		if (i <= n) {l = md +1; ans = md;}
		else r = md;
	}
	cout << ans;
//	mx = 0;
//	for (tc = 1; tc <= n; tc++) {
//		for (i = 1; i <= n; i++) {dt[i] = -1; ds[i] = -1;}
//		dt[tc] = 0; ds[tc] = 0;
//		while ()
//		for (j = 0; j <= n; j++) {
//			for (i = 0; i < a.size(); i++) {
//				t1 = a[i].z;
//				t2 = a[i].c1;
//				if (dt[t1] == -1) continue;
//				ut = dt[t1] + di[t1][t2];
//				us = ds[t1] + a[i].c2;
//				if (t2 == tc) mx = max(mx, us / ut);
//				else {
//					if (dt[t2] == -1 || us * dt[t2] > ut * ds[t2]) {ds[t2] = us; dt[t2] = ut;}
//				}
//			}
//		}
//	}
//	cout << mx << endl;
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:19:27: warning: unused variable 'us' [-Wunused-variable]
   19 |  ll i, j, t1, t2, t3, kk, us, ut;
      |                           ^~
merchant.cpp:19:31: warning: unused variable 'ut' [-Wunused-variable]
   19 |  ll i, j, t1, t2, t3, kk, us, ut;
      |                               ^~
merchant.cpp:20:6: warning: unused variable 't' [-Wunused-variable]
   20 |  str t;
      |      ^
merchant.cpp:57:7: warning: unused variable 'up' [-Wunused-variable]
   57 |  bool up;
      |       ^~
merchant.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |    scanf ("%lld %lld", &B[i][j], &S[i][j]);
      |    ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:34:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |   scanf ("%lld %lld %lld", &t1, &t2, &t3);
      |   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 3188 KB Output is correct
2 Correct 42 ms 1228 KB Output is correct
3 Correct 42 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 9 ms 716 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 1 ms 332 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 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 8 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 716 KB Output is correct
2 Correct 6 ms 844 KB Output is correct
3 Correct 1 ms 332 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 1 ms 332 KB Output is correct
8 Correct 8 ms 844 KB Output is correct
9 Correct 7 ms 844 KB Output is correct
10 Correct 6 ms 824 KB Output is correct
11 Correct 7 ms 844 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 7 ms 876 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 716 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 6 ms 832 KB Output is correct
18 Correct 7 ms 844 KB Output is correct
19 Correct 7 ms 844 KB Output is correct
20 Correct 7 ms 920 KB Output is correct
21 Correct 6 ms 716 KB Output is correct
22 Correct 7 ms 844 KB Output is correct
23 Correct 8 ms 932 KB Output is correct
24 Correct 6 ms 716 KB Output is correct
25 Correct 7 ms 824 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 8 ms 844 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 716 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 824 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 8 ms 844 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 716 KB Output is correct
8 Correct 45 ms 1616 KB Output is correct
9 Correct 121 ms 3152 KB Output is correct
10 Correct 43 ms 1484 KB Output is correct
11 Correct 44 ms 1712 KB Output is correct
12 Correct 43 ms 1728 KB Output is correct
13 Correct 43 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 824 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 716 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 6 ms 832 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 7 ms 844 KB Output is correct
12 Correct 7 ms 920 KB Output is correct
13 Correct 6 ms 716 KB Output is correct
14 Correct 7 ms 844 KB Output is correct
15 Correct 8 ms 932 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 45 ms 1616 KB Output is correct
18 Correct 121 ms 3152 KB Output is correct
19 Correct 43 ms 1484 KB Output is correct
20 Correct 44 ms 1712 KB Output is correct
21 Correct 43 ms 1728 KB Output is correct
22 Correct 43 ms 1484 KB Output is correct
23 Correct 7 ms 824 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 8 ms 844 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 716 KB Output is correct
30 Correct 71 ms 3188 KB Output is correct
31 Correct 42 ms 1228 KB Output is correct
32 Correct 42 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 9 ms 716 KB Output is correct
36 Correct 6 ms 844 KB Output is correct
37 Correct 1 ms 332 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 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 8 ms 844 KB Output is correct
43 Correct 40 ms 1356 KB Output is correct
44 Correct 43 ms 1588 KB Output is correct
45 Correct 64 ms 2552 KB Output is correct
46 Correct 43 ms 1484 KB Output is correct
47 Correct 42 ms 1484 KB Output is correct
48 Correct 41 ms 1592 KB Output is correct
49 Correct 92 ms 4172 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 1228 KB Output is correct
53 Correct 43 ms 1356 KB Output is correct
54 Correct 41 ms 1356 KB Output is correct
55 Correct 42 ms 1380 KB Output is correct
56 Correct 40 ms 1228 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 9 ms 1008 KB Output is correct
59 Correct 9 ms 972 KB Output is correct
60 Correct 11 ms 972 KB Output is correct
61 Correct 87 ms 4136 KB Output is correct
62 Correct 94 ms 4120 KB Output is correct
63 Correct 1 ms 332 KB Output is correct