oj.uz

Submission #246029

# Submission time Handle Problem Language Result Execution time Memory
246029 2020-07-08T03:49:02 Z WhaleVomit Travelling Merchant (APIO17_merchant) C++14
100 / 100
 727 ms 22200 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
 
#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)
 
#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<
 
template<class T> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}
 
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;
 
template<int SZ> struct dijkstra {
    vector<pair<int, ll>> adj[SZ];
    bool vis[SZ];
    ll d[SZ];
 
    void addEdge(int u, int v, ll l) {
        adj[u].pb(mp(v, l));
    }
    ll dist(int v) {
        return d[v];
    }
    void build(int u) {
        M00(i, SZ) vis[i] = 0;
        M00(i, SZ) d[i] = 1e17;
        d[u] = 0;
        while(1) {
            pair<ll, int> t = mp(1e17, -1);
            M00(i, SZ) if(!vis[i]) ckmin(t, mp(d[i], i));
            if(t.s == -1 || vis[t.s]) return;
            vis[t.s] = 1;
 
            for(auto& v: adj[t.s]) if(!vis[v.f]) {
                ckmin(d[v.f], d[t.s] + v.s);
            }
        }
    }
};
 
const int MAX_N = 110;
const int MAX_K = 1010;
int n, m, k;
ll buy[MAX_N][MAX_K];
ll sell[MAX_N][MAX_K];
ll dist[MAX_N][MAX_N];
ll profit[MAX_N][MAX_N];
pair<ll,ll> dp[MAX_N][MAX_N][MAX_N]; // dp[u][v][s] : max efficiency u -> v, using s steps
dijkstra<MAX_N> dijk;
 
bool better(pair<ll,ll> p1, pair<ll,ll> p2) { // is p1 better efficiency?
    // p1.f / p1.s > p2.f / p2.s
    ld p1f = p1.f; ld p1s = p1.s;
    ld p2f = p2.f; ld p2s = p2.s;
    return p1f/p1s > p2f/p2s;
}
 
pair<ll,ll> sum(pair<ll,ll> p1, pair<ll,ll> p2) {
    return mp(p1.f + p2.f, p1.s + p2.s);
}
 
