oj.uz

Submission #118940

# Submission time Handle Problem Language Result Execution time Memory
118940 2019-06-20T05:44:06 Z Mahdi_Jfri Travelling Merchant (APIO17_merchant) C++14
100 / 100
 92 ms 3448 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back

const int maxn = 1e2 + 20;
const int maxm = 1e4 + 20;
const int maxk = 1e3 + 20;

int b[maxn][maxk] , s[maxn][maxk];

int d[maxn][maxn] , best[maxn][maxn] , n;

ll res[maxn][maxn];

bool check(ll x)
{
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			res[i][j] = d[i][j] * x - best[i][j];

	for(int k = 0; k < n; k++)
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				if(i != j)
					res[i][j] = min(res[i][j] , res[i][k] + res[k][j]);

	for(int i = 0; i < n; i++)
		for(int j = i + 1; j < n; j++)
			if(res[i][j] + res[j][i] <= 0)
					return 1;

	return 0;
}

int32_t main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int m , k;
	cin >> n >> m >> k;

	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++)
			cin >> b[i][j] >> s[i][j];

	memset(d , 63 , sizeof d);
	for(int i = 0; i < m; i++)
	{
		int a , b , c;
		cin >> a >> b >> c;
		a-- , b--;

		d[a][b] = min(d[a][b] , c);
	}

	for(int i = 0; i < n; i++)
		d[i][i] = 0;

	for(int k = 0; k < n; k++)
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				d[i][j] = min(d[i][j] , d[i][k] + d[k][j]);

	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			for(int ind = 0; ind < k; ind++)
				if(b[i][ind] != -1 && s[j][ind] != -1)
					best[i][j] = max(best[i][j] , s[j][ind] - b[i][ind]);

	int l = 0 , r = 2e9;

	while(r - l > 1)
	{
		int m = (l + r) / 2;
		if(check(m))
			l = m;
		else
			r = m;
	}

	cout << l << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1272 KB Output is correct
2 Correct 40 ms 1280 KB Output is correct
3 Correct 40 ms 1280 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 13 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 8 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1280 KB Output is correct
2 Correct 84 ms 1400 KB Output is correct
3 Correct 42 ms 1280 KB Output is correct
4 Correct 45 ms 1536 KB Output is correct
5 Correct 46 ms 1536 KB Output is correct
6 Correct 43 ms 1408 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 896 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 8 ms 896 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 26 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 1024 KB Output is correct
16 Correct 9 ms 896 KB Output is correct
17 Correct 44 ms 1280 KB Output is correct
18 Correct 84 ms 1400 KB Output is correct
19 Correct 42 ms 1280 KB Output is correct
20 Correct 45 ms 1536 KB Output is correct
21 Correct 46 ms 1536 KB Output is correct
22 Correct 43 ms 1408 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 8 ms 896 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 8 ms 896 KB Output is correct
29 Correct 8 ms 896 KB Output is correct
30 Correct 42 ms 1408 KB Output is correct
31 Correct 42 ms 1408 KB Output is correct
32 Correct 57 ms 1920 KB Output is correct
33 Correct 42 ms 1408 KB Output is correct
34 Correct 43 ms 1408 KB Output is correct
35 Correct 44 ms 1408 KB Output is correct
36 Correct 89 ms 3352 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 42 ms 1408 KB Output is correct
40 Correct 44 ms 1500 KB Output is correct
41 Correct 43 ms 1408 KB Output is correct
42 Correct 43 ms 1528 KB Output is correct
43 Correct 42 ms 1408 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 9 ms 896 KB Output is correct
46 Correct 10 ms 896 KB Output is correct
47 Correct 10 ms 1024 KB Output is correct
48 Correct 92 ms 3448 KB Output is correct
49 Correct 92 ms 3448 KB Output is correct
50 Correct 2 ms 512 KB Output is correct
51 Correct 66 ms 1272 KB Output is correct
52 Correct 40 ms 1280 KB Output is correct
53 Correct 40 ms 1280 KB Output is correct
54 Correct 7 ms 896 KB Output is correct
55 Correct 8 ms 896 KB Output is correct
56 Correct 7 ms 896 KB Output is correct
57 Correct 8 ms 896 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 7 ms 896 KB Output is correct
60 Correct 8 ms 896 KB Output is correct
61 Correct 13 ms 896 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 8 ms 896 KB Output is correct