oj.uz

Submission #89881

# Submission time Handle Problem Language Result Execution time Memory
89881 2018-12-18T18:01:00 Z Alexa2001 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 117 ms 9648 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int Nmax = 105, Kmax = 1005;
const ll inf = 1e18;

int buy[Nmax][Kmax], sell[Nmax][Kmax];
int profit[Nmax][Nmax];
ll dist[Nmax][Nmax], dp[Nmax][Nmax];
int n, m, k;

void read()
{
    int i, j, t, tmp;
    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)
            dist[i][j] = (i == j ? 0 : inf);

    int x, y;
    for(i=1; i<=m; ++i)
    {
        cin >> x >> y >> tmp;
        dist[x][y] = tmp;
    }

    for(t=1; t<=n; ++t)
        for(i=1; i<=n; ++i)
            for(j=1; j<=n; ++j)
                dist[i][j] = min(dist[i][t] + dist[t][j], dist[i][j]);

    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            for(t=1; t<=k; ++t)
                if(sell[j][t] != -1 && buy[i][t] != -1)
                    profit[i][j] = max(profit[i][j], sell[j][t] - buy[i][t]);
}

bool check(int E)
{
    int i, j, t;

    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            if(i == j) dp[i][j] = 0;
                else if((long double) dist[i][j] * E <= inf)
                    dp[i][j] = profit[i][j] - (ll) dist[i][j] * E;
                else dp[i][j] = -inf;

    for(t=1; t<=n; ++t)
        for(i=1; i<=n; ++i)
            for(j=1; j<=n; ++j)
            {
                dp[i][j] = max(dp[i][j], dp[i][t] + dp[t][j]);
                if(dp[i][j] > inf) return 1;
            }

    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            if(i != j && dp[i][j] + dp[j][i] >= 0) return 1;
    return 0;
}

