oj.uz

Submission #50747

# Submission time Handle Problem Language Result Execution time Memory
50747 2018-06-13T06:41:45 Z ayhcbagnop Travelling Merchant (APIO17_merchant) C++14
100 / 100
 126 ms 1676 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);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1400 KB Output is correct
2 Correct 47 ms 1500 KB Output is correct
3 Correct 45 ms 1500 KB Output is correct
4 Correct 12 ms 1500 KB Output is correct
5 Correct 9 ms 1500 KB Output is correct
6 Correct 9 ms 1500 KB Output is correct
7 Correct 13 ms 1500 KB Output is correct
8 Correct 2 ms 1500 KB Output is correct
9 Correct 8 ms 1500 KB Output is correct
10 Correct 8 ms 1500 KB Output is correct
11 Correct 7 ms 1500 KB Output is correct
12 Correct 2 ms 1500 KB Output is correct
13 Correct 10 ms 1500 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1632 KB Output is correct
2 Correct 109 ms 1676 KB Output is correct
3 Correct 50 ms 1676 KB Output is correct
4 Correct 50 ms 1676 KB Output is correct
5 Correct 52 ms 1676 KB Output is correct
6 Correct 53 ms 1676 KB Output is correct
7 Correct 12 ms 1500 KB Output is correct
8 Correct 2 ms 1500 KB Output is correct
9 Correct 11 ms 1500 KB Output is correct
10 Correct 10 ms 1500 KB Output is correct
11 Correct 11 ms 1500 KB Output is correct
12 Correct 9 ms 1500 KB Output is correct
13 Correct 7 ms 1500 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1500 KB Output is correct
2 Correct 8 ms 1500 KB Output is correct
3 Correct 10 ms 1500 KB Output is correct
4 Correct 8 ms 1500 KB Output is correct
5 Correct 10 ms 1500 KB Output is correct
6 Correct 2 ms 1500 KB Output is correct
7 Correct 12 ms 1500 KB Output is correct
8 Correct 8 ms 1500 KB Output is correct
9 Correct 9 ms 1500 KB Output is correct
10 Correct 12 ms 1500 KB Output is correct
11 Correct 14 ms 1500 KB Output is correct
12 Correct 13 ms 1500 KB Output is correct
13 Correct 10 ms 1500 KB Output is correct
14 Correct 9 ms 1500 KB Output is correct
15 Correct 14 ms 1500 KB Output is correct
16 Correct 12 ms 1500 KB Output is correct
17 Correct 56 ms 1632 KB Output is correct
18 Correct 109 ms 1676 KB Output is correct
19 Correct 50 ms 1676 KB Output is correct
20 Correct 50 ms 1676 KB Output is correct
21 Correct 52 ms 1676 KB Output is correct
22 Correct 53 ms 1676 KB Output is correct
23 Correct 12 ms 1500 KB Output is correct
24 Correct 2 ms 1500 KB Output is correct
25 Correct 11 ms 1500 KB Output is correct
26 Correct 10 ms 1500 KB Output is correct
27 Correct 11 ms 1500 KB Output is correct
28 Correct 9 ms 1500 KB Output is correct
29 Correct 7 ms 1500 KB Output is correct
30 Correct 44 ms 1676 KB Output is correct
31 Correct 92 ms 1676 KB Output is correct
32 Correct 124 ms 1676 KB Output is correct
33 Correct 76 ms 1676 KB Output is correct
34 Correct 46 ms 1676 KB Output is correct
35 Correct 83 ms 1676 KB Output is correct
36 Correct 107 ms 1676 KB Output is correct
37 Correct 2 ms 1676 KB Output is correct
38 Correct 2 ms 1676 KB Output is correct
39 Correct 45 ms 1676 KB Output is correct
40 Correct 54 ms 1676 KB Output is correct
41 Correct 46 ms 1676 KB Output is correct
42 Correct 45 ms 1676 KB Output is correct
43 Correct 56 ms 1676 KB Output is correct
44 Correct 3 ms 1676 KB Output is correct
45 Correct 12 ms 1676 KB Output is correct
46 Correct 12 ms 1676 KB Output is correct
47 Correct 13 ms 1676 KB Output is correct
48 Correct 117 ms 1676 KB Output is correct
49 Correct 126 ms 1676 KB Output is correct
50 Correct 2 ms 1676 KB Output is correct
51 Correct 82 ms 1400 KB Output is correct
52 Correct 47 ms 1500 KB Output is correct
53 Correct 45 ms 1500 KB Output is correct
54 Correct 12 ms 1500 KB Output is correct
55 Correct 9 ms 1500 KB Output is correct
56 Correct 9 ms 1500 KB Output is correct
57 Correct 13 ms 1500 KB Output is correct
58 Correct 2 ms 1500 KB Output is correct
59 Correct 8 ms 1500 KB Output is correct
60 Correct 8 ms 1500 KB Output is correct
61 Correct 7 ms 1500 KB Output is correct
62 Correct 2 ms 1500 KB Output is correct
63 Correct 10 ms 1500 KB Output is correct