Submission #482500

#	Time	Username	Problem	Language	Result	Execution time	Memory
482500		NhatMinh0208	Candies (JOI18_candies)	C++14	100 / 100	680 ms	36672 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(int i=__;i<=___;i++)
#define rr(i,__,___) for(int 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
vector<int> vec;
ll n,m,i,j,k,t,t1,u,v,a,b;
ll arr[200001];

struct rn {
	ll l,r,c;
	ll ex=0;
	rn(ll _l, ll _r, ll _c) : l(_l), r(_r), c(_c) {}
};

struct cmp1 {
	int operator()(rn a, rn b) const {
		return (a.r<b.r);
	}
};


struct cmp2 {
	int operator()(rn a, rn b) const {
		if (a.ex-b.ex) return (a.ex<b.ex);
		if (a.c-b.c) return (a.c>b.c);
		return (a.r<b.r);
	}
};

set<rn,cmp1> st1;
set<rn,cmp2> st2;

int main()
{
	fio;
	cin>>n;
	for (i=1;i<=n;i++) {
		cin>>arr[i];
		st1.insert({i,i,arr[i]});
		st2.insert({i,i,arr[i]});
	}
	ll res=0;
	for (t=1;t*2<=n+1;t++) {
		auto g = (*(st2.begin()));
		st2.erase(g);
		res+=g.c;
		cout<<res<<endl;
		auto gn=g;
		gn.c=-gn.c;
		if (g.l==1 || g.r==n) {
			gn.ex=1;
		}
		if (g.l>1) {
			auto it1=st1.lower_bound(g);
			it1--;
			auto gg = (*it1);
			gn.l=gg.l;
			gn.ex|=gg.ex;
			gn.c+=gg.c;
			st2.erase(gg);
			st1.erase(gg);
		}
		if (g.r<n) {
			auto it1=st1.lower_bound(g);
			it1++;
			auto gg = (*it1);
			gn.r=gg.r;
			gn.ex|=gg.ex;
			gn.c+=gg.c;
			st2.erase(gg);
			st1.erase(gg);	
		}
		st1.erase(g);
		st1.insert(gn);
		st2.insert(gn);
	}
}
// N;

Compilation message (stderr)

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

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