제출 #1117821

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1117821		vjudge1	Paprike (COI18_paprike)	C++17	13 / 100	576 ms	3992 KiB

paprike

/*
#ifndef ONLINE_JUDGE
#include "AkbarKING.h" // aska geldi akbarking.h
#else
#define debug(...)
#define debugArr(...)
#define debugG(...)
#endif
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>

#define int long long
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")

#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()

using namespace std;
using namespace __gnu_pbds;

template <typename T>
using __indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using __indexed_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int sz = 3e5+9;
const int LOG = 63;
const int MOD = 1e9+7;
const int INF = 1e18;
int a[sz];

int n,k;

void solve()
{
    cin>>n>>k;
    for (int i = 1; i <= n; ++i)
    {
        cin>>a[i];
    }
    for (int i = 1,x,y; i < n; ++i)
    {
        cin>>x>>y;
    }
    array<int,2>dp = {0,0};
    for (int i = 1; i <= n; ++i)
    {
        cerr << dp[0] << ' ' << dp[1] << endl;
        if (dp[0] + a[i] > k)
        {
            dp[0] = a[i];
            dp[1] += 1;
        }
        else
        {
            dp[0] += a[i];
        }
    }
    cout<<dp[1]<<'\n';
}

signed main()
{
    $AzH_TxdmN$
    int t = 1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

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