oj.uz

Submission #369450

# Submission time Handle Problem Language Result Execution time Memory
369450 2021-02-21T17:10:39 Z Vladth11 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 161 ms 4352 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "
//#include "shoes.h"
 
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <ll, pii> piii;
typedef tree <pii, null_type, less <pii>, rb_tree_tag, tree_order_statistics_node_update> OST;
 
const ll NMAX = 101;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 316;
const ll nr_of_bits = 35;
const long double eps = 0.0000000000000001;
 
double d[NMAX];
 
struct Edges {
    ll a, b;
    ll c;
};
 
ll dp[NMAX][NMAX];
ll dist[NMAX][NMAX];
ll profit[NMAX][NMAX];
ll n, m, k;
ll b[NMAX][1001], s[NMAX][1001];
 
bool OK(ll r) {
    for(ll i = 1; i <= n; i++) {
        for(ll j = 1; j <= n; j++) {
            if(i == j){
                dp[i][j] = INF;
                continue;
            }
			if(dist[i][j] == INF){
              dp[i][j] = INF;
                continue;
			}
            dp[i][j] = r * dist[i][j] - profit[i][j];
        }
    }
    ll ok = 1;
    for(ll t = 1; t <= n; t++) {
        for(ll i = 1; i <= n; i++) {
            for(ll j = 1; j <= n; j++) {
                if(dp[i][t] == INF || dp[t][j] == INF)
                continue;
                dp[i][j] = min(dp[i][j], dp[i][t] + dp[t][j]);
            }
        }
    }
   for(ll i = 1; i <= n; i++){
        if(dp[i][i] <= 0)
            return 1;
   }
    return 0;
}
 
int main() {
    ll i;
    cin >> n >> m >> k;
    for(i = 1; i <= n; i++) {
        for(ll j = 1; j <= k; j++) {
            cin >> b[i][j] >> s[i][j];
        }
    }
    for(i = 1; i <= n; i++) {
        for(ll j = 1; j <= n; j++) {
            ll maxim = 0;
            dist[i][j] = INF;
            for(ll t = 1; t <= k; t++) {
                if(s[j][t] != -1 && b[i][t] != -1)
                maxim = max(maxim, s[j][t] - b[i][t]);
            }
            profit[i][j] = maxim;
        }
    }
    for(i = 1; i <= m; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        dist[a][b] = c;
    }
    for(ll t = 1; t <= n; t++) {
        for(i = 1; i <= n; i++) {
            for(ll j = 1; j <= n; j++) {
                if(dist[i][t] == INF || dist[t][j] == INF)
                continue;
                dist[i][j] = min(dist[i][j], dist[i][t] + dist[t][j]);
            }
        }
    }
    ll r = 0, pas = (1LL << 30);
    while(pas){
        if(OK(r + pas))
        r += pas;
        pas /= 2;
    }
    cout << r;
    return 0;
}

Compilation message

merchant.cpp: In function 'bool OK(ll)':
merchant.cpp:49:8: warning: unused variable 'ok' [-Wunused-variable]
   49 |     ll ok = 1;
      |        ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 2156 KB Output is correct
2 Correct 55 ms 1388 KB Output is correct
3 Correct 55 ms 1388 KB Output is correct
4 Correct 8 ms 876 KB Output is correct
5 Correct 8 ms 876 KB Output is correct
6 Correct 12 ms 876 KB Output is correct
7 Correct 10 ms 876 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 8 ms 876 KB Output is correct
10 Correct 9 ms 876 KB Output is correct
11 Correct 8 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 10 ms 876 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 876 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 11 ms 876 KB Output is correct
5 Correct 15 ms 876 KB Output is correct
6 Correct 12 ms 876 KB Output is correct
7 Correct 9 ms 876 KB Output is correct
8 Correct 64 ms 1516 KB Output is correct
9 Correct 138 ms 2156 KB Output is correct
10 Correct 59 ms 1388 KB Output is correct
11 Correct 65 ms 1644 KB Output is correct
12 Correct 65 ms 1516 KB Output is correct
13 Correct 60 ms 1388 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 876 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 10 ms 1004 KB Output is correct
4 Correct 10 ms 1004 KB Output is correct
5 Correct 10 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 9 ms 876 KB Output is correct
8 Correct 9 ms 896 KB Output is correct
9 Correct 9 ms 876 KB Output is correct
10 Correct 9 ms 876 KB Output is correct
11 Correct 11 ms 876 KB Output is correct
12 Correct 11 ms 876 KB Output is correct
13 Correct 12 ms 876 KB Output is correct
14 Correct 11 ms 1004 KB Output is correct
15 Correct 11 ms 876 KB Output is correct
16 Correct 8 ms 876 KB Output is correct
17 Correct 64 ms 1516 KB Output is correct
18 Correct 138 ms 2156 KB Output is correct
19 Correct 59 ms 1388 KB Output is correct
20 Correct 65 ms 1644 KB Output is correct
21 Correct 65 ms 1516 KB Output is correct
22 Correct 60 ms 1388 KB Output is correct
23 Correct 10 ms 876 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 11 ms 876 KB Output is correct
27 Correct 15 ms 876 KB Output is correct
28 Correct 12 ms 876 KB Output is correct
29 Correct 9 ms 876 KB Output is correct
30 Correct 126 ms 2156 KB Output is correct
31 Correct 55 ms 1388 KB Output is correct
32 Correct 55 ms 1388 KB Output is correct
33 Correct 8 ms 876 KB Output is correct
34 Correct 8 ms 876 KB Output is correct
35 Correct 12 ms 876 KB Output is correct
36 Correct 10 ms 876 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 8 ms 876 KB Output is correct
39 Correct 9 ms 876 KB Output is correct
40 Correct 8 ms 876 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 10 ms 876 KB Output is correct
43 Correct 56 ms 1388 KB Output is correct
44 Correct 61 ms 1644 KB Output is correct
45 Correct 97 ms 2668 KB Output is correct
46 Correct 79 ms 1516 KB Output is correct
47 Correct 64 ms 1644 KB Output is correct
48 Correct 62 ms 1644 KB Output is correct
49 Correct 147 ms 4332 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 57 ms 1388 KB Output is correct
53 Correct 64 ms 1516 KB Output is correct
54 Correct 68 ms 1516 KB Output is correct
55 Correct 81 ms 1516 KB Output is correct
56 Correct 66 ms 1516 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 13 ms 1004 KB Output is correct
59 Correct 13 ms 1004 KB Output is correct
60 Correct 13 ms 1004 KB Output is correct
61 Correct 155 ms 4204 KB Output is correct
62 Correct 161 ms 4352 KB Output is correct
63 Correct 1 ms 364 KB Output is correct