oj.uz

Submission #709291

# Submission time Handle Problem Language Result Execution time Memory
709291 2023-03-13T10:33:27 Z awu Discharging (NOI20_discharging) C++14
58 / 100
 315 ms 179640 KB 
#include <bits/extc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#define int long long
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define debug(x) do{auto y = x; cout << #x << " = " << y << endl;}while(0)
// #define endl "\n"
#define unordered_map __gnu_pbds::gp_hash_table
using pii = pair<int, int>;

const int inf = 1ll << 60;
const int MOD = 1e9 + 7;

int fastlog2(int x) {
  return 63 - __builtin_clzll(x);
}

struct sparsetable {
  vector<vector<int>> t;
  sparsetable() {}
  sparsetable(vector<int>& a) {
    int n = a.size();
    t.resize(fastlog2(n) + 1, vector<int>(n));
    t[0] = a;
    for(int i = 1; i <= fastlog2(n); i++) {
      for(int j = 0; j + (1 << i) <= n; j++) {
        t[i][j] = max(t[i - 1][j], t[i - 1][j + (1 << (i - 1))]);
      }
    }
  }
  int query(int ql, int qr) {
    int lg = fastlog2(qr - ql);
    return max(t[lg][ql], t[lg][qr - (1 << lg)]);
  }
};
int n;
sparsetable st;

int eval(pii f, int x) {
  if(x >= f.f) return inf - x;
  return (n - x) * st.query(x, f.f) + f.s;
}

struct lichao {
  int tl, tr;
  pii f;
  lichao *lc, *rc;
  void insert(pii f2) {
    int tm = (tl + tr) / 2;
    if(eval(f2, tm) < eval(f, tm)) swap(f, f2);
    if(tl + 1 == tr) return;
    if(eval(f2, tl) <= eval(f, tl)) {
      if(!lc) {
        lc = new lichao{tl, tm, f2};
      } else {
        lc->insert(f2);
      }
    } else if(eval(f2, tr - 1) <= eval(f, tr - 1)) {
      if(!rc) {
        rc = new lichao{tm, tr, f2};
      } else {
        rc->insert(f2);
      }
    }
  }
  int query(int x) {
    int tm = (tl + tr) / 2;
    int res = eval(f, x);
    if(x < tm && lc) return min(res, lc->query(x));
    if(x >= tm && rc) return min(res, rc->query(x));
    return res;
  }
};

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  vector<int> t(n);
  for(int i = 0; i < n; i++) {
    cin >> t[i];
  }
  st = sparsetable(t);
  vector<int> dp(n);
  lichao lct{0, n, {n, 0}};
  for(int i = n - 1; i >= 0; i--) {
    dp[i] = lct.query(i);
    lct.insert({i, dp[i]});
  }
  cout << dp[0] << endl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 472 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 472 KB Output is correct
16 Correct 269 ms 177692 KB Output is correct
17 Correct 306 ms 178616 KB Output is correct
18 Correct 254 ms 177068 KB Output is correct
19 Correct 288 ms 178616 KB Output is correct
20 Correct 273 ms 178360 KB Output is correct
21 Correct 302 ms 178492 KB Output is correct
22 Correct 282 ms 177996 KB Output is correct
23 Correct 279 ms 179000 KB Output is correct
24 Correct 313 ms 178496 KB Output is correct
25 Correct 292 ms 178932 KB Output is correct
26 Correct 315 ms 179640 KB Output is correct
27 Correct 295 ms 177700 KB Output is correct
28 Correct 283 ms 178556 KB Output is correct
29 Correct 284 ms 178784 KB Output is correct
30 Correct 315 ms 178928 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 172604 KB Output is correct
2 Correct 206 ms 172500 KB Output is correct
3 Correct 212 ms 172504 KB Output is correct
4 Correct 206 ms 172500 KB Output is correct
5 Correct 227 ms 172588 KB Output is correct
6 Correct 237 ms 172496 KB Output is correct
7 Correct 219 ms 172604 KB Output is correct
8 Correct 201 ms 172508 KB Output is correct
9 Correct 218 ms 172492 KB Output is correct
10 Correct 215 ms 172508 KB Output is correct

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 456 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 472 KB Output is correct
30 Incorrect 1 ms 468 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #6
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 456 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 472 KB Output is correct
30 Correct 269 ms 177692 KB Output is correct
31 Correct 306 ms 178616 KB Output is correct
32 Correct 254 ms 177068 KB Output is correct
33 Correct 288 ms 178616 KB Output is correct
34 Correct 273 ms 178360 KB Output is correct
35 Correct 302 ms 178492 KB Output is correct
36 Correct 282 ms 177996 KB Output is correct
37 Correct 279 ms 179000 KB Output is correct
38 Correct 313 ms 178496 KB Output is correct
39 Correct 292 ms 178932 KB Output is correct
40 Correct 315 ms 179640 KB Output is correct
41 Correct 295 ms 177700 KB Output is correct
42 Correct 283 ms 178556 KB Output is correct
43 Correct 284 ms 178784 KB Output is correct
44 Correct 315 ms 178928 KB Output is correct
45 Correct 216 ms 172604 KB Output is correct
46 Correct 206 ms 172500 KB Output is correct
47 Correct 212 ms 172504 KB Output is correct
48 Correct 206 ms 172500 KB Output is correct
49 Correct 227 ms 172588 KB Output is correct
50 Correct 237 ms 172496 KB Output is correct
51 Correct 219 ms 172604 KB Output is correct
52 Correct 201 ms 172508 KB Output is correct
53 Correct 218 ms 172492 KB Output is correct
54 Correct 215 ms 172508 KB Output is correct
55 Incorrect 1 ms 468 KB Output isn't correct
56 Halted 0 ms 0 KB -