oj.uz

답안 #500111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500111 2021-12-30T10:35:34 Z acm K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 546 ms 97580 KB 
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
ll n, m, a[200005], b[200005], c[18][200005], dp[200005][105];
vector<ll> v;
ll get(ll l, ll r, ll x) {
  l = max(l, x);
  ll y = __lg(r - l + 1);
  return min(c[y][l], c[y][r - (1 << y) + 1]);
}
void kek(ll k) {
  for (int i = 0; i <= __lg(n); i++)
    for (int j = 0; j + (1 << i) <= n; j++)
      c[i][j] =
          (!i ? dp[j][k - 1] : min(c[i - 1][j], c[i - 1][j + (1 << (i - 1))]));
  for (int i = 0; i < k; i++) dp[i][k] = (1LL << 60);
  for (int i = k; i <= n; i++)
    dp[i][k] = min(get(b[i], i - 1, k - 1) + a[i], dp[b[i]][k]);
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    dp[i][1] = max(dp[i - 1][1], a[i]);
    while (sz(v) && a[v.back()] < a[i]) v.pop_back();
    b[i] = (sz(v) ? v.back() : 0);
    v.pb(i);
  }
  for (int i = 2; i <= m; i++) kek(i);
  cout << dp[n][m];
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

blocks.cpp: In function 'void ioi(std::string)':
blocks.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 460 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 460 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 460 KB Output is correct
52 Correct 0 ms 460 KB Output is correct
53 Correct 1 ms 460 KB Output is correct
54 Correct 0 ms 460 KB Output is correct
55 Correct 0 ms 460 KB Output is correct
56 Correct 1 ms 460 KB Output is correct
57 Correct 1 ms 460 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 460 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 460 KB Output is correct
52 Correct 0 ms 460 KB Output is correct
53 Correct 1 ms 460 KB Output is correct
54 Correct 0 ms 460 KB Output is correct
55 Correct 0 ms 460 KB Output is correct
56 Correct 1 ms 460 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 10 ms 9676 KB Output is correct
59 Correct 18 ms 37452 KB Output is correct
60 Correct 32 ms 42692 KB Output is correct
61 Correct 143 ms 42632 KB Output is correct
62 Correct 509 ms 96444 KB Output is correct
63 Correct 52 ms 97092 KB Output is correct
64 Correct 239 ms 97128 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 1 ms 460 KB Output is correct
67 Correct 1 ms 460 KB Output is correct
68 Correct 1 ms 460 KB Output is correct
69 Correct 1 ms 1100 KB Output is correct
70 Correct 1 ms 1228 KB Output is correct
71 Correct 30 ms 9804 KB Output is correct
72 Correct 5 ms 9804 KB Output is correct
73 Correct 10 ms 9804 KB Output is correct
74 Correct 18 ms 37828 KB Output is correct
75 Correct 32 ms 43004 KB Output is correct
76 Correct 145 ms 42992 KB Output is correct
77 Correct 546 ms 97116 KB Output is correct
78 Correct 51 ms 97096 KB Output is correct
79 Correct 291 ms 97116 KB Output is correct
80 Correct 39 ms 84716 KB Output is correct
81 Correct 84 ms 97132 KB Output is correct
82 Correct 539 ms 97200 KB Output is correct
83 Correct 1 ms 1100 KB Output is correct
84 Correct 1 ms 1228 KB Output is correct
85 Correct 28 ms 9932 KB Output is correct
86 Correct 6 ms 9936 KB Output is correct
87 Correct 10 ms 9948 KB Output is correct
88 Correct 21 ms 38132 KB Output is correct
89 Correct 41 ms 43220 KB Output is correct
90 Correct 137 ms 43324 KB Output is correct
91 Correct 529 ms 97508 KB Output is correct
92 Correct 56 ms 97528 KB Output is correct
93 Correct 239 ms 97580 KB Output is correct
94 Correct 5 ms 9804 KB Output is correct
95 Correct 29 ms 9792 KB Output is correct
96 Correct 1 ms 1220 KB Output is correct
97 Correct 1 ms 1100 KB Output is correct
98 Correct 1 ms 332 KB Output is correct
99 Correct 0 ms 332 KB Output is correct