oj.uz

Submission #978823

# Submission time Handle Problem Language Result Execution time Memory
978823 2024-05-09T18:15:32 Z nnin Travelling Merchant (APIO17_merchant) C++17
21 / 100
 89 ms 3556 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 = 1e13;
    while(l<r) {
        ll m = (l+r+1)/2;
        if(check(m)) l = m;
        else r = m-1;
    }
    cout<<l;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 3280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1012 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 6 ms 860 KB Output is correct
4 Correct 6 ms 860 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 6 ms 860 KB Output is correct
14 Correct 6 ms 1032 KB Output is correct
15 Correct 10 ms 1096 KB Output is correct
16 Correct 5 ms 996 KB Output is correct
17 Correct 6 ms 1056 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 6 ms 856 KB Output is correct
20 Correct 8 ms 1112 KB Output is correct
21 Correct 6 ms 860 KB Output is correct
22 Correct 6 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 5 ms 996 KB Output is correct
25 Correct 6 ms 860 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 8 ms 992 KB Output is correct
28 Correct 6 ms 860 KB Output is correct
29 Correct 8 ms 860 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 6 ms 1056 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1056 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 856 KB Output is correct
4 Correct 8 ms 1112 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 41 ms 1624 KB Output is correct
9 Correct 89 ms 3556 KB Output is correct
10 Correct 51 ms 1648 KB Output is correct
11 Incorrect 41 ms 1816 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1012 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 6 ms 860 KB Output is correct
4 Correct 6 ms 860 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 6 ms 860 KB Output is correct
14 Correct 6 ms 1032 KB Output is correct
15 Correct 10 ms 1096 KB Output is correct
16 Correct 5 ms 996 KB Output is correct
17 Correct 41 ms 1624 KB Output is correct
18 Correct 89 ms 3556 KB Output is correct
19 Correct 51 ms 1648 KB Output is correct
20 Incorrect 41 ms 1816 KB Output isn't correct
21 Halted 0 ms 0 KB -