oj.uz

Submission #233190

# Submission time Handle Problem Language Result Execution time Memory
233190 2020-05-19T20:41:15 Z AM1648 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 133 ms 4320 KB 
/* be name khoda */

#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>
using namespace std;

#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl

const ll MOD = 1000000007;
const ll INF = 2000000000;
const long long BIG = 1446803456761533460LL;

#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

// -----------------------------------------------------------------------

const ll maxn = 110;
const ll maxk = 1010;

ll n, m, k;
ll S[maxn][maxk], B[maxn][maxk];
ll dis[maxn][maxn], scr[maxn][maxn], d2[maxn][maxn];

bool check(ll p) {
    fori (i, n) {
        fori (j, n) {
            d2[i][j] = dis[i][j] * p - scr[i][j];
        }
    }
    fori (t, n) {
        fori (i, n) {
            fori (j, n) {
                smin(d2[i][j], max(-BIG, d2[i][t] + d2[t][j]));
            }
        }
    }
    fori (i, n) {
        fori (j, i) {
            if (d2[i][j] + d2[j][i] <= 0) return true;
        }
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    // ifstream cin("merchant.in");

    cin >> n >> m >> k;
    fori (i, n) {
        fori (j, k) cin >> B[i][j] >> S[i][j];
    }
    memset(dis, 20, sizeof dis);
    fori (i, n) dis[i][i] = 0;
    fori (i, m) {
        ll a, b, c; cin >> a >> b >> c; --a, --b;
        dis[a][b] = c;
    }
    fori (t, n) {
        fori (i, n) {
            fori (j, n) {
                smin(dis[i][j], min(INF, dis[i][t] + dis[t][j]));
            }
        }
    }
    fori (i, n) {
        fori (j, n) {
            fori (t, k) if (B[i][t] != -1 && S[j][t] != -1) smax(scr[i][j], S[j][t] - B[i][t]);
        }
    }
    ll l = 0, r = INF;
    while (r - l > 1) {
        ll mid = (l + r) / 2;
        if (check(mid)) l = mid;
        else r = mid;
    }
    cout << l << '\n';

}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 2176 KB Output is correct
2 Correct 53 ms 1408 KB Output is correct
3 Correct 55 ms 1280 KB Output is correct
4 Correct 11 ms 1024 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 11 ms 896 KB Output is correct
7 Correct 12 ms 896 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 13 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 13 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1536 KB Output is correct
2 Correct 123 ms 2168 KB Output is correct
3 Correct 65 ms 1536 KB Output is correct
4 Correct 61 ms 1536 KB Output is correct
5 Correct 70 ms 1536 KB Output is correct
6 Correct 57 ms 1536 KB Output is correct
7 Correct 12 ms 896 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 14 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 12 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1024 KB Output is correct
2 Correct 12 ms 896 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Correct 12 ms 1024 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 12 ms 896 KB Output is correct
8 Correct 12 ms 1024 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 12 ms 1024 KB Output is correct
11 Correct 14 ms 1024 KB Output is correct
12 Correct 13 ms 1024 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 12 ms 896 KB Output is correct
15 Correct 13 ms 1024 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 61 ms 1536 KB Output is correct
18 Correct 123 ms 2168 KB Output is correct
19 Correct 65 ms 1536 KB Output is correct
20 Correct 61 ms 1536 KB Output is correct
21 Correct 70 ms 1536 KB Output is correct
22 Correct 57 ms 1536 KB Output is correct
23 Correct 12 ms 896 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 14 ms 1024 KB Output is correct
26 Correct 13 ms 1024 KB Output is correct
27 Correct 12 ms 896 KB Output is correct
28 Correct 12 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 63 ms 1528 KB Output is correct
31 Correct 57 ms 1664 KB Output is correct
32 Correct 79 ms 2808 KB Output is correct
33 Correct 65 ms 1664 KB Output is correct
34 Correct 60 ms 1664 KB Output is correct
35 Correct 59 ms 1656 KB Output is correct
36 Correct 124 ms 4088 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 56 ms 1408 KB Output is correct
40 Correct 57 ms 1536 KB Output is correct
41 Correct 63 ms 1536 KB Output is correct
42 Correct 62 ms 1408 KB Output is correct
43 Correct 56 ms 1408 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 14 ms 1152 KB Output is correct
46 Correct 14 ms 1024 KB Output is correct
47 Correct 15 ms 1024 KB Output is correct
48 Correct 133 ms 4320 KB Output is correct
49 Correct 120 ms 4216 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 83 ms 2176 KB Output is correct
52 Correct 53 ms 1408 KB Output is correct
53 Correct 55 ms 1280 KB Output is correct
54 Correct 11 ms 1024 KB Output is correct
55 Correct 11 ms 896 KB Output is correct
56 Correct 11 ms 896 KB Output is correct
57 Correct 12 ms 896 KB Output is correct
58 Correct 4 ms 512 KB Output is correct
59 Correct 12 ms 896 KB Output is correct
60 Correct 13 ms 896 KB Output is correct
61 Correct 11 ms 896 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 13 ms 896 KB Output is correct