int main() { FAST
    cin >> n >> m >> k;
    M00(i, n) M00(j, k) cin >> buy[i][j] >> sell[i][j];
    M00(i, m) {
        int u, v; ll d;
        cin >> u >> v >> d;
        u--; v--;
        dijk.addEdge(u, v, d);
    }
    M00(i, n) {
        dijk.build(i);
        M00(j, n) {
            dist[i][j] = dijk.dist(j);
            ll val = 0;
            M00(ii, k) if(buy[i][ii] != -1 && sell[j][ii] != -1) ckmax(val, -buy[i][ii]+sell[j][ii]);
            if(i != j) profit[i][j] = val;
        }
    }
    M00(i, n) {
        M00(a, n) M00(b, n) dp[i][a][b] = mp(-1e17, 1);
        dp[i][i][0] = mp(0, 0);
        MOO(s, 1, n) {
            M00(j, n) {
                M00(p, n) if(p != j && dp[i][p][s-1].f != -1e17 && dist[p][j] != 1e17) {
                    pair<ll,ll> cand = sum(dp[i][p][s-1], mp(profit[p][j], dist[p][j]));
                    if(better(cand, dp[i][j][s])) dp[i][j][s] = cand;
                }
            }
        }
    }
    pair<ll,ll> res = mp(-1e17, 1);
    M00(i, n) {
        M00(j, n) if(j != i && dist[j][i] != 1e17) {
            M00(s, n) if(dp[i][j][s].f != -1e17) {
                pair<ll,ll> cand = sum(dp[i][j][s], mp(profit[j][i], dist[j][i]));
                if(better(cand, res)) {
                    res = cand;
                }
            }
        }
    }
    cout << max(0LL,res.f/res.s) << "\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 642 ms 19704 KB Output is correct
2 Correct 579 ms 18936 KB Output is correct
3 Correct 613 ms 19076 KB Output is correct
4 Correct 47 ms 5368 KB Output is correct
5 Correct 44 ms 5244 KB Output is correct
6 Correct 35 ms 5368 KB Output is correct
7 Correct 50 ms 5368 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 46 ms 5368 KB Output is correct
10 Correct 48 ms 5432 KB Output is correct
11 Correct 47 ms 5368 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 25 ms 5376 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 5368 KB Output is correct
2 Correct 47 ms 5368 KB Output is correct
3 Correct 50 ms 5376 KB Output is correct
4 Correct 45 ms 4984 KB Output is correct
5 Correct 50 ms 5368 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 21 ms 5376 KB Output is correct
8 Correct 30 ms 5376 KB Output is correct
9 Correct 20 ms 5376 KB Output is correct
10 Correct 27 ms 5376 KB Output is correct
11 Correct 51 ms 5408 KB Output is correct
12 Correct 32 ms 5368 KB Output is correct
13 Correct 44 ms 5496 KB Output is correct
14 Correct 48 ms 5368 KB Output is correct
15 Correct 48 ms 5368 KB Output is correct
16 Correct 46 ms 5368 KB Output is correct
17 Correct 50 ms 5368 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 45 ms 5368 KB Output is correct
20 Correct 50 ms 5372 KB Output is correct
21 Correct 33 ms 5368 KB Output is correct
22 Correct 47 ms 5372 KB Output is correct
23 Correct 30 ms 5368 KB Output is correct
24 Correct 35 ms 5368 KB Output is correct
25 Correct 50 ms 5368 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 46 ms 5368 KB Output is correct
28 Correct 48 ms 5432 KB Output is correct
29 Correct 47 ms 5368 KB Output is correct
30 Correct 5 ms 640 KB Output is correct
31 Correct 25 ms 5376 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 646 ms 19040 KB Output is correct
2 Correct 692 ms 19832 KB Output is correct
3 Correct 662 ms 19132 KB Output is correct
4 Correct 601 ms 19064 KB Output is correct
5 Correct 587 ms 19348 KB Output is correct
6 Correct 646 ms 19192 KB Output is correct
7 Correct 50 ms 5368 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 45 ms 5368 KB Output is correct
10 Correct 50 ms 5372 KB Output is correct
11 Correct 33 ms 5368 KB Output is correct
12 Correct 47 ms 5372 KB Output is correct
13 Correct 30 ms 5368 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 5368 KB Output is correct
2 Correct 47 ms 5368 KB Output is correct
3 Correct 50 ms 5376 KB Output is correct
4 Correct 45 ms 4984 KB Output is correct
5 Correct 50 ms 5368 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 21 ms 5376 KB Output is correct
8 Correct 30 ms 5376 KB Output is correct
9 Correct 20 ms 5376 KB Output is correct
10 Correct 27 ms 5376 KB Output is correct
11 Correct 51 ms 5408 KB Output is correct
12 Correct 32 ms 5368 KB Output is correct
13 Correct 44 ms 5496 KB Output is correct
14 Correct 48 ms 5368 KB Output is correct
15 Correct 48 ms 5368 KB Output is correct
16 Correct 46 ms 5368 KB Output is correct
17 Correct 646 ms 19040 KB Output is correct
18 Correct 692 ms 19832 KB Output is correct
19 Correct 662 ms 19132 KB Output is correct
20 Correct 601 ms 19064 KB Output is correct
21 Correct 587 ms 19348 KB Output is correct
22 Correct 646 ms 19192 KB Output is correct
23 Correct 50 ms 5368 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 45 ms 5368 KB Output is correct
26 Correct 50 ms 5372 KB Output is correct
27 Correct 33 ms 5368 KB Output is correct
28 Correct 47 ms 5372 KB Output is correct
29 Correct 30 ms 5368 KB Output is correct
30 Correct 628 ms 19192 KB Output is correct
31 Correct 636 ms 19320 KB Output is correct
32 Correct 674 ms 20052 KB Output is correct
33 Correct 656 ms 19132 KB Output is correct
34 Correct 665 ms 19256 KB Output is correct
35 Correct 646 ms 19320 KB Output is correct
36 Correct 694 ms 21752 KB Output is correct
37 Correct 5 ms 640 KB Output is correct
38 Correct 5 ms 640 KB Output is correct
39 Correct 594 ms 18936 KB Output is correct
40 Correct 603 ms 19320 KB Output is correct
41 Correct 380 ms 19064 KB Output is correct
42 Correct 532 ms 19144 KB Output is correct
43 Correct 636 ms 19064 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 38 ms 5504 KB Output is correct
46 Correct 34 ms 5496 KB Output is correct
47 Correct 27 ms 5624 KB Output is correct
48 Correct 693 ms 22008 KB Output is correct
49 Correct 727 ms 22200 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 642 ms 19704 KB Output is correct
52 Correct 579 ms 18936 KB Output is correct
53 Correct 613 ms 19076 KB Output is correct
54 Correct 47 ms 5368 KB Output is correct
55 Correct 44 ms 5244 KB Output is correct
56 Correct 35 ms 5368 KB Output is correct
57 Correct 50 ms 5368 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 46 ms 5368 KB Output is correct
60 Correct 48 ms 5432 KB Output is correct
61 Correct 47 ms 5368 KB Output is correct
62 Correct 5 ms 640 KB Output is correct
63 Correct 25 ms 5376 KB Output is correct