oj.uz

Submission #773933

# Submission time Handle Problem Language Result Execution time Memory
773933 2023-07-05T09:42:46 Z Dan4Life Travelling Merchant (APIO17_merchant) C++17
100 / 100
 110 ms 4160 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 105, mxK=1005;
const int INF = 1e18;
int n, m, K, u, v, w;
int b[mxN][mxK], s[mxN][mxK];
int p[mxN][mxN], dis[2][mxN][mxN];

void floydWarshall(int t){
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                dis[t][i][j] = min(dis[t][i][j],
                    dis[t][i][k]+dis[t][k][j]);
}

int32_t main(){
    cin >> n >> m >> K;
    memset(dis,63,sizeof(dis));
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= K; j++) 
            cin >> b[i][j] >> s[i][j];
    for(int i = 0; i < m; i++)
        cin>>u>>v>>w,dis[0][u][v]=w;
    floydWarshall(0);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            for(int k = 1; k <= K; k++)
                if(min(b[i][k],s[j][k])>=0) 
                    p[i][j]=max(p[i][j],s[j][k]-b[i][k]);
    int l = 0, r = 1e9;
    while(l<r){
        int mid = (l+r+1)/2, ok=0;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                dis[1][i][j]=-p[i][j]+mid*
                    min(INF/mid,dis[0][i][j]);
        floydWarshall(1);
        for(int i = 1; i <= n;i++) 
            if(dis[1][i][i]<=0) ok=1;
        if(ok) l=mid;
        else r=mid-1;
    }
    cout << l;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2036 KB Output is correct
2 Correct 27 ms 1236 KB Output is correct
3 Correct 28 ms 1236 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 4 ms 876 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 876 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 5 ms 980 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 4 ms 852 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 5 ms 852 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 5 ms 928 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 5 ms 940 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 5 ms 944 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 4 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 940 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 944 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 34 ms 1492 KB Output is correct
9 Correct 86 ms 2124 KB Output is correct
10 Correct 32 ms 1400 KB Output is correct
11 Correct 36 ms 1492 KB Output is correct
12 Correct 38 ms 1516 KB Output is correct
13 Correct 31 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 5 ms 980 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 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 5 ms 852 KB Output is correct
14 Correct 5 ms 928 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 34 ms 1492 KB Output is correct
18 Correct 86 ms 2124 KB Output is correct
19 Correct 32 ms 1400 KB Output is correct
20 Correct 36 ms 1492 KB Output is correct
21 Correct 38 ms 1516 KB Output is correct
22 Correct 31 ms 1364 KB Output is correct
23 Correct 5 ms 940 KB Output is correct
24 Correct 0 ms 468 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 944 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 78 ms 2036 KB Output is correct
31 Correct 27 ms 1236 KB Output is correct
32 Correct 28 ms 1236 KB Output is correct
33 Correct 4 ms 852 KB Output is correct
34 Correct 4 ms 852 KB Output is correct
35 Correct 4 ms 876 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 4 ms 852 KB Output is correct
39 Correct 4 ms 852 KB Output is correct
40 Correct 4 ms 852 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 29 ms 1364 KB Output is correct
44 Correct 32 ms 1488 KB Output is correct
45 Correct 57 ms 2604 KB Output is correct
46 Correct 32 ms 1564 KB Output is correct
47 Correct 33 ms 1468 KB Output is correct
48 Correct 32 ms 1492 KB Output is correct
49 Correct 93 ms 3956 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 436 KB Output is correct
52 Correct 29 ms 1332 KB Output is correct
53 Correct 34 ms 1436 KB Output is correct
54 Correct 30 ms 1364 KB Output is correct
55 Correct 29 ms 1364 KB Output is correct
56 Correct 29 ms 1236 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 7 ms 1092 KB Output is correct
59 Correct 7 ms 1088 KB Output is correct
60 Correct 7 ms 1084 KB Output is correct
61 Correct 110 ms 4160 KB Output is correct
62 Correct 101 ms 4128 KB Output is correct
63 Correct 1 ms 468 KB Output is correct