oj.uz

Submission #482628

# Submission time Handle Problem Language Result Execution time Memory
482628 2021-10-25T23:30:28 Z hidden1 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 663 ms 4252 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(ll i = 0; i < n; i ++)
#define revn(i, n) for(ll i = n - 1; i >= 0; i --)
typedef long long ll;
template<class T, template<class T2, class A=allocator<T2> > class cont> inline ostream &operator <<(ostream &out, const cont<T> &x) { for(const auto &it : x) { out << it << " ";} return out;}
template<class T, template<class T2, class A=allocator<T2> > class cont> inline istream &operator >>(istream &in, cont<T> &x) { for(auto &it : x) { in >> it;} return in;}
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e17 + 7;

const ll MAX_N = 110, MAX_K = 1010;
ll dist[MAX_N][MAX_N];
ll n, k, m;
ll buy[MAX_N][MAX_K], sell[MAX_N][MAX_K];
ll dist2[MAX_N][MAX_N];

void prec() {
    for(ll k = 0; k < n; k ++) {
        for(ll i = 0; i < n; i ++) {
            for(ll j = 0; j < n; j ++) {
                chkmin(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }        
    }
}

bool hasNegative(ll x) {
    for(ll i = 0; i < n; i ++) {
        for(ll j = 0; j < n; j ++) {
            ll best = 0;
            for(ll w = 0; w < k; w ++) {
                if(buy[i][w] != -1 && sell[j][w] != -1) {
                    chkmax(best, sell[j][w] - buy[i][w]);
                }
            }
            if(mod / x < dist[i][j]) {
                dist2[i][j] = mod;
            } else {
                dist2[i][j] = x * dist[i][j] - best;
            }
        }
    }

    for(ll k = 0; k < n; k ++) {
        for(ll i = 0; i < n; i ++) {
            for(ll j = 0; j < n; j ++) {
                chkmin(dist2[i][j], dist2[i][k] + dist2[k][j]);
            }
        }        
    }

    for(ll i = 0; i < n; i ++) {
        if(dist2[i][i] <= 0) {
            return true;
        }
    }

    return false;
}

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

    cin >> n >> m >> k;

    for(ll i = 0; i < n; i ++) {
        for(ll j = 0; j < n; j ++) {
            dist[i][j] = mod;
        }
    }

    for(ll i = 0; i < n; i ++) {
        for(ll j = 0; j < k; j ++) {
            cin >> buy[i][j] >> sell[i][j];
        }
    }

    for(ll i = 0; i < m; i ++) {
        ll a, b, c;
        cin >> a >> b >> c;
        chkmin(dist[a - 1][b - 1], c);
    }

    prec();

    ll l = 0, r = mod;
    while(l < r - 1) {
        ll mid = (l + r) / 2ll;
        if(!hasNegative(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }

    cout << l << endl;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 2068 KB Output is correct
2 Correct 64 ms 1228 KB Output is correct
3 Correct 66 ms 1276 KB Output is correct
4 Correct 11 ms 808 KB Output is correct
5 Correct 10 ms 804 KB Output is correct
6 Correct 10 ms 716 KB Output is correct
7 Correct 17 ms 844 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 10 ms 716 KB Output is correct
10 Correct 12 ms 820 KB Output is correct
11 Correct 11 ms 708 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 18 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 716 KB Output is correct
2 Correct 17 ms 844 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 10 ms 716 KB Output is correct
5 Correct 12 ms 820 KB Output is correct
6 Correct 11 ms 708 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 18 ms 844 KB Output is correct
9 Correct 14 ms 836 KB Output is correct
10 Correct 11 ms 816 KB Output is correct
11 Correct 18 ms 844 KB Output is correct
12 Correct 20 ms 860 KB Output is correct
13 Correct 26 ms 836 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 12 ms 716 KB Output is correct
16 Correct 22 ms 876 KB Output is correct
17 Correct 13 ms 716 KB Output is correct
18 Correct 16 ms 844 KB Output is correct
19 Correct 20 ms 908 KB Output is correct
20 Correct 20 ms 912 KB Output is correct
21 Correct 10 ms 788 KB Output is correct
22 Correct 14 ms 852 KB Output is correct
23 Correct 19 ms 928 KB Output is correct
24 Correct 11 ms 820 KB Output is correct
25 Correct 28 ms 844 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 29 ms 844 KB Output is correct
28 Correct 21 ms 844 KB Output is correct
29 Correct 21 ms 844 KB Output is correct
30 Correct 10 ms 716 KB Output is correct
31 Correct 12 ms 708 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 844 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 29 ms 844 KB Output is correct
4 Correct 21 ms 844 KB Output is correct
5 Correct 21 ms 844 KB Output is correct
6 Correct 10 ms 716 KB Output is correct
7 Correct 12 ms 708 KB Output is correct
8 Correct 208 ms 1444 KB Output is correct
9 Correct 660 ms 2116 KB Output is correct
10 Correct 136 ms 1356 KB Output is correct
11 Correct 170 ms 1440 KB Output is correct
12 Correct 208 ms 1356 KB Output is correct
13 Correct 115 ms 1456 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 836 KB Output is correct
2 Correct 11 ms 816 KB Output is correct
3 Correct 18 ms 844 KB Output is correct
4 Correct 20 ms 860 KB Output is correct
5 Correct 26 ms 836 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 12 ms 716 KB Output is correct
8 Correct 22 ms 876 KB Output is correct
9 Correct 13 ms 716 KB Output is correct
10 Correct 16 ms 844 KB Output is correct
11 Correct 20 ms 908 KB Output is correct
12 Correct 20 ms 912 KB Output is correct
13 Correct 10 ms 788 KB Output is correct
14 Correct 14 ms 852 KB Output is correct
15 Correct 19 ms 928 KB Output is correct
16 Correct 11 ms 820 KB Output is correct
17 Correct 208 ms 1444 KB Output is correct
18 Correct 660 ms 2116 KB Output is correct
19 Correct 136 ms 1356 KB Output is correct
20 Correct 170 ms 1440 KB Output is correct
21 Correct 208 ms 1356 KB Output is correct
22 Correct 115 ms 1456 KB Output is correct
23 Correct 28 ms 844 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 29 ms 844 KB Output is correct
26 Correct 21 ms 844 KB Output is correct
27 Correct 21 ms 844 KB Output is correct
28 Correct 10 ms 716 KB Output is correct
29 Correct 12 ms 708 KB Output is correct
30 Correct 461 ms 2068 KB Output is correct
31 Correct 64 ms 1228 KB Output is correct
32 Correct 66 ms 1276 KB Output is correct
33 Correct 11 ms 808 KB Output is correct
34 Correct 10 ms 804 KB Output is correct
35 Correct 10 ms 716 KB Output is correct
36 Correct 17 ms 844 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 10 ms 716 KB Output is correct
39 Correct 12 ms 820 KB Output is correct
40 Correct 11 ms 708 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 18 ms 844 KB Output is correct
43 Correct 81 ms 1328 KB Output is correct
44 Correct 128 ms 1524 KB Output is correct
45 Correct 506 ms 2628 KB Output is correct
46 Correct 121 ms 1484 KB Output is correct
47 Correct 124 ms 1484 KB Output is correct
48 Correct 122 ms 1484 KB Output is correct
49 Correct 663 ms 4012 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 324 KB Output is correct
52 Correct 71 ms 1228 KB Output is correct
53 Correct 81 ms 1428 KB Output is correct
54 Correct 97 ms 1356 KB Output is correct
55 Correct 84 ms 1356 KB Output is correct
56 Correct 78 ms 1308 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 28 ms 972 KB Output is correct
59 Correct 27 ms 1000 KB Output is correct
60 Correct 26 ms 972 KB Output is correct
61 Correct 656 ms 4252 KB Output is correct
62 Correct 649 ms 4116 KB Output is correct
63 Correct 0 ms 332 KB Output is correct