oj.uz

답안 #470889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470889 2021-09-06T04:31:49 Z NhatMinh0208 Candies (JOI18_candies) C++14
100 / 100
 730 ms 37520 KB 
#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[1000001];
ll val[1000001];
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

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 4 ms 588 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 3 ms 588 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 4 ms 588 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 3 ms 588 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 655 ms 36144 KB Output is correct
22 Correct 662 ms 37368 KB Output is correct
23 Correct 673 ms 37352 KB Output is correct
24 Correct 333 ms 37244 KB Output is correct
25 Correct 335 ms 37288 KB Output is correct
26 Correct 320 ms 37188 KB Output is correct
27 Correct 349 ms 37424 KB Output is correct
28 Correct 346 ms 37388 KB Output is correct
29 Correct 355 ms 37496 KB Output is correct
30 Correct 360 ms 37328 KB Output is correct
31 Correct 368 ms 37316 KB Output is correct
32 Correct 360 ms 37352 KB Output is correct
33 Correct 486 ms 37188 KB Output is correct
34 Correct 485 ms 37192 KB Output is correct
35 Correct 504 ms 37188 KB Output is correct
36 Correct 665 ms 37312 KB Output is correct
37 Correct 669 ms 37316 KB Output is correct
38 Correct 730 ms 37392 KB Output is correct
39 Correct 329 ms 37248 KB Output is correct
40 Correct 334 ms 37208 KB Output is correct
41 Correct 336 ms 37200 KB Output is correct
42 Correct 360 ms 37520 KB Output is correct
43 Correct 355 ms 37388 KB Output is correct
44 Correct 348 ms 37492 KB Output is correct
45 Correct 368 ms 37412 KB Output is correct
46 Correct 372 ms 37468 KB Output is correct
47 Correct 369 ms 37316 KB Output is correct
48 Correct 493 ms 37192 KB Output is correct
49 Correct 487 ms 37168 KB Output is correct
50 Correct 493 ms 37204 KB Output is correct