답안 #974000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
974000	2024-05-02T14:45:34 Z	Amirreza_Fakhri	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	71 ms	4336 KB

merchant

// In the name of the God
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")

const int inf = (1e9+7)*(1e9+7);
const int mod = 998244353;
const int maxn = 1e2+5, maxk = 1e3+5;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, k, d1[maxn][maxn], d2[maxn][maxn], b[maxn][maxk], s[maxn][maxk], p[maxn][maxn];

void fw(int d[maxn][maxn]) {
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            for (int l = 0; l < n; l++) smin(d[j][l], d[j][i]+d[i][l]);
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) cin >> b[i][j] >> s[i][j];
        for (int j = 0; j < n; j++) d1[i][j] = inf;
    }
    for (int i = 0; i < m; i++) {
        int v, u, w; cin >> v >> u >> w;
        d1[--v][--u] = w;
    }
    fw(d1);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            for (int l = 0; l < k; l++)
                if (b[i][l] != -1 and s[j][l] != -1) smax(p[i][j], s[j][l]-b[i][l]);
    int l = 0, r = 1e9+10;
    while (r-l > 1) {
        int mid = (l+r)/2;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) d2[i][j] = mid*min(d1[i][j], inf/mid)-p[i][j];
        fw(d2);
        bool nc = 0;
        for (int i = 0; i < n; i++)
            if (d2[i][i] <= 0) nc = 1;
        if (nc) l = mid;
        else r = mid;
    }
    cout << l << '\n';
    return 0;
}







/*
srand(time(0));
cout << (rand()%1900) + 1 << ' ' << (rand()%2)+5 << '\n';
*/

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	45 ms	3460 KB	Output is correct
2	Correct	26 ms	1368 KB	Output is correct
3	Correct	27 ms	1372 KB	Output is correct
4	Correct	4 ms	856 KB	Output is correct
5	Correct	4 ms	856 KB	Output is correct
6	Correct	4 ms	860 KB	Output is correct
7	Correct	4 ms	988 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	4 ms	860 KB	Output is correct
10	Correct	4 ms	960 KB	Output is correct
11	Correct	4 ms	860 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	4 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	4 ms	988 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	860 KB	Output is correct
5	Correct	4 ms	960 KB	Output is correct
6	Correct	4 ms	860 KB	Output is correct
7	Correct	1 ms	344 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	980 KB	Output is correct
11	Correct	4 ms	860 KB	Output is correct
12	Correct	4 ms	1020 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	4 ms	916 KB	Output is correct
16	Correct	5 ms	860 KB	Output is correct
17	Correct	4 ms	1004 KB	Output is correct
18	Correct	4 ms	860 KB	Output is correct
19	Correct	4 ms	992 KB	Output is correct
20	Correct	4 ms	988 KB	Output is correct
21	Correct	4 ms	860 KB	Output is correct
22	Correct	4 ms	1212 KB	Output is correct
23	Correct	4 ms	860 KB	Output is correct
24	Correct	4 ms	860 KB	Output is correct
25	Correct	4 ms	860 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	6 ms	1076 KB	Output is correct
28	Correct	6 ms	856 KB	Output is correct
29	Correct	4 ms	860 KB	Output is correct
30	Correct	4 ms	1020 KB	Output is correct
31	Correct	4 ms	860 KB	Output is correct

Subtask #3
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	860 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	6 ms	1076 KB	Output is correct
4	Correct	6 ms	856 KB	Output is correct
5	Correct	4 ms	860 KB	Output is correct
6	Correct	4 ms	1020 KB	Output is correct
7	Correct	4 ms	860 KB	Output is correct
8	Correct	32 ms	1824 KB	Output is correct
9	Correct	60 ms	3936 KB	Output is correct
10	Correct	31 ms	1628 KB	Output is correct
11	Correct	31 ms	1692 KB	Output is correct
12	Correct	32 ms	1628 KB	Output is correct
13	Correct	27 ms	1628 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	860 KB	Output is correct
2	Correct	4 ms	980 KB	Output is correct
3	Correct	4 ms	860 KB	Output is correct
4	Correct	4 ms	1020 KB	Output is correct
5	Correct	4 ms	860 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	4 ms	916 KB	Output is correct
8	Correct	5 ms	860 KB	Output is correct
9	Correct	4 ms	1004 KB	Output is correct
10	Correct	4 ms	860 KB	Output is correct
11	Correct	4 ms	992 KB	Output is correct
12	Correct	4 ms	988 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct
14	Correct	4 ms	1212 KB	Output is correct
15	Correct	4 ms	860 KB	Output is correct
16	Correct	4 ms	860 KB	Output is correct
17	Correct	32 ms	1824 KB	Output is correct
18	Correct	60 ms	3936 KB	Output is correct
19	Correct	31 ms	1628 KB	Output is correct
20	Correct	31 ms	1692 KB	Output is correct
21	Correct	32 ms	1628 KB	Output is correct
22	Correct	27 ms	1628 KB	Output is correct
23	Correct	4 ms	860 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	6 ms	1076 KB	Output is correct
26	Correct	6 ms	856 KB	Output is correct
27	Correct	4 ms	860 KB	Output is correct
28	Correct	4 ms	1020 KB	Output is correct
29	Correct	4 ms	860 KB	Output is correct
30	Correct	45 ms	3460 KB	Output is correct
31	Correct	26 ms	1368 KB	Output is correct
32	Correct	27 ms	1372 KB	Output is correct
33	Correct	4 ms	856 KB	Output is correct
34	Correct	4 ms	856 KB	Output is correct
35	Correct	4 ms	860 KB	Output is correct
36	Correct	4 ms	988 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	4 ms	860 KB	Output is correct
39	Correct	4 ms	960 KB	Output is correct
40	Correct	4 ms	860 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	4 ms	860 KB	Output is correct
43	Correct	27 ms	1372 KB	Output is correct
44	Correct	31 ms	1624 KB	Output is correct
45	Correct	41 ms	2652 KB	Output is correct
46	Correct	29 ms	1624 KB	Output is correct
47	Correct	28 ms	1728 KB	Output is correct
48	Correct	29 ms	1628 KB	Output is correct
49	Correct	71 ms	4248 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	1 ms	468 KB	Output is correct
52	Correct	28 ms	1512 KB	Output is correct
53	Correct	29 ms	1372 KB	Output is correct
54	Correct	28 ms	1372 KB	Output is correct
55	Correct	27 ms	1368 KB	Output is correct
56	Correct	27 ms	1372 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	5 ms	1032 KB	Output is correct
59	Correct	5 ms	1116 KB	Output is correct
60	Correct	5 ms	1172 KB	Output is correct
61	Correct	54 ms	4336 KB	Output is correct
62	Correct	70 ms	4188 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct

답안 #974000

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