oj.uz

Submission #243657

# Submission time Handle Problem Language Result Execution time Memory
243657 2020-07-01T13:46:37 Z Autoratch Travelling Merchant (APIO17_merchant) C++14
100 / 100
 108 ms 3448 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 101;
const int K = 1001;

int n,m,k;
int b[N][K],s[N][K];
int diso[N][N],sell[N][N];
long long dist[N][N];

bool solve(long long x)
{
    for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) dist[i][j] = (long long)diso[i][j]*x-(long long)sell[i][j];
    for(int i = 1;i <= n;i++) dist[i][i] = INT_MAX;
    for(int k = 1;k <= n;k++) for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) 
        dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
    for(int i = 1;i <= n;i++) if(dist[i][i]<=0) return true;
    return false;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    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 = i+1;j <= n;j++) diso[i][j] = diso[j][i] = INT_MAX;
    for(int i = 0;i < m;i++)
    {
        int a,b,d;
        cin >> a >> b >> d;
        diso[a][b] = min(diso[a][b],d);
    }
    for(int k = 1;k <= n;k++) for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) 
        if(diso[i][k]!=INT_MAX and diso[k][j]!=INT_MAX) diso[i][j] = min(diso[i][j],diso[i][k]+diso[k][j]);
    for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) for(int l = 1;l <= k;l++) 
        if(s[j][l]>0 and b[i][l]>0) sell[i][j] = max(sell[i][j],s[j][l]-b[i][l]);
    long long l = 0,r = 1e9;
    while(l<r)
    {
        long long m = (l+r+1LL)/2LL;
        if(solve(m)) l = m;
        else r = m-1;
    }
    cout << l;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 2552 KB Output is correct
2 Correct 39 ms 1280 KB Output is correct
3 Correct 39 ms 1280 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 10 ms 768 KB Output is correct
6 Correct 9 ms 768 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 10 ms 768 KB Output is correct
11 Correct 10 ms 768 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 10 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1408 KB Output is correct
2 Correct 100 ms 3064 KB Output is correct
3 Correct 42 ms 1536 KB Output is correct
4 Correct 46 ms 1536 KB Output is correct
5 Correct 50 ms 1536 KB Output is correct
6 Correct 42 ms 1408 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 10 ms 896 KB Output is correct
13 Correct 9 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 10 ms 768 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 10 ms 768 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 10 ms 768 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 11 ms 896 KB Output is correct
16 Correct 10 ms 768 KB Output is correct
17 Correct 45 ms 1408 KB Output is correct
18 Correct 100 ms 3064 KB Output is correct
19 Correct 42 ms 1536 KB Output is correct
20 Correct 46 ms 1536 KB Output is correct
21 Correct 50 ms 1536 KB Output is correct
22 Correct 42 ms 1408 KB Output is correct
23 Correct 11 ms 896 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 10 ms 896 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 9 ms 768 KB Output is correct
30 Correct 40 ms 1280 KB Output is correct
31 Correct 42 ms 1408 KB Output is correct
32 Correct 63 ms 1912 KB Output is correct
33 Correct 43 ms 1280 KB Output is correct
34 Correct 42 ms 1408 KB Output is correct
35 Correct 43 ms 1408 KB Output is correct
36 Correct 108 ms 3192 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 40 ms 1280 KB Output is correct
40 Correct 42 ms 1408 KB Output is correct
41 Correct 42 ms 1408 KB Output is correct
42 Correct 41 ms 1280 KB Output is correct
43 Correct 40 ms 1280 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 12 ms 896 KB Output is correct
46 Correct 12 ms 896 KB Output is correct
47 Correct 12 ms 896 KB Output is correct
48 Correct 108 ms 3320 KB Output is correct
49 Correct 108 ms 3448 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 68 ms 2552 KB Output is correct
52 Correct 39 ms 1280 KB Output is correct
53 Correct 39 ms 1280 KB Output is correct
54 Correct 9 ms 768 KB Output is correct
55 Correct 10 ms 768 KB Output is correct
56 Correct 9 ms 768 KB Output is correct
57 Correct 10 ms 768 KB Output is correct
58 Correct 4 ms 384 KB Output is correct
59 Correct 10 ms 768 KB Output is correct
60 Correct 10 ms 768 KB Output is correct
61 Correct 10 ms 768 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 10 ms 768 KB Output is correct