Submission #470888

#	Time	Username	Problem	Language	Result	Execution time	Memory
470888		NhatMinh0208	Candies (JOI18_candies)	C++14	8 / 100	124 ms	34972 KiB

candies

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(ll i=__;i<=___;i++)
#define rr(i,__,___) for(ll i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

ll n,m,i,j,k,t,t1,u,v,a,b,res=0;

struct lmao {
    ll l,r,c,b;
    lmao (ll _l, ll _r, ll _c, ll _b) {
        l=_l;
        r=_r;
        c=_c;
        b=_b;
    }
    ll operator<(lmao oth)
    {
        return r<oth.r;
    }
    ll operator<(lmao oth) const
    {
        return r<oth.r;
    }
};
struct cmp {
    ll operator()(lmao a, lmao b) const
    {
        if (a.b-b.b) return (a.b<b.b);
        if (a.c-b.c) return (a.c>b.c);
        return (a<b);
    }
};
set<lmao> pos;
set<lmao,cmp> ord;
char c,d;
ll arr[100001];
ll val[100001];
int main()
{
    // ofile;
	fio;
    cin>>n;
    u=v=1;
    for (i=1;i<=n;i++)
    {
        cin>>u;
        arr[i]=u;
        pos.insert({i,i,u,0});
        ord.insert({i,i,u,0});
    }
    
    u=0;
    for (i=1;i<=n;i+=2) {u+=arr[i];}
    val[n-n/2]=max(val[n-n/2],u);

    u=0;
    for (i=2;i<=n;i+=2) {u+=arr[i];}
    val[n/2]=max(val[n/2],u);

    u=0;
    res=0;
    while(ord.size()>1)
    {
        auto g=(*(ord.begin())),h=g;
        
        // cout<<g.c<<' ';
        ord.erase(h);
        res+=g.c;
        g.c=-g.c;
        if (g.l==1 || g.r==n) {
            if (g.b==0) {g.b=1; u++;}
            else (g.b=0); 
        }
        else u++;
        val[u]=max(val[u],res);
        if (g.l>1)
        {
            auto it2=pos.lower_bound(h);
            it2--;
            g.l=it2->l;
            g.c+=it2->c;
            g.b = max(g.b,it2->b);
            ord.erase((*it2));
            pos.erase(it2);
        }
        if (g.r<n)
        {
            auto it2=pos.lower_bound(h);
            it2++;
            g.r=it2->r;
            g.c+=it2->c;
            g.b = max(g.b,it2->b);
            ord.erase((*it2));
            pos.erase(it2);
        }
        auto it=pos.lower_bound(h);
        pos.erase(it);
        pos.insert(g);
        ord.insert(g);
    }
    for (i=1;i<=n-n/2;i++) cout<<val[i]<<endl;
}
// Normie28

Compilation message (stderr)

candies.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 8 / 8
• Subtask 2: 0 / 92