oj.uz

Submission #295280

# Submission time Handle Problem Language Result Execution time Memory
295280 2020-09-09T14:58:23 Z BeanZ Travelling Merchant (APIO17_merchant) C++14
100 / 100
 86 ms 4424 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
ll dp[105][105], p[105][105], dist[105][105], b[105][1005], s[105][1005];
bool chk(ll mid, ll n){
        memset(dp, 0, sizeof(dp));
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= n; j++){
                        dp[i][j] = p[i][j] - mid * dist[i][j];
                }
        }
        for (int k = 1; k <= n; k++){
                for (int i = 1; i <= n; i++){
                        for (int j = 1; j <= n; j++){
                                if (i != j) dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
                        }
                }
        }
        for (int i = 1; i <= n; i++){
                for (int j = i + 1; j <= n; j++){
                        if ((dp[i][j] + dp[j][i]) >= 0) return true;
                }
        }
        return false;
}
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("balance.in", "r")){
                freopen("balance.in", "r", stdin);
                freopen("balance.out", "w", stdout);
        }
        ll n, m, k;
        cin >> n >> m >> k;
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= k; j++){
                        cin >> b[i][j] >> s[i][j];
                }
        }
        for (int i = 1; i <= n; i++){
                for (int j = 1; j <= n; j++){
                        dist[i][j] = 1e9;
                }
        }
        for (int i = 1; i <= m; i++){
                ll u, v, c;
                cin >> u >> v >> c;
                dist[u][v] = c;
        }
        for (int x = 1; x <= n; x++){
                for (int i = 1; i <= n; i++){
                        for (int j = 1; j <= n; j++){
                                dist[i][j] = min(dist[i][j], dist[i][x] + dist[x][j]);
                        }
                }
        }
        for (int x = 1; x <= k; x++){
                for (int i = 1; i <= n; i++){
                        for (int j = 1; j <= n; j++){
                                if (b[i][x] > 0 && s[j][x] > 0) p[i][j] = max(p[i][j], s[j][x] - b[i][x]);
                        }
                }
        }
        ll l = 0, h = 1e9;
        while (l <= h){
                ll mid = (l + h) >> 1;
                if (chk(mid, n)) l = mid + 1;
                else h = mid - 1;
        }
        cout << max(h, 0ll);
}
/*
*/

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:34:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   34 |                 freopen("balance.in", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:35:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   35 |                 freopen("balance.out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 3172 KB Output is correct
2 Correct 44 ms 1280 KB Output is correct
3 Correct 46 ms 1280 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 7 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 1 ms 512 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 1 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 7 ms 896 KB Output is correct
2 Correct 8 ms 912 KB Output is correct
3 Correct 9 ms 1004 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 8 ms 1024 KB Output is correct
6 Correct 1 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 7 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 8 ms 1024 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 8 ms 1024 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 10 ms 1024 KB Output is correct
20 Correct 8 ms 1024 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 13 ms 896 KB Output is correct
23 Correct 12 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 1 ms 512 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 7 ms 896 KB Output is correct
29 Correct 7 ms 896 KB Output is correct
30 Correct 1 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 67 ms 1664 KB Output is correct
2 Correct 78 ms 3960 KB Output is correct
3 Correct 63 ms 1536 KB Output is correct
4 Correct 53 ms 1792 KB Output is correct
5 Correct 47 ms 1792 KB Output is correct
6 Correct 44 ms 1536 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 10 ms 1024 KB Output is correct
10 Correct 8 ms 1024 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 896 KB Output is correct
13 Correct 12 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 8 ms 912 KB Output is correct
3 Correct 9 ms 1004 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 8 ms 1024 KB Output is correct
6 Correct 1 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 7 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 8 ms 1024 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 67 ms 1664 KB Output is correct
18 Correct 78 ms 3960 KB Output is correct
19 Correct 63 ms 1536 KB Output is correct
20 Correct 53 ms 1792 KB Output is correct
21 Correct 47 ms 1792 KB Output is correct
22 Correct 44 ms 1536 KB Output is correct
23 Correct 8 ms 1024 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 10 ms 1024 KB Output is correct
26 Correct 8 ms 1024 KB Output is correct
27 Correct 8 ms 1024 KB Output is correct
28 Correct 13 ms 896 KB Output is correct
29 Correct 12 ms 896 KB Output is correct
30 Correct 43 ms 1408 KB Output is correct
31 Correct 46 ms 1648 KB Output is correct
32 Correct 65 ms 2688 KB Output is correct
33 Correct 45 ms 1536 KB Output is correct
34 Correct 49 ms 1656 KB Output is correct
35 Correct 44 ms 1656 KB Output is correct
36 Correct 86 ms 4088 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 54 ms 1408 KB Output is correct
40 Correct 44 ms 1536 KB Output is correct
41 Correct 43 ms 1528 KB Output is correct
42 Correct 51 ms 1528 KB Output is correct
43 Correct 61 ms 1408 KB Output is correct
44 Correct 1 ms 512 KB Output is correct
45 Correct 9 ms 1024 KB Output is correct
46 Correct 9 ms 1024 KB Output is correct
47 Correct 10 ms 1124 KB Output is correct
48 Correct 84 ms 4424 KB Output is correct
49 Correct 86 ms 4216 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 76 ms 3172 KB Output is correct
52 Correct 44 ms 1280 KB Output is correct
53 Correct 46 ms 1280 KB Output is correct
54 Correct 7 ms 896 KB Output is correct
55 Correct 7 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 1 ms 512 KB Output is correct
59 Correct 7 ms 896 KB Output is correct
60 Correct 7 ms 896 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 8 ms 896 KB Output is correct