oj.uz

Submission #744445

# Submission time Handle Problem Language Result Execution time Memory
744445 2023-05-18T14:56:16 Z Mauve Travelling Merchant (APIO17_merchant) C++14
100 / 100
 83 ms 2124 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
const ll INF = LLONG_MAX / 2;
#define pb push_back
ll n,m,l,r,i,j,ii,jj,k,x,y,T,s,e,adj[101][101],ashig[101][101],adj1[101][101],buy[101][1001],sell[101][1001];
bool floyd_warshall(ll graph[101][101]){
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    for(int k=1;k<=n;k++)
    graph[j][k]=min(graph[j][k],graph[j][i]+graph[i][k]);
    for(int i=1;i<=n;i++) if(graph[i][i]<=0) return true;
    return false;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>n>>m>>k;
    for(i=1;i<=n;i++)
    for(j=1;j<=k;j++)
    cin>>buy[i][j]>>sell[i][j];
    for(i=1;i<=n;i++) for(j=1;j<=n;j++) adj[i][j]=INF;
    for(i=1;i<=m;i++){
        cin>>l>>r>>e;
        adj[l][r]=e;
    }
    floyd_warshall(adj);
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    for(ii=1;ii<=k;ii++)
    if(buy[i][ii]!=-1 && sell[j][ii]!=-1) ashig[i][j]=max(ashig[i][j],sell[j][ii]-buy[i][ii]);
    l=0;
    r=1e9;
    while(r-l>1){
        m=(r+l)/2;
        for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        adj1[i][j]=m*min(adj[i][j],(INF)/m)-ashig[i][j];
        if(floyd_warshall(adj1)) l=m;
        else r=m-1;
    }
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++) adj1[i][j]=min(adj[i][j],(INF)/r)*r-ashig[i][j];
    if(floyd_warshall(adj1)) cout<<r;
    else cout<<l;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2004 KB Output is correct
2 Correct 27 ms 1236 KB Output is correct
3 Correct 28 ms 1292 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 5 ms 800 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 5 ms 816 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 5 ms 724 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 5 ms 800 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 5 ms 816 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 5 ms 724 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 1 ms 340 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 6 ms 800 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 6 ms 888 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 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 5 ms 892 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 6 ms 816 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 864 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 892 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 816 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 864 KB Output is correct
8 Correct 36 ms 1492 KB Output is correct
9 Correct 74 ms 2124 KB Output is correct
10 Correct 30 ms 1424 KB Output is correct
11 Correct 38 ms 1492 KB Output is correct
12 Correct 35 ms 1492 KB Output is correct
13 Correct 32 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 6 ms 800 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 888 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 852 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 36 ms 1492 KB Output is correct
18 Correct 74 ms 2124 KB Output is correct
19 Correct 30 ms 1424 KB Output is correct
20 Correct 38 ms 1492 KB Output is correct
21 Correct 35 ms 1492 KB Output is correct
22 Correct 32 ms 1364 KB Output is correct
23 Correct 5 ms 892 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 896 KB Output is correct
27 Correct 6 ms 816 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 864 KB Output is correct
30 Correct 48 ms 2004 KB Output is correct
31 Correct 27 ms 1236 KB Output is correct
32 Correct 28 ms 1292 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 6 ms 724 KB Output is correct
36 Correct 5 ms 800 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 5 ms 816 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 5 ms 724 KB Output is correct
43 Correct 30 ms 1364 KB Output is correct
44 Correct 32 ms 1620 KB Output is correct
45 Correct 46 ms 2036 KB Output is correct
46 Correct 31 ms 1516 KB Output is correct
47 Correct 31 ms 1492 KB Output is correct
48 Correct 31 ms 1492 KB Output is correct
49 Correct 76 ms 2028 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 30 ms 1236 KB Output is correct
53 Correct 30 ms 1236 KB Output is correct
54 Correct 29 ms 1364 KB Output is correct
55 Correct 31 ms 1364 KB Output is correct
56 Correct 29 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 6 ms 852 KB Output is correct
59 Correct 7 ms 852 KB Output is correct
60 Correct 7 ms 852 KB Output is correct
61 Correct 83 ms 2040 KB Output is correct
62 Correct 82 ms 1996 KB Output is correct
63 Correct 0 ms 340 KB Output is correct