oj.uz

Submission #198029

# Submission time Handle Problem Language Result Execution time Memory
198029 2020-01-24T14:05:56 Z stefdasca Travelling Merchant (APIO17_merchant) C++14
100 / 100
 100 ms 1408 KB 
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

// #define fisier 1

using namespace std;

typedef long long ll;

int n, m, k, buy[102][1002], sell[102][1002];

ll cost[102][102], cost2[102][102];

int maxdif[102][102];

void fw(ll c[102][102])
{
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
}
int main()
{

    #ifdef fisier
        ifstream f("input.in");
        ofstream g("output.out");
    #endif

    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 >> buy[i][j] >> sell[i][j];
    }
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            cost[i][j] = (1LL<<60);
    for(int i = 1; i <= m; ++i)
    {
        int a, b, c;
        cin >> a >> b >> c;
        cost[a][b] = c;
    }
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            if(i != j)
                for(int x = 1; x <= k; ++x)
                    if(buy[i][x] != -1 && sell[j][x] != -1)
                        maxdif[i][j] = max(maxdif[i][j], sell[j][x] - buy[i][x]);

    fw(cost);
    ll st = 1;
    ll dr = 1000000000;
    ll ans = 0;
    while(st <= dr)
    {
        ll mid = (st + dr) / 2;
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                cost2[i][j] = min(cost[i][j], (1LL<<62)/mid/2) * mid - maxdif[i][j];
        fw(cost2);
        bool ok = 0;
        for(int i = 1; i <= n; ++i)
            if(cost2[i][i] <= 0)
                ok = 1;
        if(ok)
            ans = mid, st = mid + 1;
        else
            dr = mid - 1;
    }
    cout << ans;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 1272 KB Output is correct
2 Correct 37 ms 1272 KB Output is correct
3 Correct 39 ms 1340 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 7 ms 760 KB Output is correct
6 Correct 7 ms 888 KB Output is correct
7 Correct 9 ms 760 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1372 KB Output is correct
2 Correct 91 ms 1292 KB Output is correct
3 Correct 41 ms 1400 KB Output is correct
4 Correct 44 ms 1272 KB Output is correct
5 Correct 47 ms 1400 KB Output is correct
6 Correct 41 ms 1272 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 10 ms 376 KB Output is correct
9 Correct 8 ms 764 KB Output is correct
10 Correct 10 ms 1016 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 8 ms 760 KB Output is correct
13 Correct 7 ms 760 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 888 KB Output is correct
2 Correct 7 ms 888 KB Output is correct
3 Correct 8 ms 888 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 12 ms 888 KB Output is correct
8 Correct 8 ms 760 KB Output is correct
9 Correct 12 ms 892 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 8 ms 760 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 8 ms 888 KB Output is correct
15 Correct 9 ms 760 KB Output is correct
16 Correct 8 ms 888 KB Output is correct
17 Correct 44 ms 1372 KB Output is correct
18 Correct 91 ms 1292 KB Output is correct
19 Correct 41 ms 1400 KB Output is correct
20 Correct 44 ms 1272 KB Output is correct
21 Correct 47 ms 1400 KB Output is correct
22 Correct 41 ms 1272 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 10 ms 376 KB Output is correct
25 Correct 8 ms 764 KB Output is correct
26 Correct 10 ms 1016 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 8 ms 760 KB Output is correct
29 Correct 7 ms 760 KB Output is correct
30 Correct 39 ms 1400 KB Output is correct
31 Correct 41 ms 1272 KB Output is correct
32 Correct 59 ms 1400 KB Output is correct
33 Correct 41 ms 1272 KB Output is correct
34 Correct 42 ms 1408 KB Output is correct
35 Correct 42 ms 1400 KB Output is correct
36 Correct 97 ms 1400 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 39 ms 1272 KB Output is correct
40 Correct 42 ms 1372 KB Output is correct
41 Correct 40 ms 1272 KB Output is correct
42 Correct 39 ms 1276 KB Output is correct
43 Correct 39 ms 1276 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 10 ms 888 KB Output is correct
46 Correct 9 ms 888 KB Output is correct
47 Correct 9 ms 888 KB Output is correct
48 Correct 100 ms 1404 KB Output is correct
49 Correct 99 ms 1400 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 69 ms 1272 KB Output is correct
52 Correct 37 ms 1272 KB Output is correct
53 Correct 39 ms 1340 KB Output is correct
54 Correct 7 ms 760 KB Output is correct
55 Correct 7 ms 760 KB Output is correct
56 Correct 7 ms 888 KB Output is correct
57 Correct 9 ms 760 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 8 ms 888 KB Output is correct
60 Correct 8 ms 888 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 8 ms 888 KB Output is correct