oj.uz

Submission #887822

# Submission time Handle Problem Language Result Execution time Memory
887822 2023-12-15T09:23:17 Z Shayan86 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 67 ms 4624 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 107;
const ll K = 1007;
const ll inf = 1e9 + 7;

ll n, m, k, b[N][K], s[N][K], dist[N][N], prof[N][N], res[N][N];

vector<pll> adj[N];

void floyd(){
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) dist[i][j] = (i == j ? 0 : inf);
    for(int i = 1; i <= n; i++) for(auto [j, w]: adj[i]) dist[i][j] = w;

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

void floyd2(){
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) res[i][j] = inf;
    for(int i = 1; i <= n; i++) for(auto [j, w]: adj[i]) res[i][j] = w;

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

bool check(ll mid){
    for(int i = 1; i <= n; i++) adj[i].clear();
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(i != j) adj[i].pb({j, (inf / dist[i][j] < mid ? 1e18 : mid * dist[i][j] - prof[i][j])});
        }
    }
    floyd2();

    ll mn = 1;
    for(int i = 1; i <= n; i++) mn = min(mn, res[i][i]);
    return (mn <= 0);
}

int main(){
    fast_io;

    cin >> n >> m >> k;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= k; j++){
            cin >> b[i][j] >> s[i][j];
        }
    }

    int u, v, w;
    for(int i = 1; i <= m; i++){
        cin >> u >> v >> w;
        adj[u].pb({v, w});
    }

    floyd();

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            for(int kk = 1; kk <= k; kk++){
                if(min(s[j][kk], b[i][kk]) != -1) prof[i][j] = max(prof[i][j], s[j][kk] - b[i][kk]);
            }
        }
    }

    ll l = 0, r = inf;
    while(r-l > 1){
        ll mid = (l+r)/2;
        if(check(mid)) l = mid;
        else r = mid;
    }

    cout << l;

}

Compilation message

merchant.cpp: In function 'void floyd()':
merchant.cpp:36:42: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   36 |     for(int i = 1; i <= n; i++) for(auto [j, w]: adj[i]) dist[i][j] = w;
      |                                          ^
merchant.cpp: In function 'void floyd2()':
merchant.cpp:49:42: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   49 |     for(int i = 1; i <= n; i++) for(auto [j, w]: adj[i]) res[i][j] = w;
      |                                          ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3676 KB Output is correct
2 Correct 35 ms 1880 KB Output is correct
3 Correct 29 ms 2036 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 6 ms 972 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 6 ms 856 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 6 ms 1036 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 6 ms 980 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 6 ms 1036 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 5 ms 1100 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 6 ms 1116 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 5 ms 1016 KB Output is correct
16 Correct 6 ms 1116 KB Output is correct
17 Correct 6 ms 860 KB Output is correct
18 Correct 6 ms 860 KB Output is correct
19 Correct 6 ms 1116 KB Output is correct
20 Correct 5 ms 1112 KB Output is correct
21 Correct 7 ms 856 KB Output is correct
22 Correct 6 ms 1268 KB Output is correct
23 Correct 7 ms 1116 KB Output is correct
24 Correct 6 ms 1124 KB Output is correct
25 Correct 6 ms 1128 KB Output is correct
26 Correct 1 ms 608 KB Output is correct
27 Correct 6 ms 1128 KB Output is correct
28 Correct 7 ms 1524 KB Output is correct
29 Correct 5 ms 1124 KB Output is correct
30 Correct 6 ms 868 KB Output is correct
31 Correct 5 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1128 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 6 ms 1128 KB Output is correct
4 Correct 7 ms 1524 KB Output is correct
5 Correct 5 ms 1124 KB Output is correct
6 Correct 6 ms 868 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 35 ms 1884 KB Output is correct
9 Correct 60 ms 4160 KB Output is correct
10 Correct 31 ms 2140 KB Output is correct
11 Correct 36 ms 2100 KB Output is correct
12 Correct 34 ms 2096 KB Output is correct
13 Correct 33 ms 1716 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1100 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 6 ms 1112 KB Output is correct
4 Correct 6 ms 1116 KB Output is correct
5 Correct 6 ms 1116 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 6 ms 1116 KB Output is correct
12 Correct 5 ms 1112 KB Output is correct
13 Correct 7 ms 856 KB Output is correct
14 Correct 6 ms 1268 KB Output is correct
15 Correct 7 ms 1116 KB Output is correct
16 Correct 6 ms 1124 KB Output is correct
17 Correct 35 ms 1884 KB Output is correct
18 Correct 60 ms 4160 KB Output is correct
19 Correct 31 ms 2140 KB Output is correct
20 Correct 36 ms 2100 KB Output is correct
21 Correct 34 ms 2096 KB Output is correct
22 Correct 33 ms 1716 KB Output is correct
23 Correct 6 ms 1128 KB Output is correct
24 Correct 1 ms 608 KB Output is correct
25 Correct 6 ms 1128 KB Output is correct
26 Correct 7 ms 1524 KB Output is correct
27 Correct 5 ms 1124 KB Output is correct
28 Correct 6 ms 868 KB Output is correct
29 Correct 5 ms 860 KB Output is correct
30 Correct 64 ms 3676 KB Output is correct
31 Correct 35 ms 1880 KB Output is correct
32 Correct 29 ms 2036 KB Output is correct
33 Correct 4 ms 856 KB Output is correct
34 Correct 6 ms 972 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 6 ms 860 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 6 ms 856 KB Output is correct
39 Correct 5 ms 860 KB Output is correct
40 Correct 6 ms 1036 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 6 ms 980 KB Output is correct
43 Correct 33 ms 1756 KB Output is correct
44 Correct 35 ms 1956 KB Output is correct
45 Correct 47 ms 2984 KB Output is correct
46 Correct 36 ms 1884 KB Output is correct
47 Correct 35 ms 1884 KB Output is correct
48 Correct 33 ms 1980 KB Output is correct
49 Correct 58 ms 4400 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 36 ms 1736 KB Output is correct
53 Correct 31 ms 1884 KB Output is correct
54 Correct 30 ms 1820 KB Output is correct
55 Correct 31 ms 1884 KB Output is correct
56 Correct 36 ms 1792 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 7 ms 1364 KB Output is correct
59 Correct 7 ms 1244 KB Output is correct
60 Correct 7 ms 1372 KB Output is correct
61 Correct 65 ms 4624 KB Output is correct
62 Correct 67 ms 4604 KB Output is correct
63 Correct 0 ms 344 KB Output is correct