oj.uz

Submission #373661

# Submission time Handle Problem Language Result Execution time Memory
373661 2021-03-05T11:33:51 Z t12345 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 107 ms 1464 KB 
#include <iostream>
#include <cstdio>
#define N 105
#define K 1005
using namespace std;

typedef long long ll;
int n, m, k, b[N][K], s[N][K], pr[N][N], dt[N][N];
ll rt[N][N];
int lo, hi=1e9, md, ans;

bool f(int p) {
	int i, j, x;
	for(i=1; i<=n; i++) for(j=1; j<=n; j++) {
		rt[i][j] = (ll)p * dt[i][j] - pr[i][j];
	}
	for(x=1; x<=n; x++) for(i=1; i<=n; i++) for(j=1; j<=n; j++) {
		rt[i][j] = min(rt[i][j], rt[i][x] + rt[x][j]);
	}
	for(i=1; i<=n; i++) if(rt[i][i]<=0) return 1;
	return 0;
}

int main() {
	int i, j, x, u, v;
	cin >> n >> m >> k;
	for(i=1; i<=n; i++) for(j=1; j<=k; j++) scanf("%d%d", &b[i][j], &s[i][j]);
	for(i=1; i<=n; i++) for(j=1; j<=n; j++) for(x=1; x<=k; x++) {
		if(b[i][x]!=-1 && s[j][x]!=-1)
			pr[i][j] = max(pr[i][j], s[j][x] - b[i][x]);
	}
	for(i=1; i<=n; i++) for(j=1; j<=n; j++) dt[i][j] = 1e9;
	while(m--) scanf("%d%d", &u, &v), scanf("%d", &dt[u][v]);
	for(x=1; x<=n; x++) for(i=1; i<=n; i++) for(j=1; j<=n; j++) {
		dt[i][j] = min(dt[i][j], dt[i][x] + dt[x][j]);
	}
	while(lo <= hi) {
		md = lo+hi >> 1;
		if(f(md)) ans = md, lo = md+1;
		else hi = md-1;
	}
	cout << ans;
	return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:38:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |   md = lo+hi >> 1;
      |        ~~^~~
merchant.cpp:27:47: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |  for(i=1; i<=n; i++) for(j=1; j<=k; j++) scanf("%d%d", &b[i][j], &s[i][j]);
      |                                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:33:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |  while(m--) scanf("%d%d", &u, &v), scanf("%d", &dt[u][v]);
      |             ~~~~~^~~~~~~~~~~~~~~~
merchant.cpp:33:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |  while(m--) scanf("%d%d", &u, &v), scanf("%d", &dt[u][v]);
      |                                    ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1260 KB Output is correct
2 Correct 52 ms 1388 KB Output is correct
3 Correct 51 ms 1260 KB Output is correct
4 Correct 6 ms 748 KB Output is correct
5 Correct 6 ms 748 KB Output is correct
6 Correct 6 ms 748 KB Output is correct
7 Correct 7 ms 748 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 6 ms 748 KB Output is correct
10 Correct 6 ms 748 KB Output is correct
11 Correct 6 ms 748 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 7 ms 748 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 748 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 7 ms 748 KB Output is correct
4 Correct 7 ms 748 KB Output is correct
5 Correct 7 ms 748 KB Output is correct
6 Correct 7 ms 748 KB Output is correct
7 Correct 6 ms 748 KB Output is correct
8 Correct 47 ms 1388 KB Output is correct
9 Correct 107 ms 1464 KB Output is correct
10 Correct 49 ms 1260 KB Output is correct
11 Correct 45 ms 1388 KB Output is correct
12 Correct 45 ms 1260 KB Output is correct
13 Correct 41 ms 1388 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 748 KB Output is correct
2 Correct 6 ms 748 KB Output is correct
3 Correct 7 ms 748 KB Output is correct
4 Correct 8 ms 748 KB Output is correct
5 Correct 9 ms 748 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 748 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 6 ms 748 KB Output is correct
10 Correct 6 ms 748 KB Output is correct
11 Correct 10 ms 748 KB Output is correct
12 Correct 7 ms 748 KB Output is correct
13 Correct 7 ms 748 KB Output is correct
14 Correct 6 ms 748 KB Output is correct
15 Correct 8 ms 748 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 47 ms 1388 KB Output is correct
18 Correct 107 ms 1464 KB Output is correct
19 Correct 49 ms 1260 KB Output is correct
20 Correct 45 ms 1388 KB Output is correct
21 Correct 45 ms 1260 KB Output is correct
22 Correct 41 ms 1388 KB Output is correct
23 Correct 7 ms 748 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 7 ms 748 KB Output is correct
26 Correct 7 ms 748 KB Output is correct
27 Correct 7 ms 748 KB Output is correct
28 Correct 7 ms 748 KB Output is correct
29 Correct 6 ms 748 KB Output is correct
30 Correct 71 ms 1260 KB Output is correct
31 Correct 52 ms 1388 KB Output is correct
32 Correct 51 ms 1260 KB Output is correct
33 Correct 6 ms 748 KB Output is correct
34 Correct 6 ms 748 KB Output is correct
35 Correct 6 ms 748 KB Output is correct
36 Correct 7 ms 748 KB Output is correct
37 Correct 0 ms 364 KB Output is correct
38 Correct 6 ms 748 KB Output is correct
39 Correct 6 ms 748 KB Output is correct
40 Correct 6 ms 748 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 7 ms 748 KB Output is correct
43 Correct 40 ms 1260 KB Output is correct
44 Correct 42 ms 1332 KB Output is correct
45 Correct 78 ms 1260 KB Output is correct
46 Correct 42 ms 1388 KB Output is correct
47 Correct 42 ms 1260 KB Output is correct
48 Correct 42 ms 1388 KB Output is correct
49 Correct 103 ms 1388 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 39 ms 1260 KB Output is correct
53 Correct 41 ms 1260 KB Output is correct
54 Correct 41 ms 1260 KB Output is correct
55 Correct 41 ms 1324 KB Output is correct
56 Correct 41 ms 1388 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 8 ms 748 KB Output is correct
59 Correct 8 ms 748 KB Output is correct
60 Correct 8 ms 748 KB Output is correct
61 Correct 102 ms 1260 KB Output is correct
62 Correct 103 ms 1260 KB Output is correct
63 Correct 1 ms 364 KB Output is correct