oj.uz

Submission #136534

# Submission time Handle Problem Language Result Execution time Memory
136534 2019-07-25T12:34:53 Z Milki Travelling Merchant (APIO17_merchant) C++14
100 / 100
 106 ms 4280 KB 
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 105, MAXK = 1e3 + 5;
const ll inf = 1e9;

ll n, m, items;
ll dist[MAXN][MAXN];
ll buy[MAXN][MAXK], sell[MAXN][MAXK], profit[MAXN][MAXN];

bool check(ll x){
  ll d[MAXN][MAXN];
  REP(i, n) REP(j, n)
    d[i][j] = -1e13;

  REP(i, n) REP(j, n)
    d[i][j] = max(d[i][j], profit[i][j] - dist[i][j] * x);

  REP(k, n) REP(i, n) REP(j, n)
    d[i][j] = max(d[i][j], d[i][k] + d[k][j]);

  REP(i, n)
    if(d[i][i] >= 0)
      return true;
  return false;
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);

  REP(i, MAXN) REP(j, MAXN) dist[i][j] = inf;

  cin >> n >> m >> items;
  REP(i, n) REP(j, items){ cin >> buy[i][j] >> sell[i][j]; }
  REP(i, m){
    ll a, b, c; cin >> a >> b >> c;
    a --; b --;
    dist[a][b] = min(dist[a][b], c);
  }

  REP(k, n) REP(i, n) REP(j, n)
    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);

  REP(i, n) REP(j, n) REP(k, items)
    if(buy[i][k] != -1 && sell[j][k] != -1)
      profit[i][j] = max(profit[i][j], sell[j][k] - buy[i][k]);

  ll lo = 0, hi = 1e9;
  while(lo < hi){
    ll mid = (lo + hi + 1) >> 1;
    if(check(mid))
      lo = mid;
    else
      hi = mid - 1;
  }
  cout << lo;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 2040 KB Output is correct
2 Correct 41 ms 1272 KB Output is correct
3 Correct 43 ms 1272 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 8 ms 888 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 9 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1528 KB Output is correct
2 Correct 98 ms 2120 KB Output is correct
3 Correct 45 ms 1400 KB Output is correct
4 Correct 49 ms 1528 KB Output is correct
5 Correct 49 ms 1528 KB Output is correct
6 Correct 45 ms 1528 KB Output is correct
7 Correct 9 ms 892 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 10 ms 1016 KB Output is correct
11 Correct 9 ms 892 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 11 ms 1016 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 10 ms 1016 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 9 ms 1016 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 1016 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 1016 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 888 KB Output is correct
15 Correct 10 ms 888 KB Output is correct
16 Correct 8 ms 888 KB Output is correct
17 Correct 50 ms 1528 KB Output is correct
18 Correct 98 ms 2120 KB Output is correct
19 Correct 45 ms 1400 KB Output is correct
20 Correct 49 ms 1528 KB Output is correct
21 Correct 49 ms 1528 KB Output is correct
22 Correct 45 ms 1528 KB Output is correct
23 Correct 9 ms 892 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 10 ms 1016 KB Output is correct
27 Correct 9 ms 892 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 44 ms 1512 KB Output is correct
31 Correct 47 ms 1656 KB Output is correct
32 Correct 66 ms 2808 KB Output is correct
33 Correct 46 ms 1656 KB Output is correct
34 Correct 47 ms 1716 KB Output is correct
35 Correct 46 ms 1640 KB Output is correct
36 Correct 103 ms 4088 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 44 ms 1400 KB Output is correct
40 Correct 46 ms 1528 KB Output is correct
41 Correct 45 ms 1528 KB Output is correct
42 Correct 44 ms 1528 KB Output is correct
43 Correct 44 ms 1400 KB Output is correct
44 Correct 2 ms 504 KB Output is correct
45 Correct 11 ms 1016 KB Output is correct
46 Correct 11 ms 1016 KB Output is correct
47 Correct 11 ms 1144 KB Output is correct
48 Correct 106 ms 4188 KB Output is correct
49 Correct 105 ms 4280 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 73 ms 2040 KB Output is correct
52 Correct 41 ms 1272 KB Output is correct
53 Correct 43 ms 1272 KB Output is correct
54 Correct 8 ms 888 KB Output is correct
55 Correct 9 ms 888 KB Output is correct
56 Correct 8 ms 888 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 504 KB Output is correct
59 Correct 8 ms 888 KB Output is correct
60 Correct 8 ms 888 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 9 ms 888 KB Output is correct