oj.uz

답안 #1040447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040447 2024-08-01T04:22:07 Z vjudge1 K개의 묶음 (IZhO14_blocks) C++17
100 / 100
 93 ms 3160 KB 
#include <bits/stdc++.h>
#ifdef LOCAL
#include <bits/debug.hpp>
#endif // LOCAL

#define ll long long
#define all(x) x.begin(), x.end()
#define Neco "K blocks"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 1e5 + 7

using namespace std;

const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;

int n, k;
int a[maxn];
pair<int, ll> q[maxn];
ll dp[2][maxn];

void solve()
{

    cin >> n >> k;
    fi(i, 1, n) cin >> a[i];


    int pre = 0, cur = 1;

    memset(dp, 60, sizeof dp);
    dp[0][0] = 0;

    fi(t, 1, k) {
        int top = 0;
        dp[cur][0] = 1e9;

        fi(i, 1, n)
        {
            dp[cur][i] = 1e9;

            ll Min = dp[pre][i - 1];
            while(top && a[i] >= a[q[top].first]) {
                Min = min(q[top].second, Min);
                --top;
            }

            dp[cur][i] = Min + a[i];
            if(top) dp[cur][i] = min(dp[cur][i], dp[cur][q[top].first]);

            q[++top] = {i, Min};
        }
        swap(pre, cur);

    }

    cout << dp[pre][n];

}


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(fopen(Neco".inp", "r")) {
        freopen(Neco".inp", "r", stdin);
        freopen(Neco".out", "w", stdout);
    }


    int nTest = 1;
//    cin >> nTest;


    while(nTest--)
    {
        solve();
    }


    return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:76:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |         freopen(Neco".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:77:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |         freopen(Neco".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 0 ms 2652 KB Output is correct
7 Correct 0 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 0 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 0 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 0 ms 2652 KB Output is correct
19 Correct 0 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 0 ms 2652 KB Output is correct
26 Correct 0 ms 2652 KB Output is correct
27 Correct 0 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 0 ms 2652 KB Output is correct
30 Correct 0 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 0 ms 2652 KB Output is correct
33 Correct 0 ms 2652 KB Output is correct
34 Correct 0 ms 2652 KB Output is correct
35 Correct 0 ms 2656 KB Output is correct
36 Correct 0 ms 2656 KB Output is correct
37 Correct 0 ms 2652 KB Output is correct
38 Correct 1 ms 2660 KB Output is correct
39 Correct 1 ms 2656 KB Output is correct
40 Correct 0 ms 2656 KB Output is correct
41 Correct 1 ms 2656 KB Output is correct
42 Correct 0 ms 2656 KB Output is correct
43 Correct 1 ms 2660 KB Output is correct
44 Correct 0 ms 2664 KB Output is correct
45 Correct 1 ms 2664 KB Output is correct
46 Correct 0 ms 2664 KB Output is correct
47 Correct 0 ms 2664 KB Output is correct
48 Correct 0 ms 2664 KB Output is correct
49 Correct 1 ms 2664 KB Output is correct
50 Correct 1 ms 2664 KB Output is correct
51 Correct 1 ms 2664 KB Output is correct
52 Correct 1 ms 2664 KB Output is correct
53 Correct 1 ms 2664 KB Output is correct
54 Correct 1 ms 2660 KB Output is correct
55 Correct 1 ms 2664 KB Output is correct
56 Correct 0 ms 2664 KB Output is correct
57 Correct 0 ms 2664 KB Output is correct
58 Correct 2 ms 2664 KB Output is correct
59 Correct 5 ms 2664 KB Output is correct
60 Correct 4 ms 2664 KB Output is correct
61 Correct 23 ms 2664 KB Output is correct
62 Correct 78 ms 3076 KB Output is correct
63 Correct 7 ms 3100 KB Output is correct
64 Correct 34 ms 2920 KB Output is correct
65 Correct 1 ms 2664 KB Output is correct
66 Correct 1 ms 2664 KB Output is correct
67 Correct 1 ms 2664 KB Output is correct
68 Correct 1 ms 2664 KB Output is correct
69 Correct 1 ms 2524 KB Output is correct
70 Correct 1 ms 2664 KB Output is correct
71 Correct 4 ms 2664 KB Output is correct
72 Correct 1 ms 2664 KB Output is correct
73 Correct 2 ms 2664 KB Output is correct
74 Correct 3 ms 2664 KB Output is correct
75 Correct 5 ms 2892 KB Output is correct
76 Correct 29 ms 2676 KB Output is correct
77 Correct 92 ms 2920 KB Output is correct
78 Correct 9 ms 2920 KB Output is correct
79 Correct 42 ms 2908 KB Output is correct
80 Correct 6 ms 2904 KB Output is correct
81 Correct 14 ms 2904 KB Output is correct
82 Correct 93 ms 2908 KB Output is correct
83 Correct 1 ms 2652 KB Output is correct
84 Correct 1 ms 2652 KB Output is correct
85 Correct 3 ms 2652 KB Output is correct
86 Correct 1 ms 2652 KB Output is correct
87 Correct 2 ms 2652 KB Output is correct
88 Correct 3 ms 2652 KB Output is correct
89 Correct 5 ms 2652 KB Output is correct
90 Correct 24 ms 2652 KB Output is correct
91 Correct 70 ms 2904 KB Output is correct
92 Correct 7 ms 2904 KB Output is correct
93 Correct 36 ms 3160 KB Output is correct
94 Correct 1 ms 2652 KB Output is correct
95 Correct 3 ms 2652 KB Output is correct
96 Correct 1 ms 2648 KB Output is correct
97 Correct 0 ms 2652 KB Output is correct
98 Correct 0 ms 2652 KB Output is correct
99 Correct 0 ms 2652 KB Output is correct