oj.uz

Submission #945037

# Submission time Handle Problem Language Result Execution time Memory
945037 2024-03-13T10:20:58 Z JakobZorz Travelling Merchant (APIO17_merchant) C++17
100 / 100
 77 ms 4252 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;

int n,m,k;
ll buy[100][1000];
ll sell[100][1000];
ll profit[100][100];
ll dist[100][100];
ll cost[100][100];

void solve(){
    cin>>n>>m>>k;
    for(int i=0;i<n;i++)
        for(int j=0;j<k;j++)
            cin>>buy[i][j]>>sell[i][j];
    for(int i1=0;i1<n;i1++)
        for(int i2=0;i2<n;i2++)
            for(int j=0;j<k;j++)
                if(sell[i2][j]!=-1&&buy[i1][j]!=-1)
                    profit[i1][i2]=max(profit[i1][i2],sell[i2][j]-buy[i1][j]);
    for(int i1=0;i1<n;i1++)
        for(int i2=0;i2<n;i2++)
            dist[i1][i2]=1e18;
    for(int i=0;i<m;i++){
        int a,b,w;
        cin>>a>>b>>w;
        dist[a-1][b-1]=w;
    }
    for(int j=0;j<n;j++)
        for(int i1=0;i1<n;i1++)
            for(int i2=0;i2<n;i2++)
                dist[i1][i2]=min(dist[i1][i2],dist[i1][j]+dist[j][i2]);
    ll l=0,r=2e9;
    while(l<r-1){
        ll curr=(l+r)/2;
        // does there exist a cycle with efficiency at least curr?
        for(int i1=0;i1<n;i1++)
            for(int i2=0;i2<n;i2++)
                cost[i1][i2]=curr*min(dist[i1][i2],ll(1e18)/curr)-profit[i1][i2];
        for(int j=0;j<n;j++)
            for(int i1=0;i1<n;i1++)
                for(int i2=0;i2<n;i2++)
                    cost[i1][i2]=min(cost[i1][i2],cost[i1][j]+cost[j][i2]);
        bool has=false;
        for(int i=0;i<n;i++)
            if(cost[i][i]<=0)
                has=true;
        if(has)
            l=curr;
        else
            r=curr;
    }
    cout<<l<<"\n";
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("/Users/jakob/cp_testing/test.txt","r",stdin);freopen("output.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}


/*

4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
 
 */

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2140 KB Output is correct
2 Correct 30 ms 1368 KB Output is correct
3 Correct 31 ms 1372 KB Output is correct
4 Correct 6 ms 860 KB Output is correct
5 Correct 4 ms 1112 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 344 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 960 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 904 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 344 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 960 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 904 KB Output is correct
9 Correct 6 ms 1112 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 1112 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 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 5 ms 1088 KB Output is correct
20 Correct 4 ms 1084 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 4 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 6 ms 856 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 4 ms 860 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 6 ms 856 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 33 ms 1628 KB Output is correct
9 Correct 61 ms 2228 KB Output is correct
10 Correct 32 ms 1372 KB Output is correct
11 Correct 34 ms 1628 KB Output is correct
12 Correct 33 ms 1628 KB Output is correct
13 Correct 32 ms 1368 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1112 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 1112 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 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 5 ms 1088 KB Output is correct
12 Correct 4 ms 1084 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 33 ms 1628 KB Output is correct
18 Correct 61 ms 2228 KB Output is correct
19 Correct 32 ms 1372 KB Output is correct
20 Correct 34 ms 1628 KB Output is correct
21 Correct 33 ms 1628 KB Output is correct
22 Correct 32 ms 1368 KB Output is correct
23 Correct 6 ms 856 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 856 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 860 KB Output is correct
30 Correct 49 ms 2140 KB Output is correct
31 Correct 30 ms 1368 KB Output is correct
32 Correct 31 ms 1372 KB Output is correct
33 Correct 6 ms 860 KB Output is correct
34 Correct 4 ms 1112 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 344 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 4 ms 960 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 904 KB Output is correct
43 Correct 31 ms 1372 KB Output is correct
44 Correct 33 ms 1628 KB Output is correct
45 Correct 44 ms 2652 KB Output is correct
46 Correct 32 ms 1628 KB Output is correct
47 Correct 33 ms 1700 KB Output is correct
48 Correct 32 ms 1628 KB Output is correct
49 Correct 74 ms 3968 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 31 ms 1372 KB Output is correct
53 Correct 32 ms 1372 KB Output is correct
54 Correct 36 ms 1368 KB Output is correct
55 Correct 31 ms 1372 KB Output is correct
56 Correct 31 ms 1372 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 5 ms 1112 KB Output is correct
59 Correct 5 ms 1112 KB Output is correct
60 Correct 5 ms 1116 KB Output is correct
61 Correct 77 ms 4188 KB Output is correct
62 Correct 62 ms 4252 KB Output is correct
63 Correct 0 ms 348 KB Output is correct