oj.uz

Submission #735241

# Submission time Handle Problem Language Result Execution time Memory
735241 2023-05-03T18:22:10 Z Ronin13 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 90 ms 5008 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;

const int nmax = 1001;

ll d[nmax][nmax];
ll g[nmax][nmax];
void floyd(int n){
    for(int k = 1; k <= n; k++){
        for(int j = 1; j <= n; j++){
            for(int i=  1; i <= n; ++i){
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int m; cin >> m;
    int k; cin >> k;
    ll b[n + 1][k + 1], s[n + 1][k + 1];
    for(int i= 1; i <= n; i++){
        for(int j= 1; j <= k; j++){
            cin >> b[i][j] >> s[i][j];
        }
    }
    ll opt[n + 1][n + 1];
    for(int i= 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            opt[i][j] = -1e18;
            d[i][j] = 1e18;
            if(j == i) continue;
            opt[i][j] = 0;
            for(int x = 1; x <= k; x++){
                if(s[j][x] == -1 || b[i][x] == -1) continue;
                opt[i][j] = max(opt[i][j], s[j][x] - b[i][x]);
            }

        }
    }
    for(int i = 1; i <= m; i++){
        int u, v, t; cin >> u >> v >> t;
        d[u][v] = t;
    }
    floyd(n);
    for(int i= 1; i <= n; i++){
        for(int j = 1; j <= n; j++)
            g[i][j] = d[i][j];
    }

    ll l = 0, r = 1e9;
    int last = 0;
    while(l + 1 < r){

        ll mid = (l+ r) / 2;
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++)
                d[i][j] = 1e18;
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
               // if(i == j) continue;
                d[i][j] = min(g[i][j], (ll)1e18 / mid) * mid - opt[i][j];
                d[i][j] = min(d[i][j], (ll)1e18);
              // d[i][i] = 0;
            }
        }

        floyd(n);

        bool good = false;
        for(int i = 1; i <= n; ++i)
            if(d[i][i] <= 0) good = true,last = i;
        if(good) l = mid;
        else r = mid;
    }
    cout << l;
    return 0;
}

Compilation message

merchant.cpp: In function 'int32_t main()':
merchant.cpp:62:9: warning: variable 'last' set but not used [-Wunused-but-set-variable]
   62 |     int last = 0;
      |         ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 3196 KB Output is correct
2 Correct 35 ms 1364 KB Output is correct
3 Correct 37 ms 1364 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 796 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 788 KB Output is correct
10 Correct 5 ms 800 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 5 ms 848 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 788 KB Output is correct
5 Correct 5 ms 800 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 708 KB Output is correct
11 Correct 6 ms 844 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 6 ms 880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 8 ms 728 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 6 ms 724 KB Output is correct
18 Correct 6 ms 724 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 848 KB Output is correct
21 Correct 5 ms 720 KB Output is correct
22 Correct 5 ms 832 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 804 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 7 ms 852 KB Output is correct
29 Correct 6 ms 808 KB Output is correct
30 Correct 5 ms 720 KB Output is correct
31 Correct 5 ms 792 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 764 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 6 ms 808 KB Output is correct
6 Correct 5 ms 720 KB Output is correct
7 Correct 5 ms 792 KB Output is correct
8 Correct 43 ms 1616 KB Output is correct
9 Correct 81 ms 3084 KB Output is correct
10 Correct 38 ms 1492 KB Output is correct
11 Correct 41 ms 1620 KB Output is correct
12 Correct 43 ms 1648 KB Output is correct
13 Correct 37 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 5 ms 708 KB Output is correct
3 Correct 6 ms 844 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 6 ms 880 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 8 ms 728 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 6 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 848 KB Output is correct
13 Correct 5 ms 720 KB Output is correct
14 Correct 5 ms 832 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 804 KB Output is correct
17 Correct 43 ms 1616 KB Output is correct
18 Correct 81 ms 3084 KB Output is correct
19 Correct 38 ms 1492 KB Output is correct
20 Correct 41 ms 1620 KB Output is correct
21 Correct 43 ms 1648 KB Output is correct
22 Correct 37 ms 1492 KB Output is correct
23 Correct 6 ms 764 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 7 ms 852 KB Output is correct
27 Correct 6 ms 808 KB Output is correct
28 Correct 5 ms 720 KB Output is correct
29 Correct 5 ms 792 KB Output is correct
30 Correct 63 ms 3196 KB Output is correct
31 Correct 35 ms 1364 KB Output is correct
32 Correct 37 ms 1364 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 796 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 788 KB Output is correct
39 Correct 5 ms 800 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 5 ms 848 KB Output is correct
43 Correct 39 ms 1364 KB Output is correct
44 Correct 38 ms 1612 KB Output is correct
45 Correct 53 ms 3108 KB Output is correct
46 Correct 38 ms 1492 KB Output is correct
47 Correct 37 ms 1492 KB Output is correct
48 Correct 37 ms 1492 KB Output is correct
49 Correct 88 ms 4884 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 35 ms 1364 KB Output is correct
53 Correct 38 ms 1416 KB Output is correct
54 Correct 36 ms 1460 KB Output is correct
55 Correct 42 ms 1364 KB Output is correct
56 Correct 36 ms 1364 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 7 ms 856 KB Output is correct
59 Correct 7 ms 852 KB Output is correct
60 Correct 6 ms 852 KB Output is correct
61 Correct 90 ms 5008 KB Output is correct
62 Correct 89 ms 4964 KB Output is correct
63 Correct 1 ms 340 KB Output is correct