oj.uz

Submission #392242

# Submission time Handle Problem Language Result Execution time Memory
392242 2021-04-20T17:21:32 Z MarcoMeijer Travelling Merchant (APIO17_merchant) C++14
100 / 100
 104 ms 5368 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1010;
const int N = (1<<20);

int n, m, k;
ll B[MX][MX], S[MX][MX];
ll dist[MX][MX];
ll profit[MX][MX];
ll dist2[MX][MX];

bool possible(ll w) {
    RE(u,n) RE(v,n) dist2[u][v] = max<ll>(-1e18, profit[u][v] - dist[u][v]*w);
    RE(u,n) dist2[u][u] = -1e18;
    RE(i,n) RE(u,n) RE(v,n) dist2[u][v] = max(dist2[u][v], dist2[u][i] + dist2[i][v]);
    RE(u,n) if(dist2[u][u] >= 0) return true;
    return false;
}

void program() {
    IN(n,m,k);

    // fill profit
    RE(i,n) RE(j,k) IN(B[i][j], S[i][j]);
    RE(u,n) RE(v,n) profit[u][v] = 0;
    RE(u,n) RE(v,n) RE(i,k) if(S[v][i] != -1 && B[u][i] != -1) profit[u][v] = max(profit[u][v], S[v][i] - B[u][i]);
    
    // fill dist
    RE(i,n) RE(j,n) dist[i][j] = INF;
    RE(i,n) dist[i][i] = 0;
    RE(i,m) {
        ll u, v, w; IN(u,v,w); u--; v--;
        dist[u][v] = w;
    }
    RE(i,n) RE(u,n) RE(v,n) dist[u][v] = min(dist[u][v], dist[u][i] + dist[i][v]);

    // binary search
    ll lb=0, ub=0;
    RE(u,n) RE(v,n) ub = max(ub, profit[u][v]);
    while(lb != ub) {
        ll mid=(lb+ub+1)/2;
        if(possible(mid)) lb=mid;
        else ub=mid-1;
    }
    OUTL(lb);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 3272 KB Output is correct
2 Correct 43 ms 2572 KB Output is correct
3 Correct 40 ms 2508 KB Output is correct
4 Correct 6 ms 1356 KB Output is correct
5 Correct 6 ms 1400 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 6 ms 1356 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 1396 KB Output is correct
10 Correct 6 ms 1356 KB Output is correct
11 Correct 6 ms 1396 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 6 ms 1356 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 6 ms 1356 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 1396 KB Output is correct
5 Correct 6 ms 1356 KB Output is correct
6 Correct 6 ms 1396 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 6 ms 1356 KB Output is correct
9 Correct 4 ms 1356 KB Output is correct
10 Correct 7 ms 1408 KB Output is correct
11 Correct 4 ms 1356 KB Output is correct
12 Correct 4 ms 1356 KB Output is correct
13 Correct 6 ms 1440 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 3 ms 1356 KB Output is correct
16 Correct 4 ms 1436 KB Output is correct
17 Correct 6 ms 1416 KB Output is correct
18 Correct 6 ms 1356 KB Output is correct
19 Correct 7 ms 1356 KB Output is correct
20 Correct 7 ms 1356 KB Output is correct
21 Correct 6 ms 1356 KB Output is correct
22 Correct 6 ms 1356 KB Output is correct
23 Correct 7 ms 1436 KB Output is correct
24 Correct 6 ms 1400 KB Output is correct
25 Correct 5 ms 1432 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 7 ms 1356 KB Output is correct
28 Correct 8 ms 1356 KB Output is correct
29 Correct 7 ms 1356 KB Output is correct
30 Correct 7 ms 1312 KB Output is correct
31 Correct 6 ms 1408 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1432 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 1356 KB Output is correct
4 Correct 8 ms 1356 KB Output is correct
5 Correct 7 ms 1356 KB Output is correct
6 Correct 7 ms 1312 KB Output is correct
7 Correct 6 ms 1408 KB Output is correct
8 Correct 32 ms 2708 KB Output is correct
9 Correct 99 ms 3248 KB Output is correct
10 Correct 41 ms 2636 KB Output is correct
11 Correct 48 ms 2712 KB Output is correct
12 Correct 47 ms 2716 KB Output is correct
13 Correct 43 ms 2636 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1356 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 4 ms 1356 KB Output is correct
4 Correct 4 ms 1356 KB Output is correct
5 Correct 6 ms 1440 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 3 ms 1356 KB Output is correct
8 Correct 4 ms 1436 KB Output is correct
9 Correct 6 ms 1416 KB Output is correct
10 Correct 6 ms 1356 KB Output is correct
11 Correct 7 ms 1356 KB Output is correct
12 Correct 7 ms 1356 KB Output is correct
13 Correct 6 ms 1356 KB Output is correct
14 Correct 6 ms 1356 KB Output is correct
15 Correct 7 ms 1436 KB Output is correct
16 Correct 6 ms 1400 KB Output is correct
17 Correct 32 ms 2708 KB Output is correct
18 Correct 99 ms 3248 KB Output is correct
19 Correct 41 ms 2636 KB Output is correct
20 Correct 48 ms 2712 KB Output is correct
21 Correct 47 ms 2716 KB Output is correct
22 Correct 43 ms 2636 KB Output is correct
23 Correct 5 ms 1432 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 7 ms 1356 KB Output is correct
26 Correct 8 ms 1356 KB Output is correct
27 Correct 7 ms 1356 KB Output is correct
28 Correct 7 ms 1312 KB Output is correct
29 Correct 6 ms 1408 KB Output is correct
30 Correct 63 ms 3272 KB Output is correct
31 Correct 43 ms 2572 KB Output is correct
32 Correct 40 ms 2508 KB Output is correct
33 Correct 6 ms 1356 KB Output is correct
34 Correct 6 ms 1400 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 6 ms 1356 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 1396 KB Output is correct
39 Correct 6 ms 1356 KB Output is correct
40 Correct 6 ms 1396 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 6 ms 1356 KB Output is correct
43 Correct 35 ms 2620 KB Output is correct
44 Correct 38 ms 2764 KB Output is correct
45 Correct 61 ms 3828 KB Output is correct
46 Correct 42 ms 2764 KB Output is correct
47 Correct 46 ms 2764 KB Output is correct
48 Correct 42 ms 2800 KB Output is correct
49 Correct 104 ms 5220 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 33 ms 2508 KB Output is correct
53 Correct 35 ms 2636 KB Output is correct
54 Correct 17 ms 2676 KB Output is correct
55 Correct 40 ms 2636 KB Output is correct
56 Correct 41 ms 2508 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 8 ms 1484 KB Output is correct
59 Correct 8 ms 1484 KB Output is correct
60 Correct 8 ms 1580 KB Output is correct
61 Correct 98 ms 5368 KB Output is correct
62 Correct 97 ms 5300 KB Output is correct
63 Correct 1 ms 332 KB Output is correct