oj.uz

Submission #365643

# Submission time Handle Problem Language Result Execution time Memory
365643 2021-02-12T05:09:36 Z jainbot27 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 133 ms 4204 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 101;
const int mxK = 1001;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n, m, k;
pll cost[mxN][mxK];
ll dist[mxN][mxN];
ll profit[mxN][mxN];
ll dist2[mxN][mxN];

void go(ll arr[mxN][mxN]){
    F0R(i, n){
        F0R(j, n){
            F0R(q, n){
                ckmin(arr[j][q], arr[j][i]+arr[i][q]);
            }
        }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> k;
    F0R(i, n){
        F0R(j, k){
            cin >> cost[i][j].f >> cost[i][j].s;
        }
    }
    F0R(i, n){
        F0R(j, n) {
            dist[i][j] = infLL;
            //profit[i][j] = -1;
        }
    }
    F0R(i, m){
        int e1, e2; ll e3;
        cin >> e1 >> e2 >> e3;
        e1--; e2--; 
        ckmin(dist[e1][e2], e3);
    }
    go(dist);
    F0R(i, n){
        F0R(j, n){
            F0R(K, k){
                if(cost[j][K].s!=-1&&cost[i][K].f!=-1){
                    ckmax(profit[i][j], cost[j][K].s-cost[i][K].f);
                }
            }
        }
    }
    ll l = 1, r = 1e9;
    while(l <= r){
        ll mid = (l + r)/2;
        F0R(i, n) F0R(j, n){
            dist2[i][j]=mid*min(infLL/mid, dist[i][j])-profit[i][j];
        }
        go(dist2);
        bool g = 0;
        F0R(i, n) g |= dist2[i][i] <= 0;
        if(g) l = mid+1;
        else r = mid-1;
    }
    cout << r << nl;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 3436 KB Output is correct
2 Correct 34 ms 876 KB Output is correct
3 Correct 35 ms 876 KB Output is correct
4 Correct 6 ms 620 KB Output is correct
5 Correct 10 ms 620 KB Output is correct
6 Correct 6 ms 620 KB Output is correct
7 Correct 7 ms 748 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 6 ms 620 KB Output is correct
10 Correct 7 ms 620 KB Output is correct
11 Correct 6 ms 620 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 6 ms 748 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 748 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 14 ms 748 KB Output is correct
4 Correct 10 ms 824 KB Output is correct
5 Correct 9 ms 748 KB Output is correct
6 Correct 7 ms 748 KB Output is correct
7 Correct 8 ms 620 KB Output is correct
8 Correct 90 ms 1260 KB Output is correct
9 Correct 133 ms 4076 KB Output is correct
10 Correct 74 ms 1260 KB Output is correct
11 Correct 113 ms 1388 KB Output is correct
12 Correct 97 ms 1516 KB Output is correct
13 Correct 49 ms 1132 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 768 KB Output is correct
2 Correct 6 ms 620 KB Output is correct
3 Correct 6 ms 748 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 12 ms 748 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 6 ms 620 KB Output is correct
8 Correct 7 ms 748 KB Output is correct
9 Correct 6 ms 620 KB Output is correct
10 Correct 6 ms 748 KB Output is correct
11 Correct 9 ms 748 KB Output is correct
12 Correct 10 ms 748 KB Output is correct
13 Correct 6 ms 620 KB Output is correct
14 Correct 8 ms 748 KB Output is correct
15 Correct 9 ms 748 KB Output is correct
16 Correct 6 ms 620 KB Output is correct
17 Correct 90 ms 1260 KB Output is correct
18 Correct 133 ms 4076 KB Output is correct
19 Correct 74 ms 1260 KB Output is correct
20 Correct 113 ms 1388 KB Output is correct
21 Correct 97 ms 1516 KB Output is correct
22 Correct 49 ms 1132 KB Output is correct
23 Correct 14 ms 748 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 14 ms 748 KB Output is correct
26 Correct 10 ms 824 KB Output is correct
27 Correct 9 ms 748 KB Output is correct
28 Correct 7 ms 748 KB Output is correct
29 Correct 8 ms 620 KB Output is correct
30 Correct 71 ms 3436 KB Output is correct
31 Correct 34 ms 876 KB Output is correct
32 Correct 35 ms 876 KB Output is correct
33 Correct 6 ms 620 KB Output is correct
34 Correct 10 ms 620 KB Output is correct
35 Correct 6 ms 620 KB Output is correct
36 Correct 7 ms 748 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 6 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 6 ms 620 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 6 ms 748 KB Output is correct
43 Correct 42 ms 1076 KB Output is correct
44 Correct 41 ms 1260 KB Output is correct
45 Correct 58 ms 2700 KB Output is correct
46 Correct 49 ms 1260 KB Output is correct
47 Correct 39 ms 1260 KB Output is correct
48 Correct 39 ms 1260 KB Output is correct
49 Correct 103 ms 4076 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 37 ms 1004 KB Output is correct
53 Correct 37 ms 1132 KB Output is correct
54 Correct 49 ms 1004 KB Output is correct
55 Correct 47 ms 1024 KB Output is correct
56 Correct 36 ms 1004 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 12 ms 876 KB Output is correct
59 Correct 9 ms 876 KB Output is correct
60 Correct 9 ms 876 KB Output is correct
61 Correct 85 ms 4204 KB Output is correct
62 Correct 91 ms 4204 KB Output is correct
63 Correct 1 ms 364 KB Output is correct