답안 #85084 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85084	2018-11-18T12:28:18 Z	popovicirobert	여행하는 상인 (APIO17_merchant)	C++14	100 / 100	115 ms	9848 KB

merchant

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long

using namespace std;

const ll INF = 1e18;
const int MAXN = 100;
const int MAXK = 1000;

int buy[MAXN + 1][MAXK + 1], sell[MAXN + 1][MAXK + 1];
ll dist[MAXN + 1][MAXN + 1], cst[MAXN + 1][MAXN + 1];
ll dp[MAXN + 1][MAXN + 1];

int n, m, k;

inline bool check(int delta) {
    int i, j;
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            if(dist[i][j] < INF) {
                dp[i][j] = cst[i][j] - 1LL * dist[i][j] * delta;
            }
            else {
                dp[i][j] = -INF;
            }
        }
    }
    for(int a = 1; a <= n; a++) {
        for(int b = 1; b <= n; b++) {
            for(int c = 1; c <= n; c++) {
                dp[b][c] = max(dp[b][c], dp[b][a] + dp[a][c]);
                dp[b][c] = min(dp[b][c], INF);
            }
        }
    }
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            if(i == j) {
                continue;
            }
            if(dp[i][j] + dp[j][i] >= 0) {
                return 1;
            }
        }
    }
    return 0;
}

