oj.uz

Submission #906422

# Submission time Handle Problem Language Result Execution time Memory
906422 2024-01-14T09:00:13 Z dimashhh Travelling Merchant (APIO17_merchant) C++17
100 / 100
 71 ms 13536 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 1, MOD = 1e9 + 7;
typedef long long ll;
#define int ll
int n,k,m;
ll cost[N][N],d[N][N],G[N][N],b[N][N],s[N][N];
bool check(ll mid){
    for(int i =1 ;i <= n;i++){
        for(int j = 1;j <= n;j++){
            if(d[i][j] == 1e18){
                G[i][j] = d[i][j];
            }else{
                G[i][j] = -(cost[i][j] - mid * d[i][j]);
            }
        }
    }
    for(int t = 1;t <= n;t++){
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <=n;j++){
                G[i][j] = min(G[i][j],G[i][t] + G[t][j]);
            }
        }
    }
    for(int i = 1;i <= n;i++){
        if(G[i][i] <= 0) return true;
    }
    return false;
}
void test(){
    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 <= k;j++){
            for(int f = 1;f <= n;f++){
                if(b[i][j] != -1 && s[f][j] != -1){
                    cost[i][f] = max(cost[i][f],s[f][j] - b[i][j]);
                }
                d[i][f] = 1e18;
            }
        }
    }
    for(int i = 1;i <= m;i++){
        int x,y,w;
        cin >> x >> y >> w;
        d[x][y] = w;
    }
    
    for(int t = 1;t <= n;t++){
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <=n;j++){
                d[i][j] = min(d[i][j],d[i][t] + d[t][j]);
            }
        }
    }
    // return;
    ll l = 0,r = 1e9;
    while(r - l > 1){
        ll mid = (l + r) >> 1;
        if(check(mid)){
            l = mid;
        }else{
            r = mid;
        }
    }
    cout << l;
}
main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        test();
}

Compilation message

merchant.cpp:72:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   72 | main()
      | ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 10840 KB Output is correct
2 Correct 34 ms 10588 KB Output is correct
3 Correct 33 ms 10804 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 6 ms 8540 KB Output is correct
6 Correct 5 ms 8776 KB Output is correct
7 Correct 6 ms 8796 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 6 ms 8540 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 6 ms 8764 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 6 ms 8796 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8776 KB Output is correct
2 Correct 6 ms 8796 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 6 ms 8540 KB Output is correct
6 Correct 6 ms 8764 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 6 ms 8796 KB Output is correct
9 Correct 6 ms 8792 KB Output is correct
10 Correct 6 ms 8796 KB Output is correct
11 Correct 6 ms 8796 KB Output is correct
12 Correct 5 ms 8920 KB Output is correct
13 Correct 6 ms 9040 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 6 ms 8792 KB Output is correct
16 Correct 6 ms 8796 KB Output is correct
17 Correct 6 ms 8840 KB Output is correct
18 Correct 6 ms 8796 KB Output is correct
19 Correct 6 ms 8796 KB Output is correct
20 Correct 7 ms 8796 KB Output is correct
21 Correct 6 ms 8796 KB Output is correct
22 Correct 6 ms 8932 KB Output is correct
23 Correct 7 ms 9052 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8796 KB Output is correct
26 Correct 2 ms 6488 KB Output is correct
27 Correct 6 ms 8796 KB Output is correct
28 Correct 7 ms 8996 KB Output is correct
29 Correct 7 ms 8792 KB Output is correct
30 Correct 6 ms 8796 KB Output is correct
31 Correct 5 ms 8796 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8796 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 6 ms 8796 KB Output is correct
4 Correct 7 ms 8996 KB Output is correct
5 Correct 7 ms 8792 KB Output is correct
6 Correct 6 ms 8796 KB Output is correct
7 Correct 5 ms 8796 KB Output is correct
8 Correct 37 ms 11276 KB Output is correct
9 Correct 57 ms 11252 KB Output is correct
10 Correct 34 ms 11100 KB Output is correct
11 Correct 36 ms 11100 KB Output is correct
12 Correct 37 ms 11100 KB Output is correct
13 Correct 34 ms 11288 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8792 KB Output is correct
2 Correct 6 ms 8796 KB Output is correct
3 Correct 6 ms 8796 KB Output is correct
4 Correct 5 ms 8920 KB Output is correct
5 Correct 6 ms 9040 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 6 ms 8792 KB Output is correct
8 Correct 6 ms 8796 KB Output is correct
9 Correct 6 ms 8840 KB Output is correct
10 Correct 6 ms 8796 KB Output is correct
11 Correct 6 ms 8796 KB Output is correct
12 Correct 7 ms 8796 KB Output is correct
13 Correct 6 ms 8796 KB Output is correct
14 Correct 6 ms 8932 KB Output is correct
15 Correct 7 ms 9052 KB Output is correct
16 Correct 6 ms 8796 KB Output is correct
17 Correct 37 ms 11276 KB Output is correct
18 Correct 57 ms 11252 KB Output is correct
19 Correct 34 ms 11100 KB Output is correct
20 Correct 36 ms 11100 KB Output is correct
21 Correct 37 ms 11100 KB Output is correct
22 Correct 34 ms 11288 KB Output is correct
23 Correct 6 ms 8796 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 6 ms 8796 KB Output is correct
26 Correct 7 ms 8996 KB Output is correct
27 Correct 7 ms 8792 KB Output is correct
28 Correct 6 ms 8796 KB Output is correct
29 Correct 5 ms 8796 KB Output is correct
30 Correct 56 ms 10840 KB Output is correct
31 Correct 34 ms 10588 KB Output is correct
32 Correct 33 ms 10804 KB Output is correct
33 Correct 6 ms 8540 KB Output is correct
34 Correct 6 ms 8540 KB Output is correct
35 Correct 5 ms 8776 KB Output is correct
36 Correct 6 ms 8796 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 6 ms 8540 KB Output is correct
39 Correct 6 ms 8540 KB Output is correct
40 Correct 6 ms 8764 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 6 ms 8796 KB Output is correct
43 Correct 41 ms 10844 KB Output is correct
44 Correct 45 ms 11356 KB Output is correct
45 Correct 50 ms 11612 KB Output is correct
46 Correct 36 ms 11096 KB Output is correct
47 Correct 35 ms 11100 KB Output is correct
48 Correct 40 ms 11332 KB Output is correct
49 Correct 63 ms 13136 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 1 ms 6488 KB Output is correct
52 Correct 34 ms 10840 KB Output is correct
53 Correct 35 ms 10840 KB Output is correct
54 Correct 35 ms 11096 KB Output is correct
55 Correct 34 ms 10840 KB Output is correct
56 Correct 33 ms 10840 KB Output is correct
57 Correct 2 ms 6488 KB Output is correct
58 Correct 7 ms 9052 KB Output is correct
59 Correct 7 ms 9044 KB Output is correct
60 Correct 7 ms 9052 KB Output is correct
61 Correct 71 ms 13416 KB Output is correct
62 Correct 67 ms 13536 KB Output is correct
63 Correct 2 ms 6488 KB Output is correct