oj.uz

Submission #114309

# Submission time Handle Problem Language Result Execution time Memory
114309 2019-05-31T19:27:15 Z Bruteforceman Travelling Merchant (APIO17_merchant) C++11
100 / 100
 917 ms 3576 KB 
#include "bits/stdc++.h"
using namespace std;
int n, m, k;
int b[105][1005];
int s[105][1005];
long long a[105][105];
long long opt[105][105];
const long long inf = 2e9;

bool good(long long guess) {
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			opt[i][j] = inf;
		}
	}
	for(int item = 1; item <= k; item++) {
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				if(i == j) continue;
				opt[i][j] = min(opt[i][j], guess * a[i][j]);
				if(b[i][item] != -1 && s[j][item] != -1) {
					opt[i][j] = min(opt[i][j], b[i][item] - s[j][item] + guess * a[i][j]);
				}
			}
		}
	}
	for(int x = 1; x <= n; x++) {
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				opt[i][j] = min(opt[i][j], opt[i][x] + opt[x][j]);
			}
		}
	}
	for(int i = 1; i <= n; i++) {
		if(opt[i][i] <= 0) return true;
	}
	return false;
}

int search(int b, int e) {
	if(b == e) {
		return b;
	}
	int mid = (b + e + 1) >> 1;
	if(good(mid)) {
		return search(mid, e);
	} else {
		return search(b, mid - 1);
	}
}

int main(int argc, char const *argv[])
{
	scanf("%d %d %d", &n, &m, &k);
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= k; j++) {
			scanf("%d %d", &b[i][j], &s[i][j]);
		}
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			a[i][j] = inf;
		}
		a[i][i] = 0;
	}
	for(int i = 1; i <= m; i++) {
		int p, q, r;
		scanf("%d %d %d", &p, &q, &r);
		a[p][q] = r;
	}
	for(int x = 1; x <= n; x++) {
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				a[i][j] = min(a[i][j], a[i][x] + a[x][j]);
			}
		}
	}
	printf("%d\n", search(0, 1000000000));
	return 0;
}

Compilation message

merchant.cpp: In function 'int main(int, const char**)':
merchant.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &m, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:57:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d", &b[i][j], &s[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &p, &q, &r);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 2680 KB Output is correct
2 Correct 37 ms 1280 KB Output is correct
3 Correct 37 ms 1400 KB Output is correct
4 Correct 7 ms 748 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 15 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 14 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 1464 KB Output is correct
2 Correct 806 ms 3112 KB Output is correct
3 Correct 67 ms 1408 KB Output is correct
4 Correct 114 ms 1656 KB Output is correct
5 Correct 111 ms 1536 KB Output is correct
6 Correct 69 ms 1408 KB Output is correct
7 Correct 17 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 17 ms 896 KB Output is correct
10 Correct 17 ms 896 KB Output is correct
11 Correct 17 ms 896 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 8 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 14 ms 896 KB Output is correct
4 Correct 19 ms 896 KB Output is correct
5 Correct 17 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 14 ms 768 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 13 ms 868 KB Output is correct
11 Correct 17 ms 896 KB Output is correct
12 Correct 17 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 11 ms 768 KB Output is correct
15 Correct 17 ms 896 KB Output is correct
16 Correct 8 ms 768 KB Output is correct
17 Correct 112 ms 1464 KB Output is correct
18 Correct 806 ms 3112 KB Output is correct
19 Correct 67 ms 1408 KB Output is correct
20 Correct 114 ms 1656 KB Output is correct
21 Correct 111 ms 1536 KB Output is correct
22 Correct 69 ms 1408 KB Output is correct
23 Correct 17 ms 896 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 17 ms 896 KB Output is correct
26 Correct 17 ms 896 KB Output is correct
27 Correct 17 ms 896 KB Output is correct
28 Correct 7 ms 768 KB Output is correct
29 Correct 8 ms 768 KB Output is correct
30 Correct 47 ms 1372 KB Output is correct
31 Correct 95 ms 1500 KB Output is correct
32 Correct 514 ms 1792 KB Output is correct
33 Correct 94 ms 1408 KB Output is correct
34 Correct 94 ms 1400 KB Output is correct
35 Correct 95 ms 1400 KB Output is correct
36 Correct 813 ms 3320 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 48 ms 1280 KB Output is correct
40 Correct 57 ms 1408 KB Output is correct
41 Correct 63 ms 1400 KB Output is correct
42 Correct 53 ms 1280 KB Output is correct
43 Correct 42 ms 1280 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 27 ms 896 KB Output is correct
46 Correct 28 ms 896 KB Output is correct
47 Correct 27 ms 896 KB Output is correct
48 Correct 917 ms 3576 KB Output is correct
49 Correct 878 ms 3396 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 618 ms 2680 KB Output is correct
52 Correct 37 ms 1280 KB Output is correct
53 Correct 37 ms 1400 KB Output is correct
54 Correct 7 ms 748 KB Output is correct
55 Correct 7 ms 768 KB Output is correct
56 Correct 7 ms 768 KB Output is correct
57 Correct 15 ms 896 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 7 ms 768 KB Output is correct
60 Correct 8 ms 896 KB Output is correct
61 Correct 8 ms 768 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 14 ms 896 KB Output is correct