oj.uz

Submission #349737

# Submission time Handle Problem Language Result Execution time Memory
349737 2021-01-18T09:45:04 Z TAMREF Travelling Merchant (APIO17_merchant) C++17
100 / 100
 101 ms 4204 KB 
#include <bits/stdc++.h>
#define va first
#define vb second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define pp push_back
#define ep emplace_back
#define all(v) (v).begin(),(v).end()
#define szz(v) ((int)(v).size())
#define bi_pc __builtin_popcount
#define bi_pcll __builtin_popcountll
#define bi_tz __builtin_ctz
#define bi_tzll __builtin_ctzll
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef TAMREF
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long; using lf = long double; 
using pii = pair<int,int>; using ppi = pair<int,pii>;
using pll = pair<ll,ll>; using pff = pair<lf,lf>;
using ti = tuple<int,int,int>;
using base = complex<double>;
const lf PI = 3.14159265358979323846264338L;
template <typename T>
inline T umax(T& u, T v){return u = max(u, v);}
template <typename T>
inline T umin(T& u, T v){return u = min(u, v);}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, k;
const ll inf = 1e15;
ll sp[105][105], rv[105][105];
ll tsp[105][105];
vector<ll> B[105], S[105];

pll operator+ (pll u, const pll v){
    return pll(u.va + v.va, u.vb + v.vb);
}

bool pro(ll x){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(i == j || sp[i][j] > 1e9 + 10){
                tsp[i][j] = 1e18;
                continue;
            }
            tsp[i][j] = sp[i][j] * x - rv[i][j];
        }
    }
    for(int t = 1; t <= n; t++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                tsp[i][j] = min(tsp[i][j], tsp[i][t] + tsp[t][j]);
            }
        }
    }
    debug("-------tsp------x = %lld----\n",x);
    for(int i = 1; i <= n; i++){
        for(int j =1 ; j <= n; j++){
            debug("%lld ",tsp[i][j]);
        }
        debug("\n");
    }
    for(int i = 1; i <= n; i++) if(tsp[i][i] <= 0) return true;
    return false;
}

int main(){
    fio;
    cin >> n >> m >> k; 
    for(int i = 1; i <= n; i++){
        fill(sp[i] + 1, sp[i] + n + 1, inf);
        sp[i][i] = 0;
        B[i] = vector<ll>(k + 1);
        S[i] = vector<ll>(k + 1);
        for(int j = 1; j <= k; j++){
            cin >> B[i][j] >> S[i][j];
        }
    }
    for(ll i = 1, a, b, w; i <= m; i++){
        cin >> a >> b >> w;
        sp[a][b] = min(w, sp[a][b]);
    }
    for(int k = 1; k <= n; k++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                sp[i][j] = min(sp[i][j], sp[i][k] + sp[k][j]);
            }
        }
    }
    debug("-------sp----------\n");
    for(int i = 1; i <= n; i++){
        for(int j =1 ; j <= n; j++){
            debug("%lld ",sp[i][j]);
        }
        debug("\n");
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            for(int t = 0; t <= k; t++){
                if(B[i][t] == -1 || S[j][t] == -1) continue;
                rv[i][j] = max(rv[i][j], S[j][t] - B[i][t]);
            }
        }
    }
    ll lo = 0, mi, hi = 1e9 + 5;
    while(lo < hi){
        mi = (lo + hi + 1) >> 1;
        if(pro(mi)) lo = mi;
        else hi = mi - 1;
    }
    cout << lo << '\n';
}

Compilation message

merchant.cpp: In function 'bool pro(ll)':
merchant.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
merchant.cpp:61:5: note: in expansion of macro 'debug'
   61 |     debug("-------tsp------x = %lld----\n",x);
      |     ^~~~~
merchant.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
merchant.cpp:64:13: note: in expansion of macro 'debug'
   64 |             debug("%lld ",tsp[i][j]);
      |             ^~~~~
merchant.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
merchant.cpp:66:9: note: in expansion of macro 'debug'
   66 |         debug("\n");
      |         ^~~~~
merchant.cpp: In function 'int main()':
merchant.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
merchant.cpp:95:5: note: in expansion of macro 'debug'
   95 |     debug("-------sp----------\n");
      |     ^~~~~
merchant.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
merchant.cpp:98:13: note: in expansion of macro 'debug'
   98 |             debug("%lld ",sp[i][j]);
      |             ^~~~~
merchant.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
merchant.cpp:100:9: note: in expansion of macro 'debug'
  100 |         debug("\n");
      |         ^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 2156 KB Output is correct
2 Correct 39 ms 620 KB Output is correct
3 Correct 37 ms 748 KB Output is correct
4 Correct 6 ms 492 KB Output is correct
5 Correct 6 ms 492 KB Output is correct
6 Correct 9 ms 492 KB Output is correct
7 Correct 7 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 6 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 6 ms 492 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 748 KB Output is correct
2 Correct 91 ms 2028 KB Output is correct
3 Correct 39 ms 620 KB Output is correct
4 Correct 43 ms 1004 KB Output is correct
5 Correct 45 ms 1132 KB Output is correct
6 Correct 45 ms 768 KB Output is correct
7 Correct 7 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 620 KB Output is correct
10 Correct 9 ms 620 KB Output is correct
11 Correct 9 ms 620 KB Output is correct
12 Correct 8 ms 492 KB Output is correct
13 Correct 6 ms 492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 492 KB Output is correct
2 Correct 6 ms 620 KB Output is correct
3 Correct 6 ms 492 KB Output is correct
4 Correct 9 ms 620 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 6 ms 492 KB Output is correct
8 Correct 6 ms 492 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 9 ms 620 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 9 ms 620 KB Output is correct
16 Correct 7 ms 492 KB Output is correct
17 Correct 42 ms 748 KB Output is correct
18 Correct 91 ms 2028 KB Output is correct
19 Correct 39 ms 620 KB Output is correct
20 Correct 43 ms 1004 KB Output is correct
21 Correct 45 ms 1132 KB Output is correct
22 Correct 45 ms 768 KB Output is correct
23 Correct 7 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 7 ms 620 KB Output is correct
26 Correct 9 ms 620 KB Output is correct
27 Correct 9 ms 620 KB Output is correct
28 Correct 8 ms 492 KB Output is correct
29 Correct 6 ms 492 KB Output is correct
30 Correct 37 ms 620 KB Output is correct
31 Correct 40 ms 876 KB Output is correct
32 Correct 59 ms 2284 KB Output is correct
33 Correct 39 ms 876 KB Output is correct
34 Correct 40 ms 876 KB Output is correct
35 Correct 40 ms 876 KB Output is correct
36 Correct 98 ms 4076 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 37 ms 620 KB Output is correct
40 Correct 39 ms 748 KB Output is correct
41 Correct 38 ms 764 KB Output is correct
42 Correct 38 ms 620 KB Output is correct
43 Correct 37 ms 620 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 8 ms 620 KB Output is correct
46 Correct 8 ms 620 KB Output is correct
47 Correct 8 ms 620 KB Output is correct
48 Correct 101 ms 4204 KB Output is correct
49 Correct 100 ms 4204 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 66 ms 2156 KB Output is correct
52 Correct 39 ms 620 KB Output is correct
53 Correct 37 ms 748 KB Output is correct
54 Correct 6 ms 492 KB Output is correct
55 Correct 6 ms 492 KB Output is correct
56 Correct 9 ms 492 KB Output is correct
57 Correct 7 ms 492 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 6 ms 492 KB Output is correct
60 Correct 6 ms 492 KB Output is correct
61 Correct 6 ms 492 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 6 ms 492 KB Output is correct