oj.uz

Submission #957991

# Submission time Handle Problem Language Result Execution time Memory
957991 2024-04-04T15:33:36 Z steveonalex Travelling Merchant (APIO17_merchant) C++17
100 / 100
 112 ms 4320 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 101, K = 1001;
const ll INF = 1e18 + 69;

int n, m, k;
pair<ll, ll> store[N][K];
ll graph[N][N], profit[N][N], ohio_dis[N][N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m >> k;
    for(int i= 1; i<=n; ++i){
        for(int j = 0; j<k; ++j) cin >> store[i][j].first >> store[i][j].second;
    }

    for(int i = 1; i<=n; ++i)
    for(int j = i + 1; j<=n; ++j) graph[i][j] = graph[j][i] = INF;

    for(int i = 0; i<m; ++i){
        int u, v, w; cin >> u >> v >> w;
        minimize(graph[u][v], w);
    }

    for(int k = 1; k<=n; ++k) for(int i = 1; i<=n; ++i) for(int j = 1; j<=n; ++j) minimize(graph[i][j], graph[i][k] + graph[k][j]);

    for(int i = 1; i<=n; ++i)
    for(int j = 1; j<=n; ++j) if (i != j){
        for(int t = 0; t < k; ++t) if (store[i][t].first != -1 && store[j][t].second != -1){
            maximize(profit[i][j], store[j][t].second - store[i][t].first);
        }
    }

    ll l = 0, r = 1e9;
    while(l < r){
        int mid = (l + r + 1) >> 1;
        for(int i = 1; i<=n; ++i) for(int j = 1; j<=n; ++j) ohio_dis[i][j] = INF;

        for(int i = 1; i<=n; ++i)
        for(int j = 1; j<=n; ++j) if (i != j) minimize(ohio_dis[i][j], min(graph[i][j], INF / mid) * mid - profit[i][j]);

        for(int k = 1; k<=n; ++k) for(int i = 1; i<=n; ++i) for(int j = 1; j<=n; ++j) 
            minimize(ohio_dis[i][j], max(ohio_dis[i][k] + ohio_dis[k][j], -INF));

        bool check = false;
        for(int i = 1; i<=n; ++i) if (ohio_dis[i][i] <= 0) check = true;
        if (check) l = mid;
        else r = mid - 1;
    }
    cout << l << "\n";

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2168 KB Output is correct
2 Correct 35 ms 856 KB Output is correct
3 Correct 36 ms 860 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 6 ms 756 KB Output is correct
7 Correct 7 ms 868 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 6 ms 684 KB Output is correct
11 Correct 6 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 6 ms 604 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 756 KB Output is correct
2 Correct 7 ms 868 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 6 ms 684 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 604 KB Output is correct
9 Correct 7 ms 604 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 736 KB Output is correct
12 Correct 6 ms 736 KB Output is correct
13 Correct 11 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 604 KB Output is correct
16 Correct 6 ms 860 KB Output is correct
17 Correct 6 ms 604 KB Output is correct
18 Correct 6 ms 604 KB Output is correct
19 Correct 8 ms 860 KB Output is correct
20 Correct 7 ms 864 KB Output is correct
21 Correct 6 ms 600 KB Output is correct
22 Correct 7 ms 604 KB Output is correct
23 Correct 8 ms 728 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 13 ms 836 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 13 ms 840 KB Output is correct
28 Correct 9 ms 604 KB Output is correct
29 Correct 8 ms 604 KB Output is correct
30 Correct 8 ms 604 KB Output is correct
31 Correct 7 ms 600 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 836 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 13 ms 840 KB Output is correct
4 Correct 9 ms 604 KB Output is correct
5 Correct 8 ms 604 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 86 ms 1240 KB Output is correct
9 Correct 112 ms 2248 KB Output is correct
10 Correct 67 ms 1116 KB Output is correct
11 Correct 94 ms 1240 KB Output is correct
12 Correct 85 ms 1112 KB Output is correct
13 Correct 55 ms 1116 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 6 ms 736 KB Output is correct
4 Correct 6 ms 736 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 6 ms 604 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 7 ms 864 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 7 ms 604 KB Output is correct
15 Correct 8 ms 728 KB Output is correct
16 Correct 6 ms 604 KB Output is correct
17 Correct 86 ms 1240 KB Output is correct
18 Correct 112 ms 2248 KB Output is correct
19 Correct 67 ms 1116 KB Output is correct
20 Correct 94 ms 1240 KB Output is correct
21 Correct 85 ms 1112 KB Output is correct
22 Correct 55 ms 1116 KB Output is correct
23 Correct 13 ms 836 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 13 ms 840 KB Output is correct
26 Correct 9 ms 604 KB Output is correct
27 Correct 8 ms 604 KB Output is correct
28 Correct 8 ms 604 KB Output is correct
29 Correct 7 ms 600 KB Output is correct
30 Correct 55 ms 2168 KB Output is correct
31 Correct 35 ms 856 KB Output is correct
32 Correct 36 ms 860 KB Output is correct
33 Correct 6 ms 600 KB Output is correct
34 Correct 6 ms 604 KB Output is correct
35 Correct 6 ms 756 KB Output is correct
36 Correct 7 ms 868 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 604 KB Output is correct
39 Correct 6 ms 684 KB Output is correct
40 Correct 6 ms 604 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 6 ms 604 KB Output is correct
43 Correct 43 ms 1112 KB Output is correct
44 Correct 44 ms 1116 KB Output is correct
45 Correct 65 ms 2884 KB Output is correct
46 Correct 38 ms 1328 KB Output is correct
47 Correct 48 ms 1116 KB Output is correct
48 Correct 38 ms 1116 KB Output is correct
49 Correct 93 ms 4144 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 464 KB Output is correct
52 Correct 38 ms 860 KB Output is correct
53 Correct 61 ms 1116 KB Output is correct
54 Correct 39 ms 1116 KB Output is correct
55 Correct 38 ms 1116 KB Output is correct
56 Correct 36 ms 1056 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 9 ms 872 KB Output is correct
59 Correct 8 ms 856 KB Output is correct
60 Correct 8 ms 872 KB Output is correct
61 Correct 74 ms 4320 KB Output is correct
62 Correct 86 ms 4288 KB Output is correct
63 Correct 0 ms 348 KB Output is correct