oj.uz

Submission #978828

# Submission time Handle Problem Language Result Execution time Memory
978828 2024-05-09T18:20:28 Z nnin Travelling Merchant (APIO17_merchant) C++17
100 / 100
 78 ms 4268 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
 
int N, M, K;
ll B[105][1005], S[105][1005], mindis[105][105], profit[105][105], mat[105][105];
 
bool check(ll x) {
    for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) {
        if(mindis[i][j]==1e13 || i==j) mat[i][j] = -1e13;
        else mat[i][j] = profit[i][j]-(x*mindis[i][j]);
    }
    for(int k=1;k<=N;k++) for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) {
        mat[i][j] = max(mat[i][j], mat[i][k]+mat[k][j]);
    }
    for(int i=1;i<=N;i++) {
        if(mat[i][i]>=0) return true;
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    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++) mindis[i][j] = 1e13;
        mindis[i][i] = 0;
    }
    while(M--) {
        int u, v; ll w;
        cin>>u>>v>>w;
        mindis[u][v] = w;
    }
    for(int k=1;k<=N;k++) for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) {
        mindis[i][j] = min(mindis[i][j], mindis[i][k]+mindis[k][j]);
    }
    for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) {
        if(i==j) continue;
        profit[i][j] = 0;
        for(int k=1;k<=K;k++) {
            if(B[i][k]==-1 || S[j][k]==-1) continue;
            profit[i][j] = max(profit[i][j], S[j][k]-B[i][k]);
        }
    }
    ll l = 0, r = 1e9;
    while(l<r) {
        ll m = (l+r+1)/2;
        if(check(m)) l = m;
        else r = m-1;
    }
    cout<<l;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 2140 KB Output is correct
2 Correct 26 ms 1520 KB Output is correct
3 Correct 28 ms 1512 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 860 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 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 860 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 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 0 ms 348 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 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 6 ms 1000 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 4 ms 1008 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 4 ms 1028 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 1024 KB Output is correct
30 Correct 4 ms 988 KB Output is correct
31 Correct 4 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1028 KB Output is correct
2 Correct 0 ms 600 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 1024 KB Output is correct
6 Correct 4 ms 988 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 30 ms 1676 KB Output is correct
9 Correct 66 ms 2156 KB Output is correct
10 Correct 29 ms 1560 KB Output is correct
11 Correct 30 ms 1628 KB Output is correct
12 Correct 30 ms 1884 KB Output is correct
13 Correct 33 ms 1640 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 6 ms 1000 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 860 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 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 4 ms 1008 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 30 ms 1676 KB Output is correct
18 Correct 66 ms 2156 KB Output is correct
19 Correct 29 ms 1560 KB Output is correct
20 Correct 30 ms 1628 KB Output is correct
21 Correct 30 ms 1884 KB Output is correct
22 Correct 33 ms 1640 KB Output is correct
23 Correct 4 ms 1028 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 4 ms 1024 KB Output is correct
28 Correct 4 ms 988 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 45 ms 2140 KB Output is correct
31 Correct 26 ms 1520 KB Output is correct
32 Correct 28 ms 1512 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 860 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 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 28 ms 1368 KB Output is correct
44 Correct 29 ms 1488 KB Output is correct
45 Correct 41 ms 2760 KB Output is correct
46 Correct 29 ms 1628 KB Output is correct
47 Correct 29 ms 1624 KB Output is correct
48 Correct 30 ms 1628 KB Output is correct
49 Correct 71 ms 4084 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 28 ms 1532 KB Output is correct
53 Correct 29 ms 1624 KB Output is correct
54 Correct 31 ms 1368 KB Output is correct
55 Correct 30 ms 1552 KB Output is correct
56 Correct 28 ms 1624 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 5 ms 1164 KB Output is correct
59 Correct 5 ms 1116 KB Output is correct
60 Correct 5 ms 1116 KB Output is correct
61 Correct 55 ms 4268 KB Output is correct
62 Correct 78 ms 4152 KB Output is correct
63 Correct 1 ms 344 KB Output is correct