Submission #936331

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936331	2024-03-01T15:51:13 Z	LOLOLO	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	72 ms	4204 KB

merchant

#include <bits/stdc++.h>
using namespace std;
typedef  long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 100 + 10;
ll dis[N][N], profit[N][N];
ll b[N][1000 + 10], s[N][1000 + 10], n;

ll bin(ll m) {
    vector < vector <ll>> dd(n + 1, vector <ll> (n + 1, -1e17));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dd[i][j] = profit[i][j] - dis[i][j] * m;
        }
    }

    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dd[i][j] = max(dd[i][j], dd[i][k] + dd[k][j]);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        if (dd[i][i] >= 0) {
            return 1;
        }
    }

    return 0;
}

ll solve() {
    int m, k;
    cin >> n >> m >> k;

    for (int i = 1; i <= n; i++) {
        fill(dis[i], dis[i] + n + 1, 1e9);
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> b[i][j] >> s[i][j];
        }
    }

    for (int i = 1; i <= m; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        dis[a][b] = min(dis[a][b], c);
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int f = 1; f <= k; f++) {
                if (s[j][f] == -1 || b[i][f] == -1)
                    continue;

                profit[i][j] = max(profit[i][j], s[j][f] - b[i][f]);
            }        
        }
    }

    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
            }
        }
    }

    ll l = 0, r = 1e9 + 100, ans = 0;
    while (l <= r) {
        ll m = (l + r) / 2;
        if (bin(m)) {
            ans = m;
            l = m + 1;
        } else {
            r = m - 1;
        }
    }

    return ans;
}

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

    int t = 1;
    //cin >> t;

    while (t--) {
        //solve();
        cout << solve() << '\n';
    }
}

/*
4   5   2
10 9   5   2
6  4   20  15
9  7   10  9
-1 -1  16  11
1  2   3
2  3   3
1  4   1
4  3   1
3  1   1
*/

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	64 ms	2196 KB	Output is correct
2	Correct	28 ms	1372 KB	Output is correct
3	Correct	27 ms	1624 KB	Output is correct
4	Correct	4 ms	860 KB	Output is correct
5	Correct	4 ms	936 KB	Output is correct
6	Correct	4 ms	860 KB	Output is correct
7	Correct	4 ms	860 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	4 ms	856 KB	Output is correct
10	Correct	6 ms	856 KB	Output is correct
11	Correct	6 ms	1016 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	860 KB	Output is correct
2	Correct	4 ms	860 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	4 ms	856 KB	Output is correct
5	Correct	6 ms	856 KB	Output is correct
6	Correct	6 ms	1016 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	4 ms	860 KB	Output is correct
9	Correct	4 ms	860 KB	Output is correct
10	Correct	4 ms	860 KB	Output is correct
11	Correct	5 ms	860 KB	Output is correct
12	Correct	4 ms	860 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	4 ms	860 KB	Output is correct
16	Correct	4 ms	860 KB	Output is correct
17	Correct	5 ms	856 KB	Output is correct
18	Correct	4 ms	860 KB	Output is correct
19	Correct	7 ms	1120 KB	Output is correct
20	Correct	5 ms	860 KB	Output is correct
21	Correct	4 ms	860 KB	Output is correct
22	Correct	4 ms	856 KB	Output is correct
23	Correct	6 ms	860 KB	Output is correct
24	Correct	4 ms	972 KB	Output is correct
25	Correct	4 ms	1040 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	6 ms	1076 KB	Output is correct
28	Correct	4 ms	1064 KB	Output is correct
29	Correct	6 ms	860 KB	Output is correct
30	Correct	4 ms	860 KB	Output is correct
31	Correct	6 ms	860 KB	Output is correct

Subtask #3
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1040 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	6 ms	1076 KB	Output is correct
4	Correct	4 ms	1064 KB	Output is correct
5	Correct	6 ms	860 KB	Output is correct
6	Correct	4 ms	860 KB	Output is correct
7	Correct	6 ms	860 KB	Output is correct
8	Correct	30 ms	1628 KB	Output is correct
9	Correct	65 ms	2136 KB	Output is correct
10	Correct	35 ms	1592 KB	Output is correct
11	Correct	32 ms	1628 KB	Output is correct
12	Correct	30 ms	1672 KB	Output is correct
13	Correct	29 ms	1660 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	860 KB	Output is correct
2	Correct	4 ms	860 KB	Output is correct
3	Correct	5 ms	860 KB	Output is correct
4	Correct	4 ms	860 KB	Output is correct
5	Correct	4 ms	860 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	4 ms	860 KB	Output is correct
8	Correct	4 ms	860 KB	Output is correct
9	Correct	5 ms	856 KB	Output is correct
10	Correct	4 ms	860 KB	Output is correct
11	Correct	7 ms	1120 KB	Output is correct
12	Correct	5 ms	860 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct
14	Correct	4 ms	856 KB	Output is correct
15	Correct	6 ms	860 KB	Output is correct
16	Correct	4 ms	972 KB	Output is correct
17	Correct	30 ms	1628 KB	Output is correct
18	Correct	65 ms	2136 KB	Output is correct
19	Correct	35 ms	1592 KB	Output is correct
20	Correct	32 ms	1628 KB	Output is correct
21	Correct	30 ms	1672 KB	Output is correct
22	Correct	29 ms	1660 KB	Output is correct
23	Correct	4 ms	1040 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	6 ms	1076 KB	Output is correct
26	Correct	4 ms	1064 KB	Output is correct
27	Correct	6 ms	860 KB	Output is correct
28	Correct	4 ms	860 KB	Output is correct
29	Correct	6 ms	860 KB	Output is correct
30	Correct	64 ms	2196 KB	Output is correct
31	Correct	28 ms	1372 KB	Output is correct
32	Correct	27 ms	1624 KB	Output is correct
33	Correct	4 ms	860 KB	Output is correct
34	Correct	4 ms	936 KB	Output is correct
35	Correct	4 ms	860 KB	Output is correct
36	Correct	4 ms	860 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	4 ms	856 KB	Output is correct
39	Correct	6 ms	856 KB	Output is correct
40	Correct	6 ms	1016 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	4 ms	860 KB	Output is correct
43	Correct	31 ms	1544 KB	Output is correct
44	Correct	30 ms	1624 KB	Output is correct
45	Correct	40 ms	2648 KB	Output is correct
46	Correct	29 ms	1628 KB	Output is correct
47	Correct	33 ms	1628 KB	Output is correct
48	Correct	33 ms	1624 KB	Output is correct
49	Correct	57 ms	4204 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	33 ms	1372 KB	Output is correct
53	Correct	29 ms	1628 KB	Output is correct
54	Correct	29 ms	1624 KB	Output is correct
55	Correct	28 ms	1372 KB	Output is correct
56	Correct	29 ms	1368 KB	Output is correct
57	Correct	0 ms	344 KB	Output is correct
58	Correct	5 ms	1116 KB	Output is correct
59	Correct	5 ms	1116 KB	Output is correct
60	Correct	5 ms	1112 KB	Output is correct
61	Correct	72 ms	4180 KB	Output is correct
62	Correct	54 ms	4188 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct

Submission #936331

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0