제출 #519101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
519101		Dasha_Gnedko	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	332 KiB

segments

#include <bits/stdc++.h>

//#include <ext/pb_ds/detail/standard_policies.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

using namespace std;

//using namespace __gnu_pbds;
//template <typename T> using ordered_set = tree <T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 gen(time(0));

#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define sz(a) int32_t(a.size())
#define endl '\n'
//#define int long long

const int N = 5e5 + 100;
const int M = 31;
const int mod = 1e9 + 7;
const ll inf = 1e18 + 7;

ll pref[N];

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endif // LOCAL

    int n;
    cin >> n;
    int ans = 1; ll ls;
    for(int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        if (i) pref[i] = pref[i - 1];
        else ls = x;
        pref[i] += x;
    }
    for(int i = 1; i < n; i++)
    {
        int l = i, r = n - 1, gr = -1;
        while (l <= r)
        {
            int mid = (l + r) / 2;
            ll cnt = pref[mid] - pref[i - 1];
            if (cnt >= ls)
            {
                gr = mid;
                r = mid - 1;
            }
            else l = mid + 1;
        }
        if (gr == -1) break;
        ll was = ls;
        ls = pref[gr] - pref[i - 1];
        int j = i;
        while (j < gr && was + pref[j] - pref[j - 1] <= ls - (pref[j] - pref[j - 1]))
        {
            was += pref[j] - pref[j - 1];
            ls -= (pref[j] - pref[j - 1]);
            j++;
        }
        i = gr;
        ans++;
    }
    cout << ans;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27