oj.uz

Submission #404219

# Submission time Handle Problem Language Result Execution time Memory
404219 2021-05-14T00:52:37 Z wiwiho Travelling Merchant (APIO17_merchant) C++14
100 / 100
 112 ms 4216 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int n, m, K;

vector<vector<ll>> gv, gt;

bool check(ll x){

    vector<vector<ll>> dis(n + 1, vector<ll>(n + 1, 1LL << 60));

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(gt[i][j] != -1) dis[i][j] = -gv[i][j] + gt[i][j] * x;
        }
    }

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

//    cerr << "test " << x << "\n";
//    for(int i =1 ; i <= n; i++) printv(dis[i], cerr);

    ll ans = 1LL << 60;
    for(int i = 1; i <= n; i++) ans = min(ans, dis[i][i]);

    return ans <= 0;
}

int main(){
    StarBurstStream

    cin >> n >> m >> K;
    vector<vector<ll>> buy(n + 1, vector<ll>(K + 1));
    vector<vector<ll>> sell(n + 1, vector<ll>(K + 1));
    gv.resize(n + 1, vector<ll>(n + 1));
    gt.resize(n + 1, vector<ll>(n + 1, MAX));

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= K; j++){
            cin >> buy[i][j] >> sell[i][j];
        }
    }

    for(int i = 0; i < m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        gt[u][v] = w;
    }

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

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(gt[i][j] == MAX) continue;
            for(int k = 1; k <= K; k++){
                if(buy[i][k] == -1 || sell[j][k] == -1) continue;
                gv[i][j] = max(gv[i][j], sell[j][k] - buy[i][k]);
            }
        }
    }

//    for(int i = 1; i <= n; i++) printv(gv[i], cerr);

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

    cout << l << "\n";

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 3320 KB Output is correct
2 Correct 35 ms 460 KB Output is correct
3 Correct 36 ms 460 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 6 ms 332 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 7 ms 428 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 6 ms 396 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 7 ms 436 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 7 ms 428 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 6 ms 332 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 7 ms 436 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 8 ms 332 KB Output is correct
13 Correct 7 ms 460 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 6 ms 408 KB Output is correct
18 Correct 6 ms 428 KB Output is correct
19 Correct 7 ms 460 KB Output is correct
20 Correct 7 ms 452 KB Output is correct
21 Correct 6 ms 408 KB Output is correct
22 Correct 6 ms 332 KB Output is correct
23 Correct 8 ms 492 KB Output is correct
24 Correct 6 ms 332 KB Output is correct
25 Correct 7 ms 456 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 7 ms 460 KB Output is correct
28 Correct 7 ms 476 KB Output is correct
29 Correct 10 ms 460 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 8 ms 460 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 456 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 7 ms 476 KB Output is correct
5 Correct 10 ms 460 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 8 ms 460 KB Output is correct
8 Correct 44 ms 844 KB Output is correct
9 Correct 93 ms 3660 KB Output is correct
10 Correct 39 ms 716 KB Output is correct
11 Correct 43 ms 920 KB Output is correct
12 Correct 43 ms 844 KB Output is correct
13 Correct 39 ms 708 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 6 ms 332 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 8 ms 332 KB Output is correct
5 Correct 7 ms 460 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 6 ms 332 KB Output is correct
9 Correct 6 ms 408 KB Output is correct
10 Correct 6 ms 428 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 7 ms 452 KB Output is correct
13 Correct 6 ms 408 KB Output is correct
14 Correct 6 ms 332 KB Output is correct
15 Correct 8 ms 492 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 44 ms 844 KB Output is correct
18 Correct 93 ms 3660 KB Output is correct
19 Correct 39 ms 716 KB Output is correct
20 Correct 43 ms 920 KB Output is correct
21 Correct 43 ms 844 KB Output is correct
22 Correct 39 ms 708 KB Output is correct
23 Correct 7 ms 456 KB Output is correct
24 Correct 1 ms 308 KB Output is correct
25 Correct 7 ms 460 KB Output is correct
26 Correct 7 ms 476 KB Output is correct
27 Correct 10 ms 460 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 8 ms 460 KB Output is correct
30 Correct 69 ms 3320 KB Output is correct
31 Correct 35 ms 460 KB Output is correct
32 Correct 36 ms 460 KB Output is correct
33 Correct 6 ms 332 KB Output is correct
34 Correct 6 ms 332 KB Output is correct
35 Correct 6 ms 332 KB Output is correct
36 Correct 7 ms 428 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 6 ms 332 KB Output is correct
39 Correct 6 ms 332 KB Output is correct
40 Correct 6 ms 396 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 7 ms 436 KB Output is correct
43 Correct 37 ms 596 KB Output is correct
44 Correct 40 ms 716 KB Output is correct
45 Correct 60 ms 2240 KB Output is correct
46 Correct 40 ms 708 KB Output is correct
47 Correct 43 ms 716 KB Output is correct
48 Correct 40 ms 716 KB Output is correct
49 Correct 101 ms 4004 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 40 ms 588 KB Output is correct
53 Correct 39 ms 636 KB Output is correct
54 Correct 38 ms 588 KB Output is correct
55 Correct 38 ms 616 KB Output is correct
56 Correct 42 ms 588 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 8 ms 460 KB Output is correct
59 Correct 8 ms 568 KB Output is correct
60 Correct 8 ms 564 KB Output is correct
61 Correct 112 ms 4216 KB Output is correct
62 Correct 104 ms 4084 KB Output is correct
63 Correct 1 ms 204 KB Output is correct