oj.uz

답안 #709327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709327 2023-03-13T11:40:46 Z awu Discharging (NOI20_discharging) C++14
72 / 100
 1000 ms 180052 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;
  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);
      }
    }
    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];
  }
  for(int i = 1; i < n; i++) {
    t[i] = max(t[i], t[i - 1]);
  }
  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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 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 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 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 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 348 ms 172668 KB Output is correct
17 Correct 732 ms 173384 KB Output is correct
18 Correct 468 ms 172856 KB Output is correct
19 Correct 524 ms 176320 KB Output is correct
20 Correct 429 ms 172912 KB Output is correct
21 Correct 540 ms 174276 KB Output is correct
22 Correct 453 ms 173176 KB Output is correct
23 Correct 427 ms 172660 KB Output is correct
24 Correct 751 ms 176824 KB Output is correct
25 Correct 401 ms 173216 KB Output is correct
26 Correct 581 ms 175512 KB Output is correct
27 Correct 519 ms 174180 KB Output is correct
28 Correct 507 ms 174644 KB Output is correct
29 Correct 393 ms 172616 KB Output is correct
30 Correct 474 ms 172656 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 206 ms 172496 KB Output is correct
2 Correct 233 ms 172700 KB Output is correct
3 Correct 220 ms 172620 KB Output is correct
4 Correct 211 ms 172604 KB Output is correct
5 Correct 218 ms 172704 KB Output is correct
6 Correct 253 ms 172676 KB Output is correct
7 Correct 251 ms 172704 KB Output is correct
8 Correct 235 ms 172616 KB Output is correct
9 Correct 259 ms 172620 KB Output is correct
10 Correct 273 ms 172596 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 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 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 468 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 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 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 348 ms 172668 KB Output is correct
31 Correct 732 ms 173384 KB Output is correct
32 Correct 468 ms 172856 KB Output is correct
33 Correct 524 ms 176320 KB Output is correct
34 Correct 429 ms 172912 KB Output is correct
35 Correct 540 ms 174276 KB Output is correct
36 Correct 453 ms 173176 KB Output is correct
37 Correct 427 ms 172660 KB Output is correct
38 Correct 751 ms 176824 KB Output is correct
39 Correct 401 ms 173216 KB Output is correct
40 Correct 581 ms 175512 KB Output is correct
41 Correct 519 ms 174180 KB Output is correct
42 Correct 507 ms 174644 KB Output is correct
43 Correct 393 ms 172616 KB Output is correct
44 Correct 474 ms 172656 KB Output is correct
45 Correct 206 ms 172496 KB Output is correct
46 Correct 233 ms 172700 KB Output is correct
47 Correct 220 ms 172620 KB Output is correct
48 Correct 211 ms 172604 KB Output is correct
49 Correct 218 ms 172704 KB Output is correct
50 Correct 253 ms 172676 KB Output is correct
51 Correct 251 ms 172704 KB Output is correct
52 Correct 235 ms 172616 KB Output is correct
53 Correct 259 ms 172620 KB Output is correct
54 Correct 273 ms 172596 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 1 ms 468 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 1 ms 468 KB Output is correct
71 Correct 1 ms 468 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 1 ms 468 KB Output is correct
74 Correct 1 ms 468 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Execution timed out 1069 ms 180052 KB Time limit exceeded
77 Halted 0 ms 0 KB -