oj.uz

답안 #677342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677342 2023-01-02T21:43:06 Z MasterTaster 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 145 ms 4176 KB 
#include <iostream>

#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define pb push_back
#define MAXN 110
#define MAXK 1010
#define INF 1000000000000000000LL

using namespace std;

int n, m, k;
ll b[MAXN][MAXK], s[MAXN][MAXK], dist[MAXN][MAXN], p[MAXN][MAXN], novi[MAXN][MAXN], ress;

void fw(ll d[MAXN][MAXN])
{
    for (int l=1; l<=n; l++)
    {
        for (int u=1; u<=n; u++)
        {
            for (int v=1; v<=n; v++)
            {
                d[u][v]=min(d[u][v], d[u][l]+d[l][v]);
            }
        }
    }
}

int main() {
    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++) dist[i][j]=INF;

    for (int i=0; i<m; i++)
    {
        ll u, v, w; cin>>u>>v>>w;
        dist[u][v]=w;
    }
    fw(dist);
    /*for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            cout<<i<<" "<<j<<" "<<dist[i][j]<<endl;
        }
    }*/

    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            for (int l=1; l<=k; l++)
            {
                if (b[i][l]==-1 || s[j][l]==-1) continue;
                p[i][j]=max(p[i][j], s[j][l]-b[i][l]);
            }
            //cout<<i<<" "<<j<<" "<<p[i][j]<<endl;
        }
    }

    ll l=1, r=1000000000LL;
    while (l<=r)
    {
        ll mid=l+(r-l)/2;
        //cout<<mid<<endl;
        for (int i=1; i<=n; i++) for (int j=1; j<=n; j++)
        {
            //if (dist[i][j]==INF) novi[i][j]==INF-p[i][j];///-p
            novi[i][j]=min(dist[i][j], INF/mid)*mid-p[i][j];
        }
        fw(novi);
        bool moze=false;
        for (int i=1; i<=n; i++) if (novi[i][i]<=0) moze=true;

        if (moze)
        {
            ress=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    cout<<ress;


}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 2072 KB Output is correct
2 Correct 30 ms 1292 KB Output is correct
3 Correct 29 ms 1284 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 800 KB Output is correct
7 Correct 7 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 8 ms 728 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 6 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 800 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 8 ms 728 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 5 ms 736 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 7 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 7 ms 852 KB Output is correct
20 Correct 9 ms 892 KB Output is correct
21 Correct 6 ms 724 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 8 ms 852 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 7 ms 900 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 8 ms 852 KB Output is correct
28 Correct 7 ms 892 KB Output is correct
29 Correct 7 ms 852 KB Output is correct
30 Correct 6 ms 724 KB Output is correct
31 Correct 7 ms 840 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 900 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 7 ms 892 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 7 ms 840 KB Output is correct
8 Correct 40 ms 1508 KB Output is correct
9 Correct 121 ms 2040 KB Output is correct
10 Correct 40 ms 1420 KB Output is correct
11 Correct 40 ms 1444 KB Output is correct
12 Correct 42 ms 1524 KB Output is correct
13 Correct 41 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 5 ms 736 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 9 ms 892 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 8 ms 852 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 40 ms 1508 KB Output is correct
18 Correct 121 ms 2040 KB Output is correct
19 Correct 40 ms 1420 KB Output is correct
20 Correct 40 ms 1444 KB Output is correct
21 Correct 42 ms 1524 KB Output is correct
22 Correct 41 ms 1364 KB Output is correct
23 Correct 7 ms 900 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 8 ms 852 KB Output is correct
26 Correct 7 ms 892 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 6 ms 724 KB Output is correct
29 Correct 7 ms 840 KB Output is correct
30 Correct 98 ms 2072 KB Output is correct
31 Correct 30 ms 1292 KB Output is correct
32 Correct 29 ms 1284 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 800 KB Output is correct
36 Correct 7 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 8 ms 728 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 30 ms 1364 KB Output is correct
44 Correct 35 ms 1620 KB Output is correct
45 Correct 70 ms 2624 KB Output is correct
46 Correct 34 ms 1604 KB Output is correct
47 Correct 36 ms 1492 KB Output is correct
48 Correct 35 ms 1604 KB Output is correct
49 Correct 133 ms 3992 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 35 ms 1348 KB Output is correct
53 Correct 37 ms 1468 KB Output is correct
54 Correct 33 ms 1364 KB Output is correct
55 Correct 31 ms 1364 KB Output is correct
56 Correct 31 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 10 ms 980 KB Output is correct
59 Correct 9 ms 960 KB Output is correct
60 Correct 9 ms 1108 KB Output is correct
61 Correct 140 ms 4148 KB Output is correct
62 Correct 145 ms 4176 KB Output is correct
63 Correct 0 ms 340 KB Output is correct