제출 #1293914

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293914		eldaees131313	Paprike (COI18_paprike)	C++20	13 / 100	8 ms	1092 KiB

paprike

////////////////////////////// Author:eldaee, coder_viper!!!!!!!!!!!!!!!!!!!!!!!!11
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define int long long
#define str string
#define vec vector
#define dou double
#define ld long double
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define YES cout << "YES" << '\n'
#define Yes cout << "Yes" << '\n'
#define NO cout << "NO" << '\n'
#define No cout << "No" << '\n'
#define gcd __gcd
#define all(x) x.begin(),x.end()
#define eldaee ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
/*


*/

using namespace std;

void solve() { 
    int n, k;
    cin >> n >> k;
    int h[100001];
    for (int i = 0; i < n; i++) {
        cin >> h[i];
    }
    int x = 0;
    if (n <= 15) {
        int y = 1;
        for (int i = 0; i < n; i++) {
            y *= 2;
        }
        int mi = n - 1;
        for (int j = 0; j < y; j++) {
            int sm = 0;
            int c = 0;
            for (int i = 0; i < n; i++) {
                sm += h[i];
                if (sm > k) {
                    c++;
                    sm = h[i];
                }
            }
            if (sm <= k) {
                if (c < mi) {
                    mi = c;
                }
            }
        }
        x = mi;
    }
    else {
        int sm = 0;
        for (int i = 0; i < n; i++) {
            sm += h[i];
            if (sm > k) {
                x++;
                sm = h[i];
            }
        }
    }
    cout << x << '\n';
} 

signed main()
{
    eldaee
    
    solve();
}

• Subtask 1: 0 / 11
• Subtask 2: 13 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49