Submission #148096

# Submission time Handle Problem Language Result Execution time Memory
148096 2019-08-31T13:51:41 Z WhipppedCream Travelling Merchant (APIO17_merchant) C++17
100 / 100
110 ms 3548 KB
//Power Of Ninja Go
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector< ii > vii;
#define X first
#define Y second
#define pb push_back
const int maxn = 105;
const int maxk = 1005;
int dist[maxn][maxn];
int buy[maxn][maxk];
int sell[maxn][maxk];
ll prof[maxn][maxn];
ll aug[maxn][maxn];
int n, m, k;
bool works(ll x)
{
    //printf("x = %lld\n", x);
    for(int i = 1; i<= n; i++)
    {
        for(int j = 1; j<= n; j++)
        {
            aug[i][j] = 1LL*x*dist[i][j] - prof[i][j];
            //printf("aug[%d][%d] = %lld\n", i, j, aug[i][j]);
        }
    }
    for(int k = 1; k<= n; k++) for(int i = 1; i<= n; i++) for(int j = 1; j<= n; j++)
        aug[i][j] = min(aug[i][j], aug[i][k]+aug[k][j]);
    for(int i = 1; i<= n; i++) if(aug[i][i]<= 0) return true;
    return false;
}
int main()
{
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1; i<= n; i++) for(int j = 1; j<= n; j++) dist[i][j] = 1e9;
    for(int i = 1; i<= n; i++)
    {
        for(int j = 1; j<= k; j++) scanf("%d %d", &buy[i][j], &sell[i][j]);
    }
    while(m--)
    {
        int u, v, w; scanf("%d %d %d", &u, &v, &w);
        dist[u][v] = min(dist[u][v], w);
    }
    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++) for(int j = 1; j<= n; j++) prof[i][j] = 0;
    for(int i = 1; i<= n; i++)
    {
        for(int j = 1; j<= n; j++)
        {
            for(int prod = 1; prod<= k; prod++)
            {
                if(buy[i][prod] == -1 || sell[j][prod] == -1) continue;
                prof[i][j] = max(prof[i][j], 1LL*sell[j][prod]-buy[i][prod]);
            }
            //printf("prof[%d][%d] = %lld\n", i, j, prof[i][j]);
        }
    }
    ll lo = 0, hi = 1e9;
    while(lo< hi)
    {
        ll mid = (lo+hi+1)/2;
        if(works(mid)) lo = mid;
        else hi = mid-1;
    }
    printf("%lld\n", lo);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:39:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int j = 1; j<= k; j++) scanf("%d %d", &buy[i][j], &sell[i][j]);
                                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:43:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int u, v, w; scanf("%d %d %d", &u, &v, &w);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 76 ms 2552 KB Output is correct
2 Correct 39 ms 1272 KB Output is correct
3 Correct 41 ms 1412 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 7 ms 760 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 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 9 ms 888 KB Output is correct
6 Correct 3 ms 404 KB Output is correct
7 Correct 8 ms 884 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 8 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 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 888 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 9 ms 1016 KB Output is correct
21 Correct 9 ms 888 KB Output is correct
22 Correct 8 ms 888 KB Output is correct
23 Correct 8 ms 760 KB Output is correct
24 Correct 8 ms 760 KB Output is correct
25 Correct 8 ms 888 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 8 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 8 ms 888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 46 ms 1536 KB Output is correct
2 Correct 100 ms 3132 KB Output is correct
3 Correct 53 ms 1488 KB Output is correct
4 Correct 48 ms 1528 KB Output is correct
5 Correct 46 ms 1528 KB Output is correct
6 Correct 43 ms 1404 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 9 ms 1016 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 8 ms 888 KB Output is correct
13 Correct 8 ms 760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 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 9 ms 888 KB Output is correct
6 Correct 3 ms 404 KB Output is correct
7 Correct 8 ms 884 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 8 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 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 888 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 46 ms 1536 KB Output is correct
18 Correct 100 ms 3132 KB Output is correct
19 Correct 53 ms 1488 KB Output is correct
20 Correct 48 ms 1528 KB Output is correct
21 Correct 46 ms 1528 KB Output is correct
22 Correct 43 ms 1404 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 8 ms 888 KB Output is correct
26 Correct 9 ms 1016 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 8 ms 888 KB Output is correct
29 Correct 8 ms 760 KB Output is correct
30 Correct 41 ms 1388 KB Output is correct
31 Correct 44 ms 1440 KB Output is correct
32 Correct 62 ms 1888 KB Output is correct
33 Correct 43 ms 1400 KB Output is correct
34 Correct 43 ms 1400 KB Output is correct
35 Correct 43 ms 1528 KB Output is correct
36 Correct 108 ms 3320 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 41 ms 1400 KB Output is correct
40 Correct 44 ms 1500 KB Output is correct
41 Correct 41 ms 1400 KB Output is correct
42 Correct 41 ms 1272 KB Output is correct
43 Correct 40 ms 1416 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 10 ms 888 KB Output is correct
46 Correct 10 ms 932 KB Output is correct
47 Correct 10 ms 888 KB Output is correct
48 Correct 110 ms 3548 KB Output is correct
49 Correct 110 ms 3320 KB Output is correct
50 Correct 2 ms 380 KB Output is correct
51 Correct 76 ms 2552 KB Output is correct
52 Correct 39 ms 1272 KB Output is correct
53 Correct 41 ms 1412 KB Output is correct
54 Correct 8 ms 888 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 760 KB Output is correct
57 Correct 8 ms 888 KB Output is correct
58 Correct 2 ms 380 KB Output is correct
59 Correct 7 ms 760 KB Output is correct
60 Correct 8 ms 888 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 8 ms 888 KB Output is correct