oj.uz

Submission #200345

# Submission time Handle Problem Language Result Execution time Memory
200345 2020-02-06T11:31:05 Z BThero Travelling Merchant (APIO17_merchant) C++17
100 / 100
 134 ms 1528 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
                                                  
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
 
#define pb push_back
#define mp make_pair
 
#define all(x) (x).begin(), (x).end()
 
#define fi first
#define se second
 
using namespace std;
//using namespace __gnu_pbds;
 
typedef long long ll;   
typedef pair<int, int> pii;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
const int MAXN = (int)1e2 + 5;
const int MAXK = (int)1e3 + 5;
const ll LINF = (ll)1e17;
 
int buy[MAXN][MAXK], sell[MAXN][MAXK];

ll dist[MAXN][MAXN], mx[MAXN][MAXN];
 
int adj[MAXN][MAXN];

ll dp[MAXN][2], ans;
 
ll D[MAXN][MAXN];

int n, m, k;
 
bool check(int x) {
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (dist[i][j] == LINF) {
                D[i][j] = LINF;
            }
            else {
                D[i][j] = dist[i][j] * 1ll * x - mx[i][j];
            }
        }

        D[i][i] = LINF;
    }

    for (int k = 1; k <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
            } 
        }
    }

    for (int i = 1; i <= n; ++i) {
        if (D[i][i] <= 0) {
            return 1;
        }
    }                                     
 
    return 0; 
}
 
void solve() {
    scanf("%d %d %d", &n, &m, &k);
 
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= k; ++j) {
            scanf("%d %d", &buy[i][j], &sell[i][j]);
        }
    }
 
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            adj[i][j] = -1;
            dist[i][j] = LINF;
        }

        dist[i][i] = 0;
    }
 
    for (int i = 1; i <= m; ++i) {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        adj[u][v] = 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) {
            mx[i][j] = 0;

            for (int ii = 1; ii <= k; ++ii) {
                if (buy[i][ii] != -1 && sell[j][ii] != -1) {
                    mx[i][j] = max(mx[i][j], (ll)sell[j][ii] - buy[i][ii]);
                }
            }
        }
    }    

    int l = 1, r = (int)1e9, ans = 0;

    while (l <= r) {
        int mid = (l + r) >> 1;

        if (check(mid)) {
            l = mid + 1;
            ans = mid;
        }
        else {
            r = mid - 1;
        }
    }
 
    printf("%d\n", ans);
}
 
int main() {
    int tt = 1;
 
    while (tt--) {
        solve();
    }
 
    return 0;
}

Compilation message

merchant.cpp: In function 'void solve()':
merchant.cpp:71: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:75:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d", &buy[i][j], &sell[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:90:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &u, &v, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 1400 KB Output is correct
2 Correct 50 ms 1448 KB Output is correct
3 Correct 44 ms 1400 KB Output is correct
4 Correct 13 ms 888 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 10 ms 888 KB Output is correct
7 Correct 13 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 11 ms 888 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 11 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1400 KB Output is correct
2 Correct 113 ms 1400 KB Output is correct
3 Correct 48 ms 1400 KB Output is correct
4 Correct 50 ms 1400 KB Output is correct
5 Correct 51 ms 1404 KB Output is correct
6 Correct 50 ms 1528 KB Output is correct
7 Correct 14 ms 888 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 21 ms 888 KB Output is correct
10 Correct 12 ms 888 KB Output is correct
11 Correct 14 ms 892 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 11 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 892 KB Output is correct
2 Correct 11 ms 936 KB Output is correct
3 Correct 11 ms 888 KB Output is correct
4 Correct 10 ms 888 KB Output is correct
5 Correct 11 ms 888 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 10 ms 888 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 10 ms 892 KB Output is correct
11 Correct 12 ms 888 KB Output is correct
12 Correct 12 ms 888 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 10 ms 888 KB Output is correct
15 Correct 15 ms 888 KB Output is correct
16 Correct 14 ms 888 KB Output is correct
17 Correct 50 ms 1400 KB Output is correct
18 Correct 113 ms 1400 KB Output is correct
19 Correct 48 ms 1400 KB Output is correct
20 Correct 50 ms 1400 KB Output is correct
21 Correct 51 ms 1404 KB Output is correct
22 Correct 50 ms 1528 KB Output is correct
23 Correct 14 ms 888 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 21 ms 888 KB Output is correct
26 Correct 12 ms 888 KB Output is correct
27 Correct 14 ms 892 KB Output is correct
28 Correct 11 ms 888 KB Output is correct
29 Correct 11 ms 888 KB Output is correct
30 Correct 47 ms 1400 KB Output is correct
31 Correct 51 ms 1476 KB Output is correct
32 Correct 90 ms 1400 KB Output is correct
33 Correct 61 ms 1404 KB Output is correct
34 Correct 61 ms 1400 KB Output is correct
35 Correct 49 ms 1400 KB Output is correct
36 Correct 122 ms 1400 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 70 ms 1528 KB Output is correct
40 Correct 58 ms 1400 KB Output is correct
41 Correct 50 ms 1452 KB Output is correct
42 Correct 60 ms 1452 KB Output is correct
43 Correct 46 ms 1456 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 14 ms 888 KB Output is correct
46 Correct 14 ms 888 KB Output is correct
47 Correct 13 ms 888 KB Output is correct
48 Correct 130 ms 1400 KB Output is correct
49 Correct 134 ms 1376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 83 ms 1400 KB Output is correct
52 Correct 50 ms 1448 KB Output is correct
53 Correct 44 ms 1400 KB Output is correct
54 Correct 13 ms 888 KB Output is correct
55 Correct 10 ms 888 KB Output is correct
56 Correct 10 ms 888 KB Output is correct
57 Correct 13 ms 888 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 10 ms 888 KB Output is correct
60 Correct 11 ms 888 KB Output is correct
61 Correct 10 ms 888 KB Output is correct
62 Correct 6 ms 376 KB Output is correct
63 Correct 11 ms 888 KB Output is correct