oj.uz

Submission #743961

# Submission time Handle Problem Language Result Execution time Memory
743961 2023-05-18T06:45:10 Z becaido Travelling Merchant (APIO17_merchant) C++17
100 / 100
 94 ms 3460 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int INF = 2e9;
const int SIZE = 105;
const int KSIZ = 1005;

int n, m, k;
vector<pair<int, int>> adj[SIZE];
int a[SIZE][KSIZ], b[SIZE][KSIZ];
int dis[SIZE][SIZE], profit[SIZE][SIZE];
ll dp[SIZE][SIZE];

bool ok(int p) {
    if (p == 0) return 1;
    FOR (i, 1, n) FOR (j, 1, n) {
        if (i == j) dp[i][j] = -INF;
        else dp[i][j] = profit[i][j] - 1ll * dis[i][j] * p;
    }
    FOR (k, 1, n) FOR (i, 1, n) FOR (j, 1, n) dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
    FOR (i, 1, n) if (dp[i][i] >= 0) return 1;
    return 0;
}

void solve() {
    cin >> n >> m >> k;
    FOR (i, 1, n) FOR (j, 1, k) cin >> a[i][j] >> b[i][j];
    while (m--) {
        int a, b, w;
        cin >> a >> b >> w;
        adj[a].pb(b, w);
    }
    FOR (i, 1, n) {
        fill(dis[i] + 1, dis[i] + n + 1, INF);
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
        pq.emplace(dis[i][i] = 0, i);
        while (pq.size()) {
            auto [d, pos] = pq.top();
            pq.pop();
            if (d > dis[i][pos]) continue;
            for (auto [np, w] : adj[pos]) if (d + w < dis[i][np]) pq.emplace(dis[i][np] = d + w, np);
        }
    }
    FOR (i, 1, n) FOR (j, 1, n) if (i != j) {
        int mx = 0;
        FOR (x, 1, k) if (a[i][x] != -1 && b[j][x] != -1 && a[i][x] < b[j][x]) mx = max(mx, b[j][x] - a[i][x]);
        profit[i][j] = mx;
    }
    int l = 0, r = 1e9;
    while (l < r) {
        int mid = (l + r) / 2 + 1;
        if (ok(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l << '\n';
}

int main() {
    Waimai;
    solve();
}
/*
in1
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
out1
2
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2608 KB Output is correct
2 Correct 29 ms 1236 KB Output is correct
3 Correct 29 ms 1228 KB Output is correct
4 Correct 5 ms 720 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 724 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 37 ms 1344 KB Output is correct
9 Correct 94 ms 3056 KB Output is correct
10 Correct 32 ms 1364 KB Output is correct
11 Correct 31 ms 1492 KB Output is correct
12 Correct 35 ms 1500 KB Output is correct
13 Correct 30 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 724 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 6 ms 728 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 6 ms 856 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 5 ms 764 KB Output is correct
14 Correct 5 ms 732 KB Output is correct
15 Correct 5 ms 864 KB Output is correct
16 Correct 7 ms 724 KB Output is correct
17 Correct 37 ms 1344 KB Output is correct
18 Correct 94 ms 3056 KB Output is correct
19 Correct 32 ms 1364 KB Output is correct
20 Correct 31 ms 1492 KB Output is correct
21 Correct 35 ms 1500 KB Output is correct
22 Correct 30 ms 1364 KB Output is correct
23 Correct 6 ms 724 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 5 ms 856 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 4 ms 724 KB Output is correct
30 Correct 57 ms 2608 KB Output is correct
31 Correct 29 ms 1236 KB Output is correct
32 Correct 29 ms 1228 KB Output is correct
33 Correct 5 ms 720 KB Output is correct
34 Correct 4 ms 724 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 5 ms 724 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 4 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 724 KB Output is correct
43 Correct 27 ms 1236 KB Output is correct
44 Correct 33 ms 1264 KB Output is correct
45 Correct 50 ms 1764 KB Output is correct
46 Correct 40 ms 1236 KB Output is correct
47 Correct 32 ms 1384 KB Output is correct
48 Correct 31 ms 1364 KB Output is correct
49 Correct 54 ms 3148 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 32 ms 1236 KB Output is correct
53 Correct 36 ms 1492 KB Output is correct
54 Correct 30 ms 1236 KB Output is correct
55 Correct 30 ms 1240 KB Output is correct
56 Correct 34 ms 1240 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 6 ms 836 KB Output is correct
59 Correct 7 ms 856 KB Output is correct
60 Correct 5 ms 852 KB Output is correct
61 Correct 73 ms 3460 KB Output is correct
62 Correct 70 ms 3372 KB Output is correct
63 Correct 1 ms 336 KB Output is correct