답안 #491864

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491864	2021-12-04T20:50:05 Z	K4YAN	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	88 ms	4480 KB

merchant

//Be Name Khoda

#include<bits/stdc++.h>
#pragma GCC target ("avx2,tune=native")

using namespace std;

#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define piii pair<pii, int>
#define piiii pair<pii, pii>
#define piiiii pair<pii, piii>
#define pll pair<ll, ll>
#define plll pair<pll, ll>

const ll mxn = 116, MXN = 1016;
ll n, m, k, q;
ll dis[mxn][mxn], f[mxn][mxn], b[mxn][MXN], s[mxn][MXN];
vector<pll> adj[mxn];

bool check(ll x) {

    ll d[mxn][mxn];
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            d[i][j] = -1LL * MXN * MXN * MXN;
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            d[i][j] = f[i][j] + -1LL * x * dis[i][j];
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            for(int w = 1; w <= n; w++) {
                d[j][w] = max(d[j][w], d[j][i] + d[i][w]);
            }
        }
    } 
    for(int i = 1; i <= n; i++) {
        if(d[i][i] > 0) {
            return 1;
        }
        if(d[i][i] < 0) continue;
        for(int j = 1; j <= n; j++) {
            if(d[i][j] + d[j][i] == d[i][i] && i != j) {
                return 1;
            }
        }
    }
    return 0;
 
}

ll bs(ll l, ll r) {
    if(r - l == 1) return l;
    ll mid = (l + r) >> 1;
    if(check(mid)) {
        return bs(mid, r);
    }
    return bs(l, mid);
}

void input() {

    for(int i = 0; i < mxn; i++) {
        for(int j = 0; j < mxn; j++) {
            dis[i][j] = 1LL * MXN * MXN * MXN;
        }
        dis[i][i] = 0;
    }

    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < k; j++) {
            cin >> b[i][j] >> s[i][j];
        }
    }
    for(int i = 0; i < m; i++) {
        ll v, u;
        cin >> v >> u >> q;
        adj[v].push_back({u, q});
        dis[v][u] = min(dis[v][u], q);
    }

}

void solve() {

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            for(int w = 1; w <= n; w++) {
                dis[j][w] = min(dis[j][w], dis[j][i] + dis[i][w]);
            }
            for(int w = 0; w < k; w++) {
                if(b[i][w] != -1 && s[j][w] != -1) {
                    f[i][j] = max(f[i][j], s[j][w] - b[i][w]);
                }
            }
        }
    }

    cout << bs(0LL, 1LL* MXN * MXN * MXN) << endl;

}