int main() {
    //ifstream cin("C.in");
    //ofstream cout("C.out");
    int i, j;
    ios::sync_with_stdio(false);
    cin >> n >> m >> k;
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= k; j++) {
            cin >> buy[i][j] >> sell[i][j];
        }
    }
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            if(i == j) {
                dist[i][i] = 0;
                continue;
            }
            dist[i][j] = INF;
        }
    }
    for(i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        dist[u][v] = w;
    }
    for(int a = 1; a <= n; a++) {
        for(int b = 1; b <= n; b++) {
            for(int c = 1; c <= n; c++) {
                dist[b][c] = min(dist[b][c], dist[b][a] + dist[a][c]);
            }
        }
    }
    for(int a = 1; a <= n; a++) {
        for(int b = 1; b <= n; b++) {
            cst[a][b] = 0;
            for(i = 1; i <= k; i++) {
                if(buy[a][i] > -1 && sell[b][i] > -1) {
                    cst[a][b] = max(cst[a][b], 1LL * sell[b][i] - buy[a][i]);
                }
            }
        }
    }
    int delta = 0;
    for(int step = 1 << 29; step; step >>= 1) {
        if(check(delta + step)) {
            delta += step;
        }
    }
    cout << delta;
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	91 ms	1400 KB	Output is correct
2	Correct	55 ms	1524 KB	Output is correct
3	Correct	54 ms	1524 KB	Output is correct
4	Correct	9 ms	1524 KB	Output is correct
5	Correct	10 ms	1524 KB	Output is correct
6	Correct	10 ms	1524 KB	Output is correct
7	Correct	13 ms	1524 KB	Output is correct
8	Correct	2 ms	1524 KB	Output is correct
9	Correct	9 ms	1524 KB	Output is correct
10	Correct	9 ms	1524 KB	Output is correct
11	Correct	10 ms	1524 KB	Output is correct
12	Correct	2 ms	1524 KB	Output is correct
13	Correct	10 ms	1524 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	1524 KB	Output is correct
2	Correct	9 ms	1524 KB	Output is correct
3	Correct	10 ms	1524 KB	Output is correct
4	Correct	9 ms	1524 KB	Output is correct
5	Correct	11 ms	1524 KB	Output is correct
6	Correct	2 ms	1524 KB	Output is correct
7	Correct	10 ms	1528 KB	Output is correct
8	Correct	10 ms	1660 KB	Output is correct
9	Correct	10 ms	1660 KB	Output is correct
10	Correct	10 ms	1660 KB	Output is correct
11	Correct	10 ms	1660 KB	Output is correct
12	Correct	10 ms	1708 KB	Output is correct
13	Correct	10 ms	1796 KB	Output is correct
14	Correct	10 ms	1796 KB	Output is correct
15	Correct	11 ms	1896 KB	Output is correct
16	Correct	9 ms	1896 KB	Output is correct
17	Correct	10 ms	1896 KB	Output is correct
18	Correct	2 ms	1896 KB	Output is correct
19	Correct	10 ms	1896 KB	Output is correct
20	Correct	11 ms	1896 KB	Output is correct
21	Correct	12 ms	1896 KB	Output is correct
22	Correct	10 ms	2056 KB	Output is correct
23	Correct	14 ms	2056 KB	Output is correct
24	Correct	10 ms	1524 KB	Output is correct
25	Correct	13 ms	1524 KB	Output is correct
26	Correct	2 ms	1524 KB	Output is correct
27	Correct	9 ms	1524 KB	Output is correct
28	Correct	9 ms	1524 KB	Output is correct
29	Correct	10 ms	1524 KB	Output is correct
30	Correct	2 ms	1524 KB	Output is correct
31	Correct	10 ms	1524 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	61 ms	2468 KB	Output is correct
2	Correct	109 ms	2560 KB	Output is correct
3	Correct	57 ms	2560 KB	Output is correct
4	Correct	70 ms	2560 KB	Output is correct
5	Correct	63 ms	2588 KB	Output is correct
6	Correct	56 ms	2604 KB	Output is correct
7	Correct	10 ms	1896 KB	Output is correct
8	Correct	2 ms	1896 KB	Output is correct
9	Correct	10 ms	1896 KB	Output is correct
10	Correct	11 ms	1896 KB	Output is correct
11	Correct	12 ms	1896 KB	Output is correct
12	Correct	10 ms	2056 KB	Output is correct
13	Correct	14 ms	2056 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	1524 KB	Output is correct
2	Correct	9 ms	1524 KB	Output is correct
3	Correct	10 ms	1524 KB	Output is correct
4	Correct	9 ms	1524 KB	Output is correct
5	Correct	11 ms	1524 KB	Output is correct
6	Correct	2 ms	1524 KB	Output is correct
7	Correct	10 ms	1528 KB	Output is correct
8	Correct	10 ms	1660 KB	Output is correct
9	Correct	10 ms	1660 KB	Output is correct
10	Correct	10 ms	1660 KB	Output is correct
11	Correct	10 ms	1660 KB	Output is correct
12	Correct	10 ms	1708 KB	Output is correct
13	Correct	10 ms	1796 KB	Output is correct
14	Correct	10 ms	1796 KB	Output is correct
15	Correct	11 ms	1896 KB	Output is correct
16	Correct	9 ms	1896 KB	Output is correct
17	Correct	61 ms	2468 KB	Output is correct
18	Correct	109 ms	2560 KB	Output is correct
19	Correct	57 ms	2560 KB	Output is correct
20	Correct	70 ms	2560 KB	Output is correct
21	Correct	63 ms	2588 KB	Output is correct
22	Correct	56 ms	2604 KB	Output is correct
23	Correct	10 ms	1896 KB	Output is correct
24	Correct	2 ms	1896 KB	Output is correct
25	Correct	10 ms	1896 KB	Output is correct
26	Correct	11 ms	1896 KB	Output is correct
27	Correct	12 ms	1896 KB	Output is correct
28	Correct	10 ms	2056 KB	Output is correct
29	Correct	14 ms	2056 KB	Output is correct
30	Correct	54 ms	2604 KB	Output is correct
31	Correct	57 ms	2604 KB	Output is correct
32	Correct	74 ms	3152 KB	Output is correct
33	Correct	82 ms	3152 KB	Output is correct
34	Correct	56 ms	3232 KB	Output is correct
35	Correct	59 ms	3432 KB	Output is correct
36	Correct	114 ms	5224 KB	Output is correct
37	Correct	2 ms	5224 KB	Output is correct
38	Correct	2 ms	5224 KB	Output is correct
39	Correct	53 ms	5224 KB	Output is correct
40	Correct	61 ms	5364 KB	Output is correct
41	Correct	57 ms	5476 KB	Output is correct
42	Correct	54 ms	5476 KB	Output is correct
43	Correct	53 ms	5476 KB	Output is correct
44	Correct	2 ms	5476 KB	Output is correct
45	Correct	12 ms	5476 KB	Output is correct
46	Correct	11 ms	5476 KB	Output is correct
47	Correct	11 ms	5476 KB	Output is correct
48	Correct	115 ms	7784 KB	Output is correct
49	Correct	111 ms	9848 KB	Output is correct
50	Correct	2 ms	9848 KB	Output is correct
51	Correct	91 ms	1400 KB	Output is correct
52	Correct	55 ms	1524 KB	Output is correct
53	Correct	54 ms	1524 KB	Output is correct
54	Correct	9 ms	1524 KB	Output is correct
55	Correct	10 ms	1524 KB	Output is correct
56	Correct	10 ms	1524 KB	Output is correct
57	Correct	13 ms	1524 KB	Output is correct
58	Correct	2 ms	1524 KB	Output is correct
59	Correct	9 ms	1524 KB	Output is correct
60	Correct	9 ms	1524 KB	Output is correct
61	Correct	10 ms	1524 KB	Output is correct
62	Correct	2 ms	1524 KB	Output is correct
63	Correct	10 ms	1524 KB	Output is correct

답안 #85084

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