int main()
{
 //   freopen("input", "r", stdin);
    cin.sync_with_stdio(false);

    read();
    int ans = 0, step;

    for(step = (1<<29); step; step >>= 1)
        if(check(ans + step)) ans += step;

    cout << ans << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 1272 KB Output is correct
2 Correct 48 ms 1396 KB Output is correct
3 Correct 30 ms 1396 KB Output is correct
4 Correct 9 ms 1396 KB Output is correct
5 Correct 8 ms 1396 KB Output is correct
6 Correct 8 ms 1396 KB Output is correct
7 Correct 9 ms 1396 KB Output is correct
8 Correct 2 ms 1396 KB Output is correct
9 Correct 6 ms 1396 KB Output is correct
10 Correct 9 ms 1396 KB Output is correct
11 Correct 8 ms 1396 KB Output is correct
12 Correct 2 ms 1396 KB Output is correct
13 Correct 10 ms 1396 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1396 KB Output is correct
2 Correct 8 ms 1396 KB Output is correct
3 Correct 9 ms 1396 KB Output is correct
4 Correct 9 ms 1396 KB Output is correct
5 Correct 9 ms 1396 KB Output is correct
6 Correct 2 ms 1396 KB Output is correct
7 Correct 8 ms 1396 KB Output is correct
8 Correct 9 ms 1504 KB Output is correct
9 Correct 10 ms 1504 KB Output is correct
10 Correct 9 ms 1508 KB Output is correct
11 Correct 10 ms 1508 KB Output is correct
12 Correct 9 ms 1576 KB Output is correct
13 Correct 8 ms 1628 KB Output is correct
14 Correct 9 ms 1668 KB Output is correct
15 Correct 10 ms 1764 KB Output is correct
16 Correct 9 ms 1764 KB Output is correct
17 Correct 9 ms 1768 KB Output is correct
18 Correct 3 ms 1768 KB Output is correct
19 Correct 10 ms 1768 KB Output is correct
20 Correct 10 ms 1768 KB Output is correct
21 Correct 10 ms 1768 KB Output is correct
22 Correct 12 ms 1816 KB Output is correct
23 Correct 8 ms 1840 KB Output is correct
24 Correct 8 ms 1396 KB Output is correct
25 Correct 9 ms 1396 KB Output is correct
26 Correct 2 ms 1396 KB Output is correct
27 Correct 6 ms 1396 KB Output is correct
28 Correct 9 ms 1396 KB Output is correct
29 Correct 8 ms 1396 KB Output is correct
30 Correct 2 ms 1396 KB Output is correct
31 Correct 10 ms 1396 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 2228 KB Output is correct
2 Correct 97 ms 2356 KB Output is correct
3 Correct 48 ms 2356 KB Output is correct
4 Correct 53 ms 2356 KB Output is correct
5 Correct 50 ms 2356 KB Output is correct
6 Correct 47 ms 2356 KB Output is correct
7 Correct 9 ms 1768 KB Output is correct
8 Correct 3 ms 1768 KB Output is correct
9 Correct 10 ms 1768 KB Output is correct
10 Correct 10 ms 1768 KB Output is correct
11 Correct 10 ms 1768 KB Output is correct
12 Correct 12 ms 1816 KB Output is correct
13 Correct 8 ms 1840 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1396 KB Output is correct
2 Correct 8 ms 1396 KB Output is correct
3 Correct 9 ms 1396 KB Output is correct
4 Correct 9 ms 1396 KB Output is correct
5 Correct 9 ms 1396 KB Output is correct
6 Correct 2 ms 1396 KB Output is correct
7 Correct 8 ms 1396 KB Output is correct
8 Correct 9 ms 1504 KB Output is correct
9 Correct 10 ms 1504 KB Output is correct
10 Correct 9 ms 1508 KB Output is correct
11 Correct 10 ms 1508 KB Output is correct
12 Correct 9 ms 1576 KB Output is correct
13 Correct 8 ms 1628 KB Output is correct
14 Correct 9 ms 1668 KB Output is correct
15 Correct 10 ms 1764 KB Output is correct
16 Correct 9 ms 1764 KB Output is correct
17 Correct 50 ms 2228 KB Output is correct
18 Correct 97 ms 2356 KB Output is correct
19 Correct 48 ms 2356 KB Output is correct
20 Correct 53 ms 2356 KB Output is correct
21 Correct 50 ms 2356 KB Output is correct
22 Correct 47 ms 2356 KB Output is correct
23 Correct 9 ms 1768 KB Output is correct
24 Correct 3 ms 1768 KB Output is correct
25 Correct 10 ms 1768 KB Output is correct
26 Correct 10 ms 1768 KB Output is correct
27 Correct 10 ms 1768 KB Output is correct
28 Correct 12 ms 1816 KB Output is correct
29 Correct 8 ms 1840 KB Output is correct
30 Correct 45 ms 2356 KB Output is correct
31 Correct 45 ms 2372 KB Output is correct
32 Correct 68 ms 2832 KB Output is correct
33 Correct 49 ms 3008 KB Output is correct
34 Correct 49 ms 3016 KB Output is correct
35 Correct 50 ms 3096 KB Output is correct
36 Correct 117 ms 5188 KB Output is correct
37 Correct 2 ms 5188 KB Output is correct
38 Correct 3 ms 5188 KB Output is correct
39 Correct 45 ms 5188 KB Output is correct
40 Correct 48 ms 5188 KB Output is correct
41 Correct 46 ms 5292 KB Output is correct
42 Correct 44 ms 5304 KB Output is correct
43 Correct 51 ms 5316 KB Output is correct
44 Correct 2 ms 5316 KB Output is correct
45 Correct 10 ms 5316 KB Output is correct
46 Correct 10 ms 5316 KB Output is correct
47 Correct 11 ms 5316 KB Output is correct
48 Correct 109 ms 7692 KB Output is correct
49 Correct 109 ms 9648 KB Output is correct
50 Correct 2 ms 9648 KB Output is correct
51 Correct 75 ms 1272 KB Output is correct
52 Correct 48 ms 1396 KB Output is correct
53 Correct 30 ms 1396 KB Output is correct
54 Correct 9 ms 1396 KB Output is correct
55 Correct 8 ms 1396 KB Output is correct
56 Correct 8 ms 1396 KB Output is correct
57 Correct 9 ms 1396 KB Output is correct
58 Correct 2 ms 1396 KB Output is correct
59 Correct 6 ms 1396 KB Output is correct
60 Correct 9 ms 1396 KB Output is correct
61 Correct 8 ms 1396 KB Output is correct
62 Correct 2 ms 1396 KB Output is correct
63 Correct 10 ms 1396 KB Output is correct