oj.uz

답안 #1088853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088853 2024-09-15T10:24:32 Z Khanhcsp2 K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 135 ms 81564 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e5+11;
int n, a[N], k, dp[102][N];
void sub1()
{
    for(int i=1;i<=k;i++) for(int j=1;j<=n;j++) dp[i][j]=1e18;
    int mx=0;
    for(int i=1;i<=n;i++)
    {
        mx=max(mx, a[i]);
        dp[1][i]=mx;
    }
    for(int i=2;i<=k;i++)
    {
        for(int j=1;j<=n;j++)
        {
            int mx=0;
            for(int o=j;o>=i;o--)
            {
                mx=max(mx, a[o]);
                dp[i][j]=min(dp[i][j], dp[i-1][o-1]+mx);
            }
        }
    }
    cout << dp[k][n];
}
void sub2()
{
    for(int i=0;i<=k;i++) for(int j=0;j<=n;j++) dp[i][j]=1e18;
    int mx=0;
    for(int i=1;i<=n;i++)
    {
        mx=max(mx, a[i]);
        dp[1][i]=mx;
    }
    for(int i=2;i<=k;i++)
    {
        stack<pii> st;
        for(int j=i;j<=n;j++)
        {
            int s=dp[i-1][j-1];
            while(!st.empty() && a[st.top().fi]<=a[j])
            {
                s=min(s, st.top().sc);
                st.pop();
            }
            if(st.empty() || s+a[j]<a[st.top().fi]+st.top().sc) st.emplace(j, s);
            dp[i][j]=a[st.top().fi]+st.top().sc;
        }
    }
    cout << dp[k][n];
}
void sol()
{
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> a[i];
    if(n<=100) sub1();
    else sub2();
//    sub2();
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 408 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 616 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 0 ms 860 KB Output is correct
54 Correct 1 ms 860 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Correct 0 ms 860 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 4 ms 2652 KB Output is correct
59 Correct 4 ms 1628 KB Output is correct
60 Correct 6 ms 3932 KB Output is correct
61 Correct 40 ms 27996 KB Output is correct
62 Correct 106 ms 80980 KB Output is correct
63 Correct 9 ms 4960 KB Output is correct
64 Correct 63 ms 37836 KB Output is correct
65 Correct 1 ms 604 KB Output is correct
66 Correct 1 ms 604 KB Output is correct
67 Correct 1 ms 728 KB Output is correct
68 Correct 1 ms 604 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 10 ms 8984 KB Output is correct
72 Correct 1 ms 860 KB Output is correct
73 Correct 3 ms 2652 KB Output is correct
74 Correct 3 ms 1628 KB Output is correct
75 Correct 5 ms 3932 KB Output is correct
76 Correct 40 ms 27996 KB Output is correct
77 Correct 95 ms 80920 KB Output is correct
78 Correct 9 ms 4952 KB Output is correct
79 Correct 58 ms 37688 KB Output is correct
80 Correct 7 ms 3416 KB Output is correct
81 Correct 15 ms 10328 KB Output is correct
82 Correct 90 ms 80752 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 604 KB Output is correct
85 Correct 12 ms 9044 KB Output is correct
86 Correct 1 ms 860 KB Output is correct
87 Correct 5 ms 2612 KB Output is correct
88 Correct 3 ms 1628 KB Output is correct
89 Correct 7 ms 4188 KB Output is correct
90 Correct 47 ms 28508 KB Output is correct
91 Correct 135 ms 81564 KB Output is correct
92 Correct 9 ms 5468 KB Output is correct
93 Correct 60 ms 38512 KB Output is correct
94 Correct 2 ms 856 KB Output is correct
95 Correct 9 ms 8792 KB Output is correct
96 Correct 0 ms 604 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct