Submission #290509

#	Time	Username	Problem	Language	Result	Execution time	Memory
290509		MatheusLealV	Bigger segments (IZhO19_segments)	C++17	73 / 100	707 ms	262148 KiB

segments

#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
typedef pair<long, long>pll;
 
// #define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll mod = (1000000007LL);
inline ll Mod(ll a, ll b){return (a%b);}
inline ll poww(ll a, ll b){ll res = 1;while (b > 0){if(b & 1) res = (res * a)%mod;a = (a * a)%mod;b >>= 1;}return res;}
ll gcd (ll a, ll b) { while (b) { a %= b,swap(a, b);}return a;}
void read(vector<int> &w, int n){w.resize(n);for(int i = 0; i < n; i++) cin>>w[i];}
void print(vector<int> &w){for(int i =0; i < sz(w); i++){if(i == sz(w) - 1) cout<<w[i]<<"\n";else cout<<w[i]<<" ";}}
int prodmod(vector<int> w);
int summod(vector<int> w);
///CUIDADO COM MAXN
#define N 500050
 
int n, m, q, k, v[N], ans;
ll pref[N];
pii w[N];
string s;
struct node{
    ll a, b;
    pll v;
    node *l, *r;
    node(ll a_, ll b_, ll v_ = 0, ll id=0){
        a = a_, b = b_;
        v = {v_, id};
        l = r = NULL;
    }
    void upd(ll p, ll x, ll id){
        if(p < a || p > b) return;
        if(a == b){
            v = max(v, {x, id});
            return;
        }
        ll mid = (a+b)/2;
        if(p <= mid){
            if(l == NULL) l = new node(a, mid);
            l->upd(p, x,id);
        }
        else{
            if(r == NULL) r = new node(mid + 1, b);
             r ->upd(p, x,id);
        }
        v = max(( (l == NULL)?pll(0,0):l->v ), ( (r == NULL)?pll(0,0): r-> v ));
    }
    pll query(ll i, ll j){
        if(i > b || j < a) return {0,0};
        if(i <= a && j >= b) return v;
        pll A = (l == NULL)?pll(0,0):l->query(i, j);
        pll B = (r == NULL)?pll(0,0):r->query(i, j);
        return max(A,B);
    }
};
int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n;
	for(int i = 1; i <= n; i++){
		cin>>v[i];
		pref[i]=pref[i-1]+v[i];
	}
	node *tree = new node(0, n*((ll)(1e9)));
	// ll sum = 0, ans = 0, ant = -1;
	vector<int> dp(n + 1);
	for(int i = 1; i <= n; i++){
		auto cara = tree->query(0, pref[i]);
		dp[i] = cara.f + 1;
		// if(cara.s == 0) cara.s = 1;
		tree->upd(2LL*pref[i] - pref[cara.s], dp[i], i);
	}
	cout<<dp[n]<<"\n";
	// if(sum >= ant) ans ++;
	// cout<<ans<<"\n";
}
/*
    CUIDADO COM MAXN, MOD, OVERFLOW 
    >Colocar (>DEFINE INT LONG LONG<) no inicio do template
    >mod = (1e9 + 7), por padrao (NAO ESQUECER DE ALTERAR)
    >NAO ESQUECER DEFINE INT LONG LONG
    > N = 1 ? 
*/
int summod(vector<int> w){int curr=0;for(int i=0;i<sz(w); i++){curr = (curr+w[i])%mod;if(curr<0)curr+=mod;}return curr;}
int prodmod(vector<int> w){int curr = 1;
for(int i = 0; i < sz(w); i++){if(w[i] >= mod) w[i] %= mod;curr = (curr * w[i]) % mod;if(curr < 0) curr += mod;}return curr;}

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