oj.uz

Submission #57854

# Submission time Handle Problem Language Result Execution time Memory
57854 2018-07-16T10:37:53 Z Jeez Travelling Merchant (APIO17_merchant) C++14
100 / 100
 379 ms 2684 KB 
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1e10;
const int MAX_N = 100 + 9;
const int MAX_K = 1000 + 9;
int n, m, K;
ll buy[MAX_N][MAX_K], sell[MAX_N][MAX_K];
ll w[MAX_N][MAX_N], dist[MAX_N][MAX_N], profit[MAX_N][MAX_N];
ll g[MAX_N][MAX_N], g2[MAX_N][MAX_N];
 
void read(){
    cin >> n >> m >> K;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= K; j++)
            cin >> buy[i][j] >> sell[i][j];
 
    for(int i = 0; i < m; i++){
        int u, v;
        ll w;
        cin >> u >> v >> w;
        dist[u][v] = w;
    }
}
 
void init(){
    for(int i = 1; i < MAX_N; i++){
        for(int j = 1; j < MAX_N; j++)
            dist[i][j] = INF;
        dist[i][i] = 0;
    }
}
 
void floyd(){
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
 
bool check(ll rat){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(dist[i][j] == INF)
                g[i][j] = -INF;
            else
                g[i][j] = profit[i][j] - dist[i][j] * rat;
            g[i][i] = -INF;
        }
    }
 
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++){
                g[i][j] = max(g[i][j], g[i][k] + g[k][j]);
                if(g[i][i] >= 0)
                    return true;
            }
 
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            g2[i][j] = g[i][j];
 
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++){
                g2[i][j] = max(g2[i][j], g2[i][k] + g2[k][j]);
                if(g2[i][j] > g[i][j])
                    return true;
            }
 
    return false;
}
 
void solve(){
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            for(int k = 1; k <= K; k++){
                if(sell[j][k] == -1 || buy[i][k] == -1) continue;
                profit[i][j] = max(profit[i][j], sell[j][k] - buy[i][k]);
            }
 
    ll lo = 1, hi = 1e9 + 1, mid, ans = 0;
    while(lo <= hi){
        mid = (lo + hi) / 2;
        if(check(mid)){
            ans = mid;
            lo = mid + 1;
        } else
            hi = mid - 1;
    }
 
    cout << ans << '\n';
}
 
int main()
{
    init();
    read();
    floyd();
    solve();
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 2168 KB Output is correct
2 Correct 109 ms 2168 KB Output is correct
3 Correct 67 ms 2168 KB Output is correct
4 Correct 18 ms 2168 KB Output is correct
5 Correct 14 ms 2168 KB Output is correct
6 Correct 16 ms 2168 KB Output is correct
7 Correct 16 ms 2168 KB Output is correct
8 Correct 3 ms 2168 KB Output is correct
9 Correct 12 ms 2168 KB Output is correct
10 Correct 13 ms 2168 KB Output is correct
11 Correct 13 ms 2168 KB Output is correct
12 Correct 3 ms 2168 KB Output is correct
13 Correct 18 ms 2168 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 2168 KB Output is correct
2 Correct 285 ms 2624 KB Output is correct
3 Correct 100 ms 2624 KB Output is correct
4 Correct 125 ms 2624 KB Output is correct
5 Correct 86 ms 2624 KB Output is correct
6 Correct 92 ms 2624 KB Output is correct
7 Correct 19 ms 2168 KB Output is correct
8 Correct 3 ms 2168 KB Output is correct
9 Correct 13 ms 2168 KB Output is correct
10 Correct 14 ms 2168 KB Output is correct
11 Correct 20 ms 2168 KB Output is correct
12 Correct 13 ms 2168 KB Output is correct
13 Correct 16 ms 2168 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2168 KB Output is correct
2 Correct 18 ms 2168 KB Output is correct
3 Correct 17 ms 2168 KB Output is correct
4 Correct 17 ms 2168 KB Output is correct
5 Correct 19 ms 2168 KB Output is correct
6 Correct 2 ms 2168 KB Output is correct
7 Correct 21 ms 2168 KB Output is correct
8 Correct 14 ms 2168 KB Output is correct
9 Correct 14 ms 2168 KB Output is correct
10 Correct 12 ms 2168 KB Output is correct
11 Correct 16 ms 2168 KB Output is correct
12 Correct 14 ms 2168 KB Output is correct
13 Correct 12 ms 2168 KB Output is correct
14 Correct 15 ms 2168 KB Output is correct
15 Correct 18 ms 2168 KB Output is correct
16 Correct 12 ms 2168 KB Output is correct
17 Correct 90 ms 2168 KB Output is correct
18 Correct 285 ms 2624 KB Output is correct
19 Correct 100 ms 2624 KB Output is correct
20 Correct 125 ms 2624 KB Output is correct
21 Correct 86 ms 2624 KB Output is correct
22 Correct 92 ms 2624 KB Output is correct
23 Correct 19 ms 2168 KB Output is correct
24 Correct 3 ms 2168 KB Output is correct
25 Correct 13 ms 2168 KB Output is correct
26 Correct 14 ms 2168 KB Output is correct
27 Correct 20 ms 2168 KB Output is correct
28 Correct 13 ms 2168 KB Output is correct
29 Correct 16 ms 2168 KB Output is correct
30 Correct 119 ms 2624 KB Output is correct
31 Correct 111 ms 2624 KB Output is correct
32 Correct 207 ms 2684 KB Output is correct
33 Correct 107 ms 2684 KB Output is correct
34 Correct 103 ms 2684 KB Output is correct
35 Correct 106 ms 2684 KB Output is correct
36 Correct 233 ms 2684 KB Output is correct
37 Correct 3 ms 2684 KB Output is correct
38 Correct 3 ms 2684 KB Output is correct
39 Correct 103 ms 2684 KB Output is correct
40 Correct 129 ms 2684 KB Output is correct
41 Correct 103 ms 2684 KB Output is correct
42 Correct 90 ms 2684 KB Output is correct
43 Correct 106 ms 2684 KB Output is correct
44 Correct 2 ms 2684 KB Output is correct
45 Correct 30 ms 2684 KB Output is correct
46 Correct 33 ms 2684 KB Output is correct
47 Correct 27 ms 2684 KB Output is correct
48 Correct 379 ms 2684 KB Output is correct
49 Correct 287 ms 2684 KB Output is correct
50 Correct 2 ms 2684 KB Output is correct
51 Correct 236 ms 2168 KB Output is correct
52 Correct 109 ms 2168 KB Output is correct
53 Correct 67 ms 2168 KB Output is correct
54 Correct 18 ms 2168 KB Output is correct
55 Correct 14 ms 2168 KB Output is correct
56 Correct 16 ms 2168 KB Output is correct
57 Correct 16 ms 2168 KB Output is correct
58 Correct 3 ms 2168 KB Output is correct
59 Correct 12 ms 2168 KB Output is correct
60 Correct 13 ms 2168 KB Output is correct
61 Correct 13 ms 2168 KB Output is correct
62 Correct 3 ms 2168 KB Output is correct
63 Correct 18 ms 2168 KB Output is correct