oj.uz

Submission #248871

# Submission time Handle Problem Language Result Execution time Memory
248871 2020-07-13T15:22:56 Z patrikpavic2 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 123 ms 4272 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long ll;

const ll INF = (ll)1e9;

const int N = 105;
const int K = 1005;

ll dis[N][N], dp[N][N], zar[N][N], B[N][K], S[N][K];
int n, m, q;

void floyd(){
	for(int k = 1;k <= n;k++)
		for(int i = 1;i <= n;i++)
			for(int j = 1;j <= n;j++)
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}

bool mogu(ll x){
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= n;j++)
			dp[i][j] = x * dis[i][j] - zar[i][j];
	for(int k = 1;k <= n;k++)
		for(int i = 1;i <= n;i++)
			for(int j = 1;j <= n;j++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
	for(int i = 1;i <= n;i++)
		if(dp[i][i] <= 0)
			return 1;
	return 0;
}

int main(){
	scanf("%d%d%d", &n, &m, &q);	
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= q;j++)
			scanf("%lld%lld", &B[i][j], &S[i][j]);
		for(int j = 1;j <= n;j++)
			dis[i][j] = INF;
	}
	for(;m--;){
		int x, y, z; scanf("%d%d%d", &x, &y, &z);
		dis[x][y] = z;
	}
	floyd();
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= n;j++)
			for(int k = 1;k <= q;k++)
				if(B[i][k] != -1 && S[j][k] != -1)
					zar[i][j] = max(zar[i][j], S[j][k] - B[i][k]);
	ll ans = 0;
	for(int i = 30;i >= 0;i--)
		if(mogu((1LL << i) + ans))
			ans += (1LL << i);
	printf("%lld\n", ans);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &m, &q); 
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:42:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%lld", &B[i][j], &S[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:47:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y, z; scanf("%d%d%d", &x, &y, &z);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 2040 KB Output is correct
2 Correct 37 ms 1280 KB Output is correct
3 Correct 37 ms 1280 KB Output is correct
4 Correct 5 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 6 ms 768 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 7 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1536 KB Output is correct
2 Correct 106 ms 2200 KB Output is correct
3 Correct 39 ms 1408 KB Output is correct
4 Correct 43 ms 1536 KB Output is correct
5 Correct 45 ms 1536 KB Output is correct
6 Correct 39 ms 1408 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 5 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 896 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 9 ms 896 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 6 ms 896 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 6 ms 896 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 43 ms 1536 KB Output is correct
18 Correct 106 ms 2200 KB Output is correct
19 Correct 39 ms 1408 KB Output is correct
20 Correct 43 ms 1536 KB Output is correct
21 Correct 45 ms 1536 KB Output is correct
22 Correct 39 ms 1408 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 7 ms 896 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 5 ms 896 KB Output is correct
30 Correct 38 ms 1408 KB Output is correct
31 Correct 42 ms 1628 KB Output is correct
32 Correct 65 ms 2680 KB Output is correct
33 Correct 48 ms 1536 KB Output is correct
34 Correct 41 ms 1536 KB Output is correct
35 Correct 41 ms 1528 KB Output is correct
36 Correct 112 ms 4148 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 38 ms 1408 KB Output is correct
40 Correct 40 ms 1408 KB Output is correct
41 Correct 39 ms 1408 KB Output is correct
42 Correct 37 ms 1408 KB Output is correct
43 Correct 37 ms 1280 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 8 ms 1024 KB Output is correct
46 Correct 8 ms 1024 KB Output is correct
47 Correct 8 ms 1024 KB Output is correct
48 Correct 123 ms 4272 KB Output is correct
49 Correct 114 ms 4216 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 74 ms 2040 KB Output is correct
52 Correct 37 ms 1280 KB Output is correct
53 Correct 37 ms 1280 KB Output is correct
54 Correct 5 ms 768 KB Output is correct
55 Correct 5 ms 768 KB Output is correct
56 Correct 5 ms 768 KB Output is correct
57 Correct 6 ms 896 KB Output is correct
58 Correct 0 ms 512 KB Output is correct
59 Correct 5 ms 768 KB Output is correct
60 Correct 6 ms 768 KB Output is correct
61 Correct 6 ms 768 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 7 ms 896 KB Output is correct