oj.uz

답안 #500119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500119 2021-12-30T10:42:50 Z acm K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 300 ms 47092 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);
}
int n, m, a[200005], b[200005], c[18][200005], dp[105][200005];
vector<int> v;
int get(int l, int r) {
  int x = __lg(r - l + 1);
  return min(c[x][l], c[x][r - (1 << x) + 1]);
}
void kek(int k) {
  for (int i = 0; i <= __lg(n); i++)
    for (int j = 0; j + (1 << i) <= n; j++)
      c[i][j] =
          (!i ? dp[k - 1][j] : min(c[i - 1][j], c[i - 1][j + (1 << (i - 1))]));
  for (int i = k; i <= n; i++)
    dp[k][i] = min(get(max(k - 1, b[i]), i - 1) + a[i],
                   (k <= b[i] ? dp[k][b[i]] : (1 << 30)));
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    dp[1][i] = max(dp[1][i - 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[m][n];
  // 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 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 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
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 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 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 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 460 KB Output is correct
39 Correct 0 ms 588 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 332 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 1 ms 332 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 0 ms 460 KB Output is correct
53 Correct 1 ms 844 KB Output is correct
54 Correct 1 ms 844 KB Output is correct
55 Correct 1 ms 588 KB Output is correct
56 Correct 1 ms 844 KB Output is correct
57 Correct 1 ms 844 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 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
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 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 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 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 460 KB Output is correct
39 Correct 0 ms 588 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 332 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 1 ms 332 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 0 ms 460 KB Output is correct
53 Correct 1 ms 844 KB Output is correct
54 Correct 1 ms 844 KB Output is correct
55 Correct 1 ms 588 KB Output is correct
56 Correct 1 ms 844 KB Output is correct
57 Correct 1 ms 844 KB Output is correct
58 Correct 7 ms 1984 KB Output is correct
59 Correct 4 ms 844 KB Output is correct
60 Correct 11 ms 4492 KB Output is correct
61 Correct 85 ms 16864 KB Output is correct
62 Correct 300 ms 46808 KB Output is correct
63 Correct 16 ms 8524 KB Output is correct
64 Correct 130 ms 25076 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 1 ms 588 KB Output is correct
67 Correct 1 ms 588 KB Output is correct
68 Correct 1 ms 588 KB Output is correct
69 Correct 0 ms 332 KB Output is correct
70 Correct 1 ms 460 KB Output is correct
71 Correct 25 ms 5408 KB Output is correct
72 Correct 2 ms 972 KB Output is correct
73 Correct 6 ms 2012 KB Output is correct
74 Correct 4 ms 844 KB Output is correct
75 Correct 11 ms 4484 KB Output is correct
76 Correct 84 ms 16864 KB Output is correct
77 Correct 257 ms 46916 KB Output is correct
78 Correct 17 ms 8516 KB Output is correct
79 Correct 127 ms 25152 KB Output is correct
80 Correct 9 ms 1440 KB Output is correct
81 Correct 33 ms 11292 KB Output is correct
82 Correct 249 ms 46976 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 1 ms 460 KB Output is correct
85 Correct 20 ms 5452 KB Output is correct
86 Correct 2 ms 1100 KB Output is correct
87 Correct 6 ms 2124 KB Output is correct
88 Correct 4 ms 972 KB Output is correct
89 Correct 11 ms 4660 KB Output is correct
90 Correct 74 ms 16892 KB Output is correct
91 Correct 238 ms 47092 KB Output is correct
92 Correct 19 ms 8808 KB Output is correct
93 Correct 121 ms 25348 KB Output is correct
94 Correct 2 ms 972 KB Output is correct
95 Correct 22 ms 5420 KB Output is correct
96 Correct 1 ms 460 KB Output is correct
97 Correct 0 ms 344 KB Output is correct
98 Correct 0 ms 332 KB Output is correct
99 Correct 1 ms 332 KB Output is correct