oj.uz

Submission #499571

# Submission time Handle Problem Language Result Execution time Memory
499571 2021-12-28T18:13:47 Z fatemetmhr Travelling Merchant (APIO17_merchant) C++17
100 / 100
 104 ms 5100 KB 
//  ~Be name khoda~  //

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
#define cl       clear
#define endll    '\n'

const int maxn  =  110;
const int maxk  =  2e3   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   +  7;
const ll  inf   =  1e9   + 10;
const ll  inf2  =  2e18;

ll dp[2][maxn][maxn];
ll dis[maxn][maxn], val[maxn][maxn];
ll s[maxn][maxk], b[maxn][maxk];
int n, m, k;

inline bool check(ll avg){
	for(int i = 0; i < n; i++) for(int j = 0; j < n; j++){
		if(i == j) dp[1][i][j] = 1;
		else 
			dp[1][i][j] = dis[i][j] == inf ? inf2 : dis[i][j] * avg - val[i][j];
	}
	for(int i = 0; i < n; i++) for(int a = 0; a < n; a++) for(int b = 0; b < n; b++){
		if(i != a && i != b)
			dp[i%2][a][b] = min({inf2, dp[(i + 1)%2][a][b], dp[(i + 1)%2][a][i] + dp[(i + 1)%2][i][b]});
		else
			dp[i%2][a][b] = dp[(i + 1)%2][a][b];
	}
	ll mn = 1;
	for(int i = 0; i < n; i++)
		mn = min(mn, dp[(n - 1)%2][i][i]);
	return mn <= 0;
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	
	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(dp, 60, sizeof dp);
	for(int i = 0; i < m; i++){
		int a, b, len; cin >> a >> b >> len;
		a--; b--;
		dp[1][a][b] = len;
	}
	for(int i = 0; i < n; i++) dp[1][i][i] = 0;
	for(int i = 0; i < n; i++) for(int a = 0; a < n; a++) for(int b = 0; b < n; b++)
		dp[i%2][a][b] = min({inf, dp[(i + 1)%2][a][b], dp[(i + 1)%2][a][i] + dp[(i + 1)%2][i][b]});
	for(int i = 0; i < n; i++) for(int j = 0; j < n; j++){
		dis[i][j] = min(inf, dp[(n - 1)%2][i][j]);
		if(i != j) for(int r = 0; r < k; r++) if(min(s[j][r], b[i][r]) != -1)
			val[i][j] = max(val[i][j], s[j][r] - b[i][r]);
	}
	ll lo = 0, hi = inf;
	while(hi - lo > 1){
		ll mid = (lo + hi) >> 1;
		if(check(mid)) lo = mid;
		else hi = mid;
	}
	cout << lo << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 4164 KB Output is correct
2 Correct 61 ms 1396 KB Output is correct
3 Correct 49 ms 1452 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 6 ms 952 KB Output is correct
7 Correct 7 ms 1028 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 7 ms 964 KB Output is correct
10 Correct 7 ms 964 KB Output is correct
11 Correct 8 ms 972 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 8 ms 972 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 952 KB Output is correct
2 Correct 7 ms 1028 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 7 ms 964 KB Output is correct
5 Correct 7 ms 964 KB Output is correct
6 Correct 8 ms 972 KB Output is correct
7 Correct 1 ms 576 KB Output is correct
8 Correct 8 ms 972 KB Output is correct
9 Correct 7 ms 972 KB Output is correct
10 Correct 8 ms 952 KB Output is correct
11 Correct 7 ms 972 KB Output is correct
12 Correct 8 ms 1040 KB Output is correct
13 Correct 8 ms 972 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 7 ms 1004 KB Output is correct
16 Correct 7 ms 972 KB Output is correct
17 Correct 7 ms 972 KB Output is correct
18 Correct 7 ms 956 KB Output is correct
19 Correct 8 ms 972 KB Output is correct
20 Correct 8 ms 1096 KB Output is correct
21 Correct 7 ms 972 KB Output is correct
22 Correct 8 ms 972 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 7 ms 972 KB Output is correct
25 Correct 8 ms 972 KB Output is correct
26 Correct 0 ms 460 KB Output is correct
27 Correct 9 ms 964 KB Output is correct
28 Correct 10 ms 964 KB Output is correct
29 Correct 8 ms 1080 KB Output is correct
30 Correct 10 ms 976 KB Output is correct
31 Correct 7 ms 972 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 972 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 9 ms 964 KB Output is correct
4 Correct 10 ms 964 KB Output is correct
5 Correct 8 ms 1080 KB Output is correct
6 Correct 10 ms 976 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 53 ms 1732 KB Output is correct
9 Correct 100 ms 4584 KB Output is correct
10 Correct 51 ms 1596 KB Output is correct
11 Correct 54 ms 1740 KB Output is correct
12 Correct 53 ms 1836 KB Output is correct
13 Correct 57 ms 1612 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 972 KB Output is correct
2 Correct 8 ms 952 KB Output is correct
3 Correct 7 ms 972 KB Output is correct
4 Correct 8 ms 1040 KB Output is correct
5 Correct 8 ms 972 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 7 ms 972 KB Output is correct
9 Correct 7 ms 972 KB Output is correct
10 Correct 7 ms 956 KB Output is correct
11 Correct 8 ms 972 KB Output is correct
12 Correct 8 ms 1096 KB Output is correct
13 Correct 7 ms 972 KB Output is correct
14 Correct 8 ms 972 KB Output is correct
15 Correct 9 ms 1116 KB Output is correct
16 Correct 7 ms 972 KB Output is correct
17 Correct 53 ms 1732 KB Output is correct
18 Correct 100 ms 4584 KB Output is correct
19 Correct 51 ms 1596 KB Output is correct
20 Correct 54 ms 1740 KB Output is correct
21 Correct 53 ms 1836 KB Output is correct
22 Correct 57 ms 1612 KB Output is correct
23 Correct 8 ms 972 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 9 ms 964 KB Output is correct
26 Correct 10 ms 964 KB Output is correct
27 Correct 8 ms 1080 KB Output is correct
28 Correct 10 ms 976 KB Output is correct
29 Correct 7 ms 972 KB Output is correct
30 Correct 70 ms 4164 KB Output is correct
31 Correct 61 ms 1396 KB Output is correct
32 Correct 49 ms 1452 KB Output is correct
33 Correct 7 ms 844 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 6 ms 952 KB Output is correct
36 Correct 7 ms 1028 KB Output is correct
37 Correct 0 ms 460 KB Output is correct
38 Correct 7 ms 964 KB Output is correct
39 Correct 7 ms 964 KB Output is correct
40 Correct 8 ms 972 KB Output is correct
41 Correct 1 ms 576 KB Output is correct
42 Correct 8 ms 972 KB Output is correct
43 Correct 53 ms 1600 KB Output is correct
44 Correct 52 ms 1612 KB Output is correct
45 Correct 62 ms 3168 KB Output is correct
46 Correct 66 ms 1592 KB Output is correct
47 Correct 57 ms 1744 KB Output is correct
48 Correct 50 ms 1660 KB Output is correct
49 Correct 104 ms 5044 KB Output is correct
50 Correct 1 ms 588 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 50 ms 1352 KB Output is correct
53 Correct 50 ms 1580 KB Output is correct
54 Correct 50 ms 1612 KB Output is correct
55 Correct 49 ms 1484 KB Output is correct
56 Correct 49 ms 1356 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 9 ms 1092 KB Output is correct
59 Correct 9 ms 1188 KB Output is correct
60 Correct 9 ms 1100 KB Output is correct
61 Correct 101 ms 5100 KB Output is correct
62 Correct 103 ms 5012 KB Output is correct
63 Correct 1 ms 460 KB Output is correct