Submission #953475

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
953475	2024-03-26 03:02:19	owoovo	Chorus (JOI23_chorus)	C++17	100 / 100	4663 ms	47500 KiB

chorus

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#define ll long long
#define F first 
#define S second 
using namespace std;
const ll maxn=1e18;
ll n,k,bto[1000010],bhh[1000010],hhsum[1000010];
pair<ll,ll> dp[1000010];
ll cost(ll i,ll j){
    if(i>=j)return maxn;
    ll l=max(i,bto[i]),r=j;
    return hhsum[r]-hhsum[l]-i*(r-l);
}
struct seg{
    ll pos,l,r;
    seg(ll _pos,ll _l,ll _r){
        pos=_pos,l=_l,r=_r;
    }
};
bool check(ll d){
    for(int i=1;i<=n;i++)dp[i]={maxn,0};
    deque<seg> sg;
    sg.push_back({0,1,n});
    for(int i=1;i<=n;i++){
        while(sg.front().r<i)sg.pop_front();
        ll pos=sg.front().pos;
        dp[i]={dp[pos].F+cost(pos,i)+d,dp[pos].S+1};
        while(!sg.empty()&&dp[i].F+cost(i,sg.back().l)<dp[sg.back().pos].F+cost(sg.back().pos,sg.back().l)){
            sg.pop_back();
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 21 / 21
• Subtask 4: 26 / 26
• Subtask 5: 13 / 13