oj.uz

Submission #107753

# Submission time Handle Problem Language Result Execution time Memory
107753 2019-04-25T16:15:28 Z Just_Solve_The_Problem Travelling Merchant (APIO17_merchant) C++11
100 / 100
 131 ms 3452 KB 
#include <bits/stdc++.h>

#define ll long long

using namespace std;

const int N = (int)1e2 + 7;
const ll inf = (ll)1e18;

int n, m, k;
vector<vector<int>> S, B;
ll dist[N][N], opt[N][N], dp[N][N];

bool check(int x) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (dist[i][j] == inf) {
				dp[i][j] = inf;
			} else {
				dp[i][j] = dist[i][j] * x - opt[i][j];
			}
		}
	}
	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		if (dp[i][i] <= 0) return 1;
	}
	return 0;
}

main() {
	scanf("%d %d %d", &n, &m, &k);
	S.resize(n, vector<int>(k, 0));
	B.resize(n, vector<int>(k, 0));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dist[i][j] = inf;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			scanf("%d %d", &B[i][j], &S[i][j]);
		}
	}
	for (int i = 0; i < m; i++) {
		int u, v, w;
		scanf("%d %d %d", &u, &v, &w);
		u--;
		v--;
		dist[u][v] = w;
	}
	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			for (int l = 0; l < k; l++) {
				if (B[i][l] >= 0 && S[j][l] >= 0)
					opt[i][j] = max(opt[i][j], -B[i][l] * 1LL + S[j][l]);
			}
		}
	}
	int l = 0;
	int r = 1e9 + 123;
	while (r - l > 1) {
		int mid = (l + r) >> 1;
		if (check(mid)) {
			l = mid;
		} else {
			r = mid;
		}
	}
	cout << l;
}

Compilation message

merchant.cpp:37:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
merchant.cpp: In function 'int main()':
merchant.cpp:38: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:48: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:53:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 2652 KB Output is correct
2 Correct 43 ms 632 KB Output is correct
3 Correct 40 ms 512 KB Output is correct
4 Correct 8 ms 384 KB Output is correct
5 Correct 8 ms 384 KB Output is correct
6 Correct 7 ms 384 KB Output is correct
7 Correct 9 ms 488 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 8 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 852 KB Output is correct
2 Correct 89 ms 3064 KB Output is correct
3 Correct 39 ms 768 KB Output is correct
4 Correct 43 ms 912 KB Output is correct
5 Correct 50 ms 896 KB Output is correct
6 Correct 44 ms 768 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 11 ms 508 KB Output is correct
10 Correct 9 ms 512 KB Output is correct
11 Correct 9 ms 572 KB Output is correct
12 Correct 11 ms 512 KB Output is correct
13 Correct 8 ms 512 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 512 KB Output is correct
2 Correct 10 ms 512 KB Output is correct
3 Correct 9 ms 612 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 9 ms 540 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 8 ms 512 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 9 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 8 ms 512 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 48 ms 852 KB Output is correct
18 Correct 89 ms 3064 KB Output is correct
19 Correct 39 ms 768 KB Output is correct
20 Correct 43 ms 912 KB Output is correct
21 Correct 50 ms 896 KB Output is correct
22 Correct 44 ms 768 KB Output is correct
23 Correct 8 ms 512 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 11 ms 508 KB Output is correct
26 Correct 9 ms 512 KB Output is correct
27 Correct 9 ms 572 KB Output is correct
28 Correct 11 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 41 ms 632 KB Output is correct
31 Correct 45 ms 768 KB Output is correct
32 Correct 63 ms 1656 KB Output is correct
33 Correct 46 ms 768 KB Output is correct
34 Correct 45 ms 760 KB Output is correct
35 Correct 45 ms 700 KB Output is correct
36 Correct 113 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 39 ms 512 KB Output is correct
40 Correct 49 ms 732 KB Output is correct
41 Correct 48 ms 640 KB Output is correct
42 Correct 45 ms 640 KB Output is correct
43 Correct 41 ms 512 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 11 ms 512 KB Output is correct
46 Correct 10 ms 512 KB Output is correct
47 Correct 13 ms 512 KB Output is correct
48 Correct 131 ms 3452 KB Output is correct
49 Correct 127 ms 3320 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 100 ms 2652 KB Output is correct
52 Correct 43 ms 632 KB Output is correct
53 Correct 40 ms 512 KB Output is correct
54 Correct 8 ms 384 KB Output is correct
55 Correct 8 ms 384 KB Output is correct
56 Correct 7 ms 384 KB Output is correct
57 Correct 9 ms 488 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 8 ms 384 KB Output is correct
60 Correct 7 ms 384 KB Output is correct
61 Correct 8 ms 384 KB Output is correct
62 Correct 3 ms 384 KB Output is correct
63 Correct 9 ms 384 KB Output is correct