답안 #890735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890735	2023-12-21T20:23:40 Z	Dec0Dedd	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	112 ms	4180 KB

merchant

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 110;
const int K = 1e3+10;
const ll INF = 1e18;

ll b[N][K], s[N][K], w[N][N], mxv[N][N], g2[N][N], n, m, k;

void floyd(ll g[N][N]) {
    for (int k=1; k<=n; ++k) {
        for (int i=1; i<=n; ++i) {
            for (int j=1; j<=n; ++j) g[i][j]=min(g[i][j], g[i][k]+g[k][j]);
        }
    }
}

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

    for (int i=1; i<=m; ++i) {
        ll a, b, x; cin>>a>>b>>x;
        w[a][b]=x;
    } floyd(w);

    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            for (int x=1; x<=k; ++x) {
                if (b[i][x] == -1 || s[j][x] == -1) continue;
                mxv[i][j]=max(mxv[i][j], s[j][x]-b[i][x]);
            }
        }
    }

    ll ans=0, l=1, r=1e9+10;
    while (l <= r) {
        ll md=(l+r)/2;

        for (int i=1; i<=n; ++i) {
            for (int j=1; j<=n; ++j) {
                g2[i][j]=-mxv[i][j]+md*min(w[i][j], INF/md);
            }
        } floyd(g2);

        bool ok=false;
        for (int i=1; i<=n; ++i) {
            if (g2[i][i] <= 0) ok=true;
        }

        if (ok) ans=md, l=md+1;
        else r=md-1;
    } cout<<ans<<"\n";
}

int main() {
    int t=1;
    while (t--) solve();
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	71 ms	3412 KB	Output is correct
2	Correct	26 ms	1372 KB	Output is correct
3	Correct	26 ms	1428 KB	Output is correct
4	Correct	4 ms	940 KB	Output is correct
5	Correct	4 ms	856 KB	Output is correct
6	Correct	4 ms	860 KB	Output is correct
7	Correct	5 ms	964 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	700 KB	Output is correct
10	Correct	5 ms	860 KB	Output is correct
11	Correct	6 ms	1016 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	6 ms	860 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	860 KB	Output is correct
2	Correct	5 ms	964 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	5 ms	700 KB	Output is correct
5	Correct	5 ms	860 KB	Output is correct
6	Correct	6 ms	1016 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	6 ms	860 KB	Output is correct
9	Correct	4 ms	856 KB	Output is correct
10	Correct	4 ms	860 KB	Output is correct
11	Correct	6 ms	860 KB	Output is correct
12	Correct	4 ms	860 KB	Output is correct
13	Correct	5 ms	860 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	4 ms	960 KB	Output is correct
16	Correct	4 ms	860 KB	Output is correct
17	Correct	4 ms	860 KB	Output is correct
18	Correct	4 ms	860 KB	Output is correct
19	Correct	5 ms	860 KB	Output is correct
20	Correct	5 ms	1000 KB	Output is correct
21	Correct	5 ms	856 KB	Output is correct
22	Correct	4 ms	860 KB	Output is correct
23	Correct	6 ms	860 KB	Output is correct
24	Correct	4 ms	860 KB	Output is correct
25	Correct	5 ms	1060 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	5 ms	860 KB	Output is correct
28	Correct	7 ms	860 KB	Output is correct
29	Correct	5 ms	856 KB	Output is correct
30	Correct	5 ms	856 KB	Output is correct
31	Correct	4 ms	860 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	1060 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	5 ms	860 KB	Output is correct
4	Correct	7 ms	860 KB	Output is correct
5	Correct	5 ms	856 KB	Output is correct
6	Correct	5 ms	856 KB	Output is correct
7	Correct	4 ms	860 KB	Output is correct
8	Correct	35 ms	1884 KB	Output is correct
9	Correct	101 ms	3924 KB	Output is correct
10	Correct	29 ms	1624 KB	Output is correct
11	Correct	35 ms	1884 KB	Output is correct
12	Correct	33 ms	1880 KB	Output is correct
13	Correct	29 ms	1628 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	856 KB	Output is correct
2	Correct	4 ms	860 KB	Output is correct
3	Correct	6 ms	860 KB	Output is correct
4	Correct	4 ms	860 KB	Output is correct
5	Correct	5 ms	860 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	4 ms	960 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	5 ms	1000 KB	Output is correct
13	Correct	5 ms	856 KB	Output is correct
14	Correct	4 ms	860 KB	Output is correct
15	Correct	6 ms	860 KB	Output is correct
16	Correct	4 ms	860 KB	Output is correct
17	Correct	35 ms	1884 KB	Output is correct
18	Correct	101 ms	3924 KB	Output is correct
19	Correct	29 ms	1624 KB	Output is correct
20	Correct	35 ms	1884 KB	Output is correct
21	Correct	33 ms	1880 KB	Output is correct
22	Correct	29 ms	1628 KB	Output is correct
23	Correct	5 ms	1060 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	5 ms	860 KB	Output is correct
26	Correct	7 ms	860 KB	Output is correct
27	Correct	5 ms	856 KB	Output is correct
28	Correct	5 ms	856 KB	Output is correct
29	Correct	4 ms	860 KB	Output is correct
30	Correct	71 ms	3412 KB	Output is correct
31	Correct	26 ms	1372 KB	Output is correct
32	Correct	26 ms	1428 KB	Output is correct
33	Correct	4 ms	940 KB	Output is correct
34	Correct	4 ms	856 KB	Output is correct
35	Correct	4 ms	860 KB	Output is correct
36	Correct	5 ms	964 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	5 ms	700 KB	Output is correct
39	Correct	5 ms	860 KB	Output is correct
40	Correct	6 ms	1016 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	6 ms	860 KB	Output is correct
43	Correct	27 ms	1372 KB	Output is correct
44	Correct	31 ms	1504 KB	Output is correct
45	Correct	53 ms	2536 KB	Output is correct
46	Correct	30 ms	1624 KB	Output is correct
47	Correct	30 ms	1624 KB	Output is correct
48	Correct	38 ms	1628 KB	Output is correct
49	Correct	105 ms	4112 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	27 ms	1372 KB	Output is correct
53	Correct	31 ms	1592 KB	Output is correct
54	Correct	34 ms	1372 KB	Output is correct
55	Correct	28 ms	1368 KB	Output is correct
56	Correct	31 ms	1468 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	9 ms	1156 KB	Output is correct
59	Correct	7 ms	1116 KB	Output is correct
60	Correct	7 ms	1116 KB	Output is correct
61	Correct	94 ms	4180 KB	Output is correct
62	Correct	112 ms	4180 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct

답안 #890735

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