제출 #206853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
206853		bash	Bigger segments (IZhO19_segments)	C++17	13 / 100	5 ms	380 KiB

segments

/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}

pair<int,ll> dp[MAXN];
///first cnt, second sum
ll a[MAXN];
ll pref[MAXN];
ll t[MAXN * 4];
const ll INF = 1e18;

int n;

void build(int v = 1, int tl = 0, int tr = n) {
	if (tl == tr) {
		t[v] = (tl == 0 ? 0 : INF);
		return;		
	}
	int tm = (tl + tr) / 2;
	build(v + v, tl, tm);
	build(v + v + 1, tm + 1, tr);
	t[v] = min(t[v * 2], t[v * 2 + 1]);
}

ll get(ll S, int l, int r, int v = 1, int tl = 0, int tr = n) {
	if (r < tl || tr < l) return INF;
	if (S < t[v]) return INF;
	if (tl == tr) {
		return tl;
	}
	int tm = (tl + tr) / 2;
	ll b = get(S, l, r, v * 2 + 1, tm + 1, tr);
	if (b == INF) {
		return get(S, l, r, v * 2, tl, tm);	
	} else {
		return b;
	}
}

void update(int x, int pos, int v = 1, int tl = 0, int tr = n) {
	if (tl == tr) {
		t[v] = x;
		return;
	}
	int tm = (tl + tr) / 2;
	if (pos <= tm) {
		update(x, pos, v * 2, tl, tm);
	} else {
		update(x, pos, v * 2 + 1, tm + 1, tr);		
	}
	t[v] = min(t[v * 2], t[v * 2+ 1]);
}

ll g(int i, int v = 1, int tl = 0, int tr = n) {
	if (tl == tr) {
		return t[v];
	}
	int tm =(tl + tr) / 2;
	if (i <= tm) {
		return g(i, v * 2, tl, tm);		
	} else {
		return g(i, v * 2 + 1, tm + 1, tr);
	}
}

void output() {
	for (int i = 0; i <= n; i++) {
		cout << g(i) << ' ';	
	}
	cout << endl;
}

int main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    n = readInt();
    build();
    for (int i = 1; i <= n; i++) {
    	a[i] = readInt();
    	pref[i] = pref[i - 1] + a[i];
    }
    build();
	dp[0] = {0, 0ll};
    for (int i = 1; i <= n; i++) {
		int l = 0, r = i - 1;
		///we need to find first pos which is S >= dp[m].second + pref[m]
		/// or find first pos which is S >= X[i]
    	ll pos = get(pref[i], l, r);
		dp[i] = {dp[pos].F + 1, pref[i] - pref[pos]};
		update(dp[i].second + pref[i], i);    		
    }
    cout << dp[n].first;
	return 0;
}

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