oj.uz

Submission #913988

# Submission time Handle Problem Language Result Execution time Memory
913988 2024-01-20T17:01:50 Z perohero Travelling Merchant (APIO17_merchant) C++17
100 / 100
 65 ms 3712 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int NMAX = 100 + 7;
const int KMAX = 1228;
const ll inf = 1e18;
 
int n, m, k;
int buy[NMAX][KMAX], sell[NMAX][KMAX];
ll dist[NMAX][NMAX], profit[NMAX][NMAX];
ll dp[NMAX][NMAX];
 
bool check(ll e) { 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                dp[i][j] = 0;
            } else if (dist[i][j] <= inf / e) {
                dp[i][j] = profit[i][j] - (ll) dist[i][j] * e;
            } else {
                dp[i][j] = -inf;
            }
        }
    }
    for (int p = 1; p <= n; p++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = max(dp[i][j], dp[i][p] + dp[p][j]);
                if (dp[i][j] > inf) {
                    return true;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i != j && dp[i][j] + dp[j][i] >= 0) {
                return true;
            }
        }
    }
    return false;
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	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++) {
            if (i == j) {
                dist[i][j] = 0;
            } else {
                dist[i][j] = inf;
            }
        }
    }
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        dist[x][y] = c;
    }
    for (int p = 1; p <= n; p++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dist[i][j] = min(dist[i][j], dist[i][p] + dist[p][j]);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int item = 1; item <= k; item++) {
                if (sell[j][item] != -1 && buy[i][item] != -1) {
                    profit[i][j] = max(profit[i][j], (ll) sell[j][item] - buy[i][item]);
                }
            }
        }
    }
    int ans = 0;
    for (int jump = (1 << 29); jump > 0; jump >>= 1) {
        if (check(ans + jump)) {
            ans += jump;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 1368 KB Output is correct
2 Correct 36 ms 1372 KB Output is correct
3 Correct 28 ms 1368 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 5 ms 856 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 5 ms 856 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 856 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 856 KB Output is correct
4 Correct 6 ms 860 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 5 ms 856 KB Output is correct
8 Correct 38 ms 1372 KB Output is correct
9 Correct 58 ms 1564 KB Output is correct
10 Correct 39 ms 1548 KB Output is correct
11 Correct 38 ms 1372 KB Output is correct
12 Correct 37 ms 1368 KB Output is correct
13 Correct 36 ms 1372 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 5 ms 992 KB Output is correct
3 Correct 5 ms 860 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 6 ms 912 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 5 ms 856 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 5 ms 924 KB Output is correct
13 Correct 5 ms 1116 KB Output is correct
14 Correct 5 ms 860 KB Output is correct
15 Correct 6 ms 860 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 38 ms 1372 KB Output is correct
18 Correct 58 ms 1564 KB Output is correct
19 Correct 39 ms 1548 KB Output is correct
20 Correct 38 ms 1372 KB Output is correct
21 Correct 37 ms 1368 KB Output is correct
22 Correct 36 ms 1372 KB Output is correct
23 Correct 5 ms 856 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 6 ms 856 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 5 ms 856 KB Output is correct
28 Correct 5 ms 860 KB Output is correct
29 Correct 5 ms 856 KB Output is correct
30 Correct 59 ms 1368 KB Output is correct
31 Correct 36 ms 1372 KB Output is correct
32 Correct 28 ms 1368 KB Output is correct
33 Correct 5 ms 860 KB Output is correct
34 Correct 5 ms 856 KB Output is correct
35 Correct 6 ms 860 KB Output is correct
36 Correct 5 ms 856 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 5 ms 860 KB Output is correct
40 Correct 5 ms 860 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 5 ms 856 KB Output is correct
43 Correct 34 ms 1372 KB Output is correct
44 Correct 34 ms 1596 KB Output is correct
45 Correct 50 ms 2160 KB Output is correct
46 Correct 35 ms 1628 KB Output is correct
47 Correct 42 ms 1628 KB Output is correct
48 Correct 35 ms 1624 KB Output is correct
49 Correct 65 ms 3568 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 35 ms 1368 KB Output is correct
53 Correct 38 ms 1372 KB Output is correct
54 Correct 36 ms 1372 KB Output is correct
55 Correct 42 ms 1372 KB Output is correct
56 Correct 41 ms 1480 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 8 ms 1116 KB Output is correct
59 Correct 6 ms 1112 KB Output is correct
60 Correct 6 ms 1112 KB Output is correct
61 Correct 64 ms 3672 KB Output is correct
62 Correct 62 ms 3712 KB Output is correct
63 Correct 1 ms 344 KB Output is correct