oj.uz

Submission #211113

# Submission time Handle Problem Language Result Execution time Memory
211113 2020-03-19T08:51:37 Z spdskatr Travelling Merchant (APIO17_merchant) C++14
100 / 100
 123 ms 3568 KB 
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>

using namespace std;

int N, M, K, b[105][1005], s[105][1005];
long long adj[105][105], profit[105][105];
long long tot[105][105];

int solve(int offset) {
	for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) {
		tot[i][j] = profit[i][j] - offset * adj[i][j];
	}
	for (int m = 1; m <= N; m++) for (int u = 1; u <= N; u++) for (int v = 1; v <= N; v++) {
		tot[u][v] = max(tot[u][v], tot[u][m] + tot[m][v]);
	}
	for (int u = 1; u <= N; u++) for (int v = 1; v <= N; v++) {
		if (u != v && tot[u][v] + profit[v][u] - offset * adj[v][u] >= 0) {
			return 1;
		}
	}
	return 0;
}

int main() {
	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++) {
			adj[i][j] = 2000000005;
		}
		adj[i][i] = 0;
	}
	for (int i = 0; i < M; i++) {
		int v, w, t;
		scanf("%d %d %d", &v, &w, &t);
		adj[v][w] = t;
	}
	for (int m = 1; m <= N; m++) for (int u = 1; u <= N; u++) for (int v = 1; v <= N; v++) {
		adj[u][v] = min(adj[u][v], adj[u][m] + adj[m][v]);
	}
	for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) for (int k = 1; k <= K; k++) {
		if (s[j][k] != -1 && b[i][k] != -1)
			profit[i][j] = max(profit[i][j], (long long)s[j][k] - b[i][k]);
	}
	int lo = 0, hi = 2000000001;
	while (lo + 1 < hi) {
		int mid = (lo + hi) / 2;
		if (solve(mid)) lo = mid;
		else hi = mid;
	}
	printf("%d\n", lo);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:28: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:31: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:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &v, &w, &t);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 2552 KB Output is correct
2 Correct 42 ms 1280 KB Output is correct
3 Correct 42 ms 1280 KB Output is correct
4 Correct 10 ms 768 KB Output is correct
5 Correct 10 ms 768 KB Output is correct
6 Correct 10 ms 768 KB Output is correct
7 Correct 11 ms 768 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 11 ms 768 KB Output is correct
10 Correct 11 ms 768 KB Output is correct
11 Correct 10 ms 768 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 11 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1408 KB Output is correct
2 Correct 112 ms 3064 KB Output is correct
3 Correct 48 ms 1408 KB Output is correct
4 Correct 50 ms 1536 KB Output is correct
5 Correct 48 ms 1536 KB Output is correct
6 Correct 47 ms 1408 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 14 ms 896 KB Output is correct
10 Correct 12 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 10 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 768 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 1024 KB Output is correct
4 Correct 10 ms 768 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 14 ms 896 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 11 ms 768 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 11 ms 768 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 12 ms 896 KB Output is correct
16 Correct 13 ms 768 KB Output is correct
17 Correct 51 ms 1408 KB Output is correct
18 Correct 112 ms 3064 KB Output is correct
19 Correct 48 ms 1408 KB Output is correct
20 Correct 50 ms 1536 KB Output is correct
21 Correct 48 ms 1536 KB Output is correct
22 Correct 47 ms 1408 KB Output is correct
23 Correct 11 ms 896 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 14 ms 896 KB Output is correct
26 Correct 12 ms 896 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 10 ms 768 KB Output is correct
30 Correct 42 ms 1280 KB Output is correct
31 Correct 46 ms 1408 KB Output is correct
32 Correct 65 ms 1792 KB Output is correct
33 Correct 45 ms 1408 KB Output is correct
34 Correct 48 ms 1408 KB Output is correct
35 Correct 48 ms 1408 KB Output is correct
36 Correct 118 ms 3428 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 47 ms 1400 KB Output is correct
40 Correct 47 ms 1408 KB Output is correct
41 Correct 44 ms 1408 KB Output is correct
42 Correct 44 ms 1280 KB Output is correct
43 Correct 46 ms 1280 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 13 ms 896 KB Output is correct
46 Correct 13 ms 896 KB Output is correct
47 Correct 13 ms 896 KB Output is correct
48 Correct 118 ms 3568 KB Output is correct
49 Correct 123 ms 3448 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 79 ms 2552 KB Output is correct
52 Correct 42 ms 1280 KB Output is correct
53 Correct 42 ms 1280 KB Output is correct
54 Correct 10 ms 768 KB Output is correct
55 Correct 10 ms 768 KB Output is correct
56 Correct 10 ms 768 KB Output is correct
57 Correct 11 ms 768 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 11 ms 768 KB Output is correct
60 Correct 11 ms 768 KB Output is correct
61 Correct 10 ms 768 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 11 ms 768 KB Output is correct