oj.uz

Submission #292061

# Submission time Handle Problem Language Result Execution time Memory
292061 2020-09-06T08:56:19 Z davooddkareshki Travelling Merchant (APIO17_merchant) C++17
100 / 100
 261 ms 4216 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define F first
#define S second
#define pii pair<int,int>
#define mpr make_pair

typedef long long ll;
//typedef long double ld;

const int maxn = 105;
const int mod = 1e9+7;
const ll inf = 2e9+10;
const int MAX_K = 1010;

int n, m, k;
ll dis[maxn][maxn], W[maxn][maxn];
ll buy[maxn][MAX_K], sell[maxn][MAX_K];

ll dp[maxn][maxn];
bool ok(ll q)
{
    /// non_negetive cycle
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++) dp[i][j] = -inf*inf;

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(i != j)
                dp[i][j] = (W[i][j] - dis[i][j] * q);

    for(int k = 1; k <= n; k++)
        for(int u = 1; u <= n; u++)
            for(int v = 1; v <= n; v++)
                dp[u][v] = max(dp[u][v], dp[u][k] + dp[k][v]);
    for(int v = 1; v <= n; v++)
        if(dp[v][v] >= 0) return 1;
    return 0;
}

signed main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>> n >> m >> k;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++) dis[i][j] = inf;
        dis[i][i] = 0;
    }

    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, u, v, w; i <= m; i++)
    {
        cin>> u >> v >> w;
        dis[u][v] = min(dis[u][v], w);
    }

    /// floyd
    for(int k = 1; k <= n; k++)
        for(int u = 1; u <= n; u++)
            for(int v = 1; v <= n; v++)
                dis[u][v] = min(dis[u][v], dis[u][k] + dis[k][v]);
    /// end

    for(int u = 1; u <= n; u++)
    {
        for(int v = 1; v <= n; v++)
        {
            W[u][v] = 0.0;
            for(int x = 1; x <= k; x++)
                if(buy[u][x] != -1 && sell[v][x] != -1)
                    W[u][v] = max(W[u][v], -buy[u][x] + sell[v][x]);

         //   cout<< u <<" "<< v <<" "<< W[u][v] <<" "<< dis[u][v] <<"\n";
        }
    }

    ll lo = 0, hi = inf;
    while(hi-lo > 1)
    {
        ll tm = (hi + lo) >> 1;
        if(ok(tm)) lo = tm;
        else hi = tm;
    }

    cout<< lo;
}
/*
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 170 ms 2168 KB Output is correct
2 Correct 38 ms 1408 KB Output is correct
3 Correct 39 ms 1408 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 6 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 1592 KB Output is correct
2 Correct 228 ms 2168 KB Output is correct
3 Correct 48 ms 1408 KB Output is correct
4 Correct 62 ms 1536 KB Output is correct
5 Correct 60 ms 1536 KB Output is correct
6 Correct 48 ms 1536 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 896 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 9 ms 896 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 13 ms 896 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 12 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 13 ms 896 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 54 ms 1592 KB Output is correct
18 Correct 228 ms 2168 KB Output is correct
19 Correct 48 ms 1408 KB Output is correct
20 Correct 62 ms 1536 KB Output is correct
21 Correct 60 ms 1536 KB Output is correct
22 Correct 48 ms 1536 KB Output is correct
23 Correct 9 ms 896 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 7 ms 896 KB Output is correct
30 Correct 41 ms 1408 KB Output is correct
31 Correct 48 ms 1664 KB Output is correct
32 Correct 105 ms 2680 KB Output is correct
33 Correct 48 ms 1656 KB Output is correct
34 Correct 51 ms 1664 KB Output is correct
35 Correct 52 ms 1672 KB Output is correct
36 Correct 261 ms 4088 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 47 ms 1408 KB Output is correct
40 Correct 57 ms 1536 KB Output is correct
41 Correct 44 ms 1528 KB Output is correct
42 Correct 41 ms 1408 KB Output is correct
43 Correct 41 ms 1408 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 16 ms 1024 KB Output is correct
46 Correct 15 ms 1024 KB Output is correct
47 Correct 18 ms 1024 KB Output is correct
48 Correct 259 ms 4216 KB Output is correct
49 Correct 257 ms 4132 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 170 ms 2168 KB Output is correct
52 Correct 38 ms 1408 KB Output is correct
53 Correct 39 ms 1408 KB Output is correct
54 Correct 6 ms 896 KB Output is correct
55 Correct 6 ms 896 KB Output is correct
56 Correct 6 ms 896 KB Output is correct
57 Correct 9 ms 896 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 6 ms 896 KB Output is correct
60 Correct 8 ms 896 KB Output is correct
61 Correct 6 ms 896 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 9 ms 896 KB Output is correct