int main() {

    ios::sync_with_stdio(false); cin.tie(NULL);

    input(), solve();

    return 0;

}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	3276 KB	Output is correct
2	Correct	32 ms	1228 KB	Output is correct
3	Correct	33 ms	1344 KB	Output is correct
4	Correct	5 ms	844 KB	Output is correct
5	Correct	5 ms	844 KB	Output is correct
6	Correct	5 ms	844 KB	Output is correct
7	Correct	6 ms	972 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	7 ms	816 KB	Output is correct
10	Correct	5 ms	844 KB	Output is correct
11	Correct	5 ms	844 KB	Output is correct
12	Correct	1 ms	556 KB	Output is correct
13	Correct	6 ms	972 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	844 KB	Output is correct
2	Correct	6 ms	972 KB	Output is correct
3	Correct	0 ms	460 KB	Output is correct
4	Correct	7 ms	816 KB	Output is correct
5	Correct	5 ms	844 KB	Output is correct
6	Correct	5 ms	844 KB	Output is correct
7	Correct	1 ms	556 KB	Output is correct
8	Correct	6 ms	972 KB	Output is correct
9	Correct	5 ms	1004 KB	Output is correct
10	Correct	5 ms	972 KB	Output is correct
11	Correct	6 ms	972 KB	Output is correct
12	Correct	6 ms	972 KB	Output is correct
13	Correct	8 ms	972 KB	Output is correct
14	Correct	1 ms	460 KB	Output is correct
15	Correct	6 ms	972 KB	Output is correct
16	Correct	7 ms	1048 KB	Output is correct
17	Correct	5 ms	972 KB	Output is correct
18	Correct	5 ms	956 KB	Output is correct
19	Correct	6 ms	972 KB	Output is correct
20	Correct	7 ms	1084 KB	Output is correct
21	Correct	9 ms	972 KB	Output is correct
22	Correct	6 ms	972 KB	Output is correct
23	Correct	7 ms	1100 KB	Output is correct
24	Correct	5 ms	972 KB	Output is correct
25	Correct	6 ms	972 KB	Output is correct
26	Correct	1 ms	560 KB	Output is correct
27	Correct	7 ms	1084 KB	Output is correct
28	Correct	7 ms	1084 KB	Output is correct
29	Correct	7 ms	972 KB	Output is correct
30	Correct	5 ms	972 KB	Output is correct
31	Correct	5 ms	972 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	972 KB	Output is correct
2	Correct	1 ms	560 KB	Output is correct
3	Correct	7 ms	1084 KB	Output is correct
4	Correct	7 ms	1084 KB	Output is correct
5	Correct	7 ms	972 KB	Output is correct
6	Correct	5 ms	972 KB	Output is correct
7	Correct	5 ms	972 KB	Output is correct
8	Correct	38 ms	1740 KB	Output is correct
9	Correct	88 ms	4092 KB	Output is correct
10	Correct	36 ms	1612 KB	Output is correct
11	Correct	38 ms	1740 KB	Output is correct
12	Correct	38 ms	1820 KB	Output is correct
13	Correct	35 ms	1592 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	1004 KB	Output is correct
2	Correct	5 ms	972 KB	Output is correct
3	Correct	6 ms	972 KB	Output is correct
4	Correct	6 ms	972 KB	Output is correct
5	Correct	8 ms	972 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	6 ms	972 KB	Output is correct
8	Correct	7 ms	1048 KB	Output is correct
9	Correct	5 ms	972 KB	Output is correct
10	Correct	5 ms	956 KB	Output is correct
11	Correct	6 ms	972 KB	Output is correct
12	Correct	7 ms	1084 KB	Output is correct
13	Correct	9 ms	972 KB	Output is correct
14	Correct	6 ms	972 KB	Output is correct
15	Correct	7 ms	1100 KB	Output is correct
16	Correct	5 ms	972 KB	Output is correct
17	Correct	38 ms	1740 KB	Output is correct
18	Correct	88 ms	4092 KB	Output is correct
19	Correct	36 ms	1612 KB	Output is correct
20	Correct	38 ms	1740 KB	Output is correct
21	Correct	38 ms	1820 KB	Output is correct
22	Correct	35 ms	1592 KB	Output is correct
23	Correct	6 ms	972 KB	Output is correct
24	Correct	1 ms	560 KB	Output is correct
25	Correct	7 ms	1084 KB	Output is correct
26	Correct	7 ms	1084 KB	Output is correct
27	Correct	7 ms	972 KB	Output is correct
28	Correct	5 ms	972 KB	Output is correct
29	Correct	5 ms	972 KB	Output is correct
30	Correct	55 ms	3276 KB	Output is correct
31	Correct	32 ms	1228 KB	Output is correct
32	Correct	33 ms	1344 KB	Output is correct
33	Correct	5 ms	844 KB	Output is correct
34	Correct	5 ms	844 KB	Output is correct
35	Correct	5 ms	844 KB	Output is correct
36	Correct	6 ms	972 KB	Output is correct
37	Correct	0 ms	460 KB	Output is correct
38	Correct	7 ms	816 KB	Output is correct
39	Correct	5 ms	844 KB	Output is correct
40	Correct	5 ms	844 KB	Output is correct
41	Correct	1 ms	556 KB	Output is correct
42	Correct	6 ms	972 KB	Output is correct
43	Correct	42 ms	1464 KB	Output is correct
44	Correct	37 ms	1636 KB	Output is correct
45	Correct	49 ms	2696 KB	Output is correct
46	Correct	38 ms	1612 KB	Output is correct
47	Correct	35 ms	1724 KB	Output is correct
48	Correct	35 ms	1740 KB	Output is correct
49	Correct	84 ms	4148 KB	Output is correct
50	Correct	1 ms	588 KB	Output is correct
51	Correct	0 ms	588 KB	Output is correct
52	Correct	33 ms	1356 KB	Output is correct
53	Correct	35 ms	1740 KB	Output is correct
54	Correct	34 ms	1520 KB	Output is correct
55	Correct	36 ms	1484 KB	Output is correct
56	Correct	35 ms	1432 KB	Output is correct
57	Correct	1 ms	460 KB	Output is correct
58	Correct	7 ms	1100 KB	Output is correct
59	Correct	8 ms	1084 KB	Output is correct
60	Correct	9 ms	1084 KB	Output is correct
61	Correct	87 ms	4480 KB	Output is correct
62	Correct	86 ms	4388 KB	Output is correct
63	Correct	1 ms	460 KB	Output is correct

답안 #491864

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