oj.uz

답안 #475115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475115 2021-09-21T08:22:45 Z vitural K개의 묶음 (IZhO14_blocks) C++17
100 / 100
 359 ms 84576 KB 
// Solved by VituraL
#include <bits/stdc++.h>
#define pi pair<ll,ll>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pb push_back
#define reset(a) memset(a,0,sizeof(a))
#define BIT_ON(mask, i) (mask | (1 << (i)))
#define BIT_OFF(mask, i) (mask ^ (1 << (i)))
#define C_BITS(i) __builtin_popcount(i)
#define GET_BIT(mask, i)    ((mask >> i) & 1)
#define BIT_CHECK(x,i) (x & i)
using namespace std;
///// khai bao bien cac thu /////
const int mod = 1e9+7;
const int maxn = 1e6+7;
const int oo = 0x3f3f3f3f;
ll n,k,a[maxn],f[maxn][105];
/*
f[i][j] la trong so nho nhat de chia j so dau thanh i nhom
 */
void solve()
{
    cin>>n>>k;
    for(ll i=1;i<=n;i++) cin>>a[i];
    for(ll i=1;i<=n;i++) f[i][1]=max(f[i-1][1],a[i]);
    for(ll i=2;i<=k;i++)
    {
        f[0][i]=oo;
        stack<pi> st;
        for(ll j=i;j<=n;j++)
        {
            ll maxx = f[j-1][i-1];
            while(!st.empty() && a[st.top().se] <= a[j])
            {
                maxx = min(maxx, st.top().fi);
                st.pop();
            }
            if(st.empty())
            {
                f[j][i]=min(f[0][i],maxx+a[j]);
            }
            else f[j][i] = min(f[st.top().se][i],maxx+a[j]);
            st.push({maxx,j});
        }
    }
    cout<<f[n][k];
}
///// main /////
main()
{
    //freopen("che.inp","r",stdin);
    //freopen("che.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    cout << endl;
    return 0;
}
// end.

Compilation message

blocks.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main()
      | ^~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 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 204 KB Output is correct
11 Correct 0 ms 204 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 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 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 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 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 204 KB Output is correct
11 Correct 0 ms 204 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 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 1 ms 332 KB Output is correct
32 Correct 0 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 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 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 204 KB Output is correct
11 Correct 0 ms 204 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 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 1 ms 332 KB Output is correct
32 Correct 0 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 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 9 ms 8524 KB Output is correct
59 Correct 21 ms 37452 KB Output is correct
60 Correct 30 ms 37508 KB Output is correct
61 Correct 98 ms 37492 KB Output is correct
62 Correct 359 ms 83896 KB Output is correct
63 Correct 51 ms 83912 KB Output is correct
64 Correct 181 ms 83972 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 1 ms 332 KB Output is correct
67 Correct 1 ms 332 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 1100 KB Output is correct
70 Correct 1 ms 1168 KB Output is correct
71 Correct 21 ms 8648 KB Output is correct
72 Correct 7 ms 8652 KB Output is correct
73 Correct 10 ms 8652 KB Output is correct
74 Correct 25 ms 37452 KB Output is correct
75 Correct 26 ms 37452 KB Output is correct
76 Correct 84 ms 37508 KB Output is correct
77 Correct 274 ms 83900 KB Output is correct
78 Correct 49 ms 83916 KB Output is correct
79 Correct 151 ms 83964 KB Output is correct
80 Correct 45 ms 83932 KB Output is correct
81 Correct 71 ms 83964 KB Output is correct
82 Correct 285 ms 83872 KB Output is correct
83 Correct 1 ms 1100 KB Output is correct
84 Correct 1 ms 1100 KB Output is correct
85 Correct 20 ms 8752 KB Output is correct
86 Correct 5 ms 8652 KB Output is correct
87 Correct 9 ms 8648 KB Output is correct
88 Correct 25 ms 37476 KB Output is correct
89 Correct 26 ms 37740 KB Output is correct
90 Correct 80 ms 37768 KB Output is correct
91 Correct 304 ms 84548 KB Output is correct
92 Correct 49 ms 84536 KB Output is correct
93 Correct 154 ms 84576 KB Output is correct
94 Correct 6 ms 8696 KB Output is correct
95 Correct 23 ms 8696 KB Output is correct
96 Correct 1 ms 1100 KB Output is correct
97 Correct 1 ms 1100 KB Output is correct
98 Correct 0 ms 332 KB Output is correct
99 Correct 1 ms 332 KB Output is correct