답안 #492514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492514	2021-12-07T16:35:57 Z	Mahfel	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	99 ms	4344 KB

merchant

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 120 , MXM = 10000 , MXK = 1020 , Inf = 1e10;
ll n,m,k;
ll profit[MXN][MXN] , dis[MXN][MXN];
ll buy[MXN][MXK] , sell[MXN][MXK];
ll gr[MXN][MXN];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
 
    cin >> n >> m >> k;
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= k ; j++) {
            cin >> buy[i][j] >> sell[i][j];
            // if(buy[i][j] == -1) buy[i][j] = Inf;
            // if(sell[i][j] == -1) sell[i][j] = -Inf;
        }
    }
 
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            dis[i][j] = Inf;
        }
        dis[i][i] = 0;
    }
    for(int i = 0 ; i < m ; i++) {
        ll v,u,w; cin >> v >> u >> w;
        dis[v][u] = w;
    }
    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]);
            }
        }
    }
 
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            for(int x = 1 ; x <= k ; x++) {
                if(sell[j][x] != -1 && buy[i][x] != -1) profit[i][j] = max(profit[i][j] , sell[j][x] - buy[i][x]);
            }
        }
    }

    ll l = 0 , r = 1000000000 + 200;
    while(r-l > 1) {
        ll m = (l+r)/2;
        for(int i = 1 ; i <= n ; i++) {
            for(int j = 1 ; j <= n ; j++) {
                gr[i][j] = dis[i][j]*m - profit[i][j];
            }
            gr[i][i] = Inf;
        }
        for(int k = 1 ; k <= n ; k++) {
            for(int i = 1 ; i <= n ; i++) {
                for(int j = 1 ; j <= n ; j++) {
                    if(gr[i][k] < Inf) gr[i][j] = min(gr[i][j] , gr[i][k] + gr[k][j]);
                    // if(gr[i][k] + gr[k][j] < gr[i][j]-EPS) {
                    //     gr[i][j] = gr[i][k] + gr[k][j];
                    // }
                    // if(gr[i][j] < -Inf) gr[i][j] = -Inf;
                }
            }
        }
        bool ok = 0;
        for(int i = 1 ; i <= n ; i++) {
            if(gr[i][i] <= 0) {
                ok = 1; break;
            }
        }
        if(ok) {
            l = m;
        } else {
            r = m;
        }
    }
    
    cout << l << "\n";
    // printf("%.0lf\n" , l);
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	64 ms	1996 KB	Output is correct
2	Correct	36 ms	1228 KB	Output is correct
3	Correct	39 ms	1228 KB	Output is correct
4	Correct	6 ms	832 KB	Output is correct
5	Correct	6 ms	836 KB	Output is correct
6	Correct	6 ms	716 KB	Output is correct
7	Correct	7 ms	716 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	6 ms	832 KB	Output is correct
10	Correct	6 ms	716 KB	Output is correct
11	Correct	6 ms	836 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	8 ms	716 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	716 KB	Output is correct
2	Correct	7 ms	716 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	6 ms	832 KB	Output is correct
5	Correct	6 ms	716 KB	Output is correct
6	Correct	6 ms	836 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	8 ms	716 KB	Output is correct
9	Correct	7 ms	844 KB	Output is correct
10	Correct	6 ms	844 KB	Output is correct
11	Correct	7 ms	884 KB	Output is correct
12	Correct	6 ms	868 KB	Output is correct
13	Correct	8 ms	844 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	6 ms	844 KB	Output is correct
16	Correct	8 ms	900 KB	Output is correct
17	Correct	6 ms	844 KB	Output is correct
18	Correct	7 ms	844 KB	Output is correct
19	Correct	6 ms	844 KB	Output is correct
20	Correct	6 ms	848 KB	Output is correct
21	Correct	7 ms	844 KB	Output is correct
22	Correct	6 ms	900 KB	Output is correct
23	Correct	7 ms	844 KB	Output is correct
24	Correct	6 ms	844 KB	Output is correct
25	Correct	7 ms	844 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	7 ms	844 KB	Output is correct
28	Correct	6 ms	844 KB	Output is correct
29	Correct	8 ms	844 KB	Output is correct
30	Correct	7 ms	844 KB	Output is correct
31	Correct	6 ms	844 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	844 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	7 ms	844 KB	Output is correct
4	Correct	6 ms	844 KB	Output is correct
5	Correct	8 ms	844 KB	Output is correct
6	Correct	7 ms	844 KB	Output is correct
7	Correct	6 ms	844 KB	Output is correct
8	Correct	44 ms	1612 KB	Output is correct
9	Correct	87 ms	2092 KB	Output is correct
10	Correct	42 ms	1484 KB	Output is correct
11	Correct	45 ms	1612 KB	Output is correct
12	Correct	43 ms	1612 KB	Output is correct
13	Correct	46 ms	1436 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	844 KB	Output is correct
2	Correct	6 ms	844 KB	Output is correct
3	Correct	7 ms	884 KB	Output is correct
4	Correct	6 ms	868 KB	Output is correct
5	Correct	8 ms	844 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	6 ms	844 KB	Output is correct
8	Correct	8 ms	900 KB	Output is correct
9	Correct	6 ms	844 KB	Output is correct
10	Correct	7 ms	844 KB	Output is correct
11	Correct	6 ms	844 KB	Output is correct
12	Correct	6 ms	848 KB	Output is correct
13	Correct	7 ms	844 KB	Output is correct
14	Correct	6 ms	900 KB	Output is correct
15	Correct	7 ms	844 KB	Output is correct
16	Correct	6 ms	844 KB	Output is correct
17	Correct	44 ms	1612 KB	Output is correct
18	Correct	87 ms	2092 KB	Output is correct
19	Correct	42 ms	1484 KB	Output is correct
20	Correct	45 ms	1612 KB	Output is correct
21	Correct	43 ms	1612 KB	Output is correct
22	Correct	46 ms	1436 KB	Output is correct
23	Correct	7 ms	844 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	7 ms	844 KB	Output is correct
26	Correct	6 ms	844 KB	Output is correct
27	Correct	8 ms	844 KB	Output is correct
28	Correct	7 ms	844 KB	Output is correct
29	Correct	6 ms	844 KB	Output is correct
30	Correct	64 ms	1996 KB	Output is correct
31	Correct	36 ms	1228 KB	Output is correct
32	Correct	39 ms	1228 KB	Output is correct
33	Correct	6 ms	832 KB	Output is correct
34	Correct	6 ms	836 KB	Output is correct
35	Correct	6 ms	716 KB	Output is correct
36	Correct	7 ms	716 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	6 ms	832 KB	Output is correct
39	Correct	6 ms	716 KB	Output is correct
40	Correct	6 ms	836 KB	Output is correct
41	Correct	1 ms	384 KB	Output is correct
42	Correct	8 ms	716 KB	Output is correct
43	Correct	40 ms	1444 KB	Output is correct
44	Correct	45 ms	1656 KB	Output is correct
45	Correct	58 ms	2692 KB	Output is correct
46	Correct	42 ms	1612 KB	Output is correct
47	Correct	45 ms	1676 KB	Output is correct
48	Correct	43 ms	1672 KB	Output is correct
49	Correct	91 ms	4084 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	0 ms	332 KB	Output is correct
52	Correct	41 ms	1356 KB	Output is correct
53	Correct	40 ms	1484 KB	Output is correct
54	Correct	43 ms	1484 KB	Output is correct
55	Correct	41 ms	1356 KB	Output is correct
56	Correct	40 ms	1368 KB	Output is correct
57	Correct	1 ms	324 KB	Output is correct
58	Correct	9 ms	972 KB	Output is correct
59	Correct	8 ms	972 KB	Output is correct
60	Correct	8 ms	972 KB	Output is correct
61	Correct	95 ms	4256 KB	Output is correct
62	Correct	99 ms	4344 KB	Output is correct
63	Correct	0 ms	332 KB	Output is correct

답안 #492514

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