oj.uz

답안 #891090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891090 2023-12-22T07:29:18 Z 12345678 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 76 ms 4360 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=105, kx=1005;
ll n, m, k, dp[nx][nx], p[nx][nx], b[nx][kx], s[nx][kx], ds[nx][nx], u, v, w, l=0, r=1e9;

bool check(ll x)
{
    for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) dp[i][j]=(ds[i][j]>1e9)?-1e18:p[i][j]-x*ds[i][j];
    for (int i=1; i<=n; i++) dp[i][i]=-1e18;
    for (int m=1; m<=n; m++) for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) dp[i][j]=max(dp[i][j], dp[i][m]+dp[m][j]);
    for (int i=1; i<=n; i++) if (dp[i][i]>=0) return 1;
    return 0;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    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 i=1; i<=n; i++) for (int j=1; j<=n; j++) ds[i][j]=1e15;
    for (int i=1; i<=n; i++) ds[i][i]=0;
    for (int i=1; i<=m; i++)
    {
        cin>>u>>v>>w;
        ds[u][v]=w;
    }
    for (int m=1; m<=n; m++) for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) ds[i][j]=min(ds[i][j], ds[i][m]+ds[m][j]);
    for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) for (int g=1; g<=k; g++) if (s[j][g]!=-1&&b[i][g]!=-1&&i!=j) p[i][j]=max(p[i][j], s[j][g]-b[i][g]);
    while (l<r)
    {
        ll md=(l+r+1)/2;
        if (check(md)) l=md;
        else r=md-1;
    }
    cout<<l;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 2136 KB Output is correct
2 Correct 28 ms 1368 KB Output is correct
3 Correct 29 ms 1368 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 4 ms 856 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 960 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 5 ms 960 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 992 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 856 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 960 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 5 ms 960 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 992 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 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 4 ms 1116 KB Output is correct
21 Correct 5 ms 1000 KB Output is correct
22 Correct 4 ms 860 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 0 ms 348 KB Output is correct
27 Correct 5 ms 1264 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 5 ms 1032 KB Output is correct
30 Correct 4 ms 856 KB Output is correct
31 Correct 5 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 0 ms 348 KB Output is correct
3 Correct 5 ms 1264 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 5 ms 1032 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 32 ms 1628 KB Output is correct
9 Correct 67 ms 2168 KB Output is correct
10 Correct 30 ms 1372 KB Output is correct
11 Correct 32 ms 1628 KB Output is correct
12 Correct 32 ms 1640 KB Output is correct
13 Correct 30 ms 1372 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1004 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 856 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 5 ms 1000 KB Output is correct
14 Correct 4 ms 860 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 1628 KB Output is correct
18 Correct 67 ms 2168 KB Output is correct
19 Correct 30 ms 1372 KB Output is correct
20 Correct 32 ms 1628 KB Output is correct
21 Correct 32 ms 1640 KB Output is correct
22 Correct 30 ms 1372 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 5 ms 1264 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 5 ms 1032 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 5 ms 860 KB Output is correct
30 Correct 50 ms 2136 KB Output is correct
31 Correct 28 ms 1368 KB Output is correct
32 Correct 29 ms 1368 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 4 ms 960 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 4 ms 856 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 960 KB Output is correct
39 Correct 4 ms 860 KB Output is correct
40 Correct 5 ms 960 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 4 ms 992 KB Output is correct
43 Correct 29 ms 1500 KB Output is correct
44 Correct 32 ms 1624 KB Output is correct
45 Correct 45 ms 2648 KB Output is correct
46 Correct 33 ms 1628 KB Output is correct
47 Correct 35 ms 1628 KB Output is correct
48 Correct 31 ms 1628 KB Output is correct
49 Correct 73 ms 4220 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 30 ms 1372 KB Output is correct
53 Correct 31 ms 1372 KB Output is correct
54 Correct 31 ms 1612 KB Output is correct
55 Correct 30 ms 1372 KB Output is correct
56 Correct 30 ms 1372 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 5 ms 1116 KB Output is correct
59 Correct 5 ms 1164 KB Output is correct
60 Correct 5 ms 1112 KB Output is correct
61 Correct 76 ms 4360 KB Output is correct
62 Correct 66 ms 4316 KB Output is correct
63 Correct 0 ms 344 KB Output is correct