oj.uz

Submission #818052

# Submission time Handle Problem Language Result Execution time Memory
818052 2023-08-10T00:46:59 Z Ozy Travelling Merchant (APIO17_merchant) C++17
100 / 100
 71 ms 4148 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a <<  " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define pll pair<lli,lli> 

#define MAX 100
#define INF (1ll<<60)

lli n,m,k,res,a,b,c,prod;
lli dis[MAX+2][MAX+2],profit[MAX+2][MAX+2],otro[MAX+2][MAX+2];
lli compras[MAX+2][1002],ventas[MAX+2][1002];

void floyd_warshall(lli g[MAX+2][MAX+2]) {
    rep(i,1,n) 
        rep(j,1,n)
            rep(k,1,n) 
                g[j][k] = min(g[j][k], g[j][i]+g[i][k]);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m >> prod;
    rep(i,1,n) {
        rep(j,1,n) dis[i][j] = INF;
        rep(j,1,prod) cin >> compras[i][j] >> ventas[i][j];
    }
    rep(i,1,m) {
        cin >> a >> b >> c;
        dis[a][b] = c;
    }
    floyd_warshall(dis);  //si se pasa por referencia

    //defino el arreglo de profits con otro floyd_warshall

    rep(i,1,n)
        rep(j,1,n)
            rep(k,1,prod) {
                if(compras[i][k] == -1 || ventas[j][k] == -1) continue;
                profit[i][j] = max(profit[i][j], ventas[j][k] - compras[i][k]);
            }

    lli mitad,ini = 1;
    lli fin = (1ll<<30);
    while (ini <= fin) {
        mitad = (ini+fin)/2;
        rep(i,1,n) 
            rep(j,1,n) 
                otro[i][j] = mitad * min(dis[i][j], INF/mitad) - profit[i][j];

        floyd_warshall(otro);
        bool ciclo_neg = false;
        rep(i,1,n) if(otro[i][i] <= 0) ciclo_neg = true;
        if (ciclo_neg) {
            ini = mitad + 1;
            res = mitad;
        }
        else fin = mitad-1;
    }
    
    cout << res;

    return 0;
}
//checar lo de pasar el arreglo por referencia

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2432 KB Output is correct
2 Correct 26 ms 1300 KB Output is correct
3 Correct 27 ms 1236 KB Output is correct
4 Correct 4 ms 712 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 5 ms 716 KB Output is correct
11 Correct 4 ms 712 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 4 ms 880 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 4 ms 712 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 880 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 5 ms 856 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 4 ms 868 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 4 ms 848 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 4 ms 852 KB Output is correct
23 Correct 5 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 4 ms 852 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 4 ms 876 KB Output is correct
31 Correct 4 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 4 ms 876 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 29 ms 1620 KB Output is correct
9 Correct 50 ms 3804 KB Output is correct
10 Correct 27 ms 1492 KB Output is correct
11 Correct 34 ms 1744 KB Output is correct
12 Correct 29 ms 1728 KB Output is correct
13 Correct 28 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 4 ms 856 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 868 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 848 KB Output is correct
13 Correct 4 ms 852 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 29 ms 1620 KB Output is correct
18 Correct 50 ms 3804 KB Output is correct
19 Correct 27 ms 1492 KB Output is correct
20 Correct 34 ms 1744 KB Output is correct
21 Correct 29 ms 1728 KB Output is correct
22 Correct 28 ms 1492 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 4 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 4 ms 876 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 48 ms 2432 KB Output is correct
31 Correct 26 ms 1300 KB Output is correct
32 Correct 27 ms 1236 KB Output is correct
33 Correct 4 ms 712 KB Output is correct
34 Correct 4 ms 724 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 4 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 5 ms 716 KB Output is correct
40 Correct 4 ms 712 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 4 ms 880 KB Output is correct
43 Correct 29 ms 1408 KB Output is correct
44 Correct 28 ms 1492 KB Output is correct
45 Correct 40 ms 2508 KB Output is correct
46 Correct 28 ms 1604 KB Output is correct
47 Correct 28 ms 1492 KB Output is correct
48 Correct 28 ms 1592 KB Output is correct
49 Correct 68 ms 4072 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 27 ms 1364 KB Output is correct
53 Correct 28 ms 1364 KB Output is correct
54 Correct 31 ms 1476 KB Output is correct
55 Correct 27 ms 1364 KB Output is correct
56 Correct 27 ms 1236 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 5 ms 980 KB Output is correct
59 Correct 5 ms 1032 KB Output is correct
60 Correct 5 ms 1044 KB Output is correct
61 Correct 71 ms 4148 KB Output is correct
62 Correct 54 ms 4140 KB Output is correct
63 Correct 1 ms 340 KB Output is correct