답안 #367989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367989	2021-02-19T07:28:32 Z	parsabahrami	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	219 ms	3564 KB

merchant

// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 110, M = 9905, K = 1e3 + 10;
int n, m, k, w[M], from[M], to[M], S[N][K], B[N][K]; ll dp[N][N], C[N][N];

void Fill() {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dp[i][j] = -1e18;
            if (i == j) dp[i][j] = 0;
        }
    }
}

int check(ll x) {
    Fill();
    for (int i = 1; i <= m; i++) {
        int u = from[i], v = to[i];
        dp[u][v] = max(dp[u][v], -w[i] * x);
    }
    for (int p = 1; p <= n; p++) 
        for (int i = 1; i <= n; i++) 
            for (int j = 1; j <= n; j++) dp[i][j] = min((ll) 1e18, max(dp[i][j], dp[i][p] + dp[p][j]));
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= n; j++) dp[i][j] += C[i][j];
    for (int p = 1; p <= n; p++) 
        for (int i = 1; i <= n; i++) 
            for (int j = 1; j <= n; j++) dp[i][j] = min((ll) 1e18, max(dp[i][j], dp[i][p] + dp[p][j]));
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= n; j++) 
            if (i != j && dp[i][j] + dp[j][i] >= 0) return 1;
    return 0;
}

int main() {
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) scanf("%d%d", &B[i][j], &S[i][j]);
    }
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d", &from[i], &to[i], &w[i]);
    }
    for (int u = 1; u <= n; u++) {
        for (int v = 1; v <= n; v++) {
            for (int i = 1; i <= k; i++) 
                if (~B[u][i] && ~S[v][i]) C[u][v] = max(C[u][v], (ll) S[v][i] - B[u][i]);
        }
    }
    ll l = 0, r = 1e9;
    while (r - l > 1) {
        ll mid = (l + r) >> 1;
        if (check(mid)) l = mid;
        else r = mid;
    }
    printf("%lld\n", l);
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:48:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |         for (int j = 1; j <= k; j++) scanf("%d%d", &B[i][j], &S[i][j]);
      |                                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |         scanf("%d%d%d", &from[i], &to[i], &w[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	110 ms	1260 KB	Output is correct
2	Correct	76 ms	1260 KB	Output is correct
3	Correct	85 ms	1260 KB	Output is correct
4	Correct	12 ms	748 KB	Output is correct
5	Correct	13 ms	748 KB	Output is correct
6	Correct	13 ms	748 KB	Output is correct
7	Correct	13 ms	748 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	12 ms	748 KB	Output is correct
10	Correct	13 ms	748 KB	Output is correct
11	Correct	13 ms	748 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	12 ms	748 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	21 ms	896 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	20 ms	876 KB	Output is correct
4	Correct	16 ms	876 KB	Output is correct
5	Correct	20 ms	876 KB	Output is correct
6	Correct	13 ms	876 KB	Output is correct
7	Correct	13 ms	876 KB	Output is correct
8	Correct	163 ms	1356 KB	Output is correct
9	Correct	219 ms	1388 KB	Output is correct
10	Correct	155 ms	1388 KB	Output is correct
11	Correct	149 ms	1644 KB	Output is correct
12	Correct	140 ms	1516 KB	Output is correct
13	Correct	103 ms	1516 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	876 KB	Output is correct
2	Correct	12 ms	748 KB	Output is correct
3	Correct	13 ms	876 KB	Output is correct
4	Correct	12 ms	748 KB	Output is correct
5	Correct	18 ms	876 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	12 ms	876 KB	Output is correct
8	Correct	13 ms	876 KB	Output is correct
9	Correct	12 ms	748 KB	Output is correct
10	Correct	13 ms	876 KB	Output is correct
11	Correct	15 ms	876 KB	Output is correct
12	Correct	15 ms	876 KB	Output is correct
13	Correct	13 ms	876 KB	Output is correct
14	Correct	14 ms	876 KB	Output is correct
15	Correct	19 ms	876 KB	Output is correct
16	Correct	12 ms	748 KB	Output is correct
17	Correct	163 ms	1356 KB	Output is correct
18	Correct	219 ms	1388 KB	Output is correct
19	Correct	155 ms	1388 KB	Output is correct
20	Correct	149 ms	1644 KB	Output is correct
21	Correct	140 ms	1516 KB	Output is correct
22	Correct	103 ms	1516 KB	Output is correct
23	Correct	21 ms	896 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	20 ms	876 KB	Output is correct
26	Correct	16 ms	876 KB	Output is correct
27	Correct	20 ms	876 KB	Output is correct
28	Correct	13 ms	876 KB	Output is correct
29	Correct	13 ms	876 KB	Output is correct
30	Correct	110 ms	1260 KB	Output is correct
31	Correct	76 ms	1260 KB	Output is correct
32	Correct	85 ms	1260 KB	Output is correct
33	Correct	12 ms	748 KB	Output is correct
34	Correct	13 ms	748 KB	Output is correct
35	Correct	13 ms	748 KB	Output is correct
36	Correct	13 ms	748 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	12 ms	748 KB	Output is correct
39	Correct	13 ms	748 KB	Output is correct
40	Correct	13 ms	748 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	12 ms	748 KB	Output is correct
43	Correct	84 ms	1260 KB	Output is correct
44	Correct	88 ms	1516 KB	Output is correct
45	Correct	103 ms	1772 KB	Output is correct
46	Correct	82 ms	1388 KB	Output is correct
47	Correct	92 ms	1388 KB	Output is correct
48	Correct	96 ms	1388 KB	Output is correct
49	Correct	191 ms	3308 KB	Output is correct
50	Correct	1 ms	364 KB	Output is correct
51	Correct	1 ms	364 KB	Output is correct
52	Correct	89 ms	1260 KB	Output is correct
53	Correct	82 ms	1516 KB	Output is correct
54	Correct	85 ms	1388 KB	Output is correct
55	Correct	84 ms	1260 KB	Output is correct
56	Correct	89 ms	1260 KB	Output is correct
57	Correct	1 ms	364 KB	Output is correct
58	Correct	16 ms	876 KB	Output is correct
59	Correct	16 ms	876 KB	Output is correct
60	Correct	15 ms	1004 KB	Output is correct
61	Correct	181 ms	3564 KB	Output is correct
62	Correct	177 ms	3436 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct

답안 #367989

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