제출 #1103758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103758		modwwe	Heavy Light Decomposition (CCO24_day2problem2)	C++17	0 / 25	2499 ms	74544 KiB

Main

#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
};
void phongbeo();
const int inf = 1e9;
const int mod2 = 1000003;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

ll n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int c[500001];
int pre[500001];
int nxt[500001];
int a[500001];
int dp[500001];
vector<int> v2[500002];
int f[500002];
struct IT
{
    int t3[2000009];
    ib t[2000009];
    int t2[2000009];
    int t4[2000009];
    ib mer(ib a,ib b)
    {
        return {add(a.a,b.a),add(b.b,a.b)};
    }
    void upd(int node,int l,int r,int l1,int x)
    {
        if(l==r)
        {
            t[node].a=x;
            if(t2[node]<=l1)  t[node].b=x;
            else t[node].b=0;
            return;
        }
        int mid=l+r>>1;
        ff(node);
        if(l1<=mid) upd(node<<1,l,mid,l1,x);
        else upd(node<<1|1,mid+1,r,l1,x);
        t[node]=mer(t[node<<1],t[node<<1|1]);
    }
    void ff(int x)
    {
        for(int i=x*2; i<=x*2+1; i++)
        {
            if(t3[x]==1)t[i].b=0;
            else if(t3[x]==2)t[i].b=t[i].a;
            if(t3[x]!=0)
                t3[i]=t3[x];
            t2[i]=max(t2[i],t2[x]);
            t4[i]=max(t4[i],t2[x]);
        }
        t3[x]=0;
    }
    void upd2(int node,int l,int r,int l1,int r1,int x)
    {
        if(l>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            t2[node]=max(t2[node],x);
            t[node].b=0;
            t3[node]=1;
            t4[node]=max(t4[node],x);
            return;
        }
        int mid=l+r>>1;
        ff(node);
        upd2(node<<1,l,mid,l1,r1,x);
        upd2(node<<1|1,mid+1,r,l1,r1,x);
        t[node]=mer(t[node<<1],t[node<<1|1]);
        t4[node]=max(t4[node<<1],t4[node<<1|1]);
    }
    void upd3(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            t[node].b=t[node].a;
            t3[node]=2;
            return;
        }
        int mid=l+r>>1;

        ff(node);
        upd3(node<<1,l,mid,l1,r1);
        upd3(node<<1|1,mid+1,r,l1,r1);
        t[node]=mer(t[node<<1],t[node<<1|1]);
        t4[node]=max(t4[node<<1],t4[node<<1|1]);
    }
    int get(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1) return 0;
        if(l>=l1&&r<=r1) return t[node].b;
        int mid=l+r>>1;
        ff(node);
        return add(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
    }
    int get_max(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1) return 0;
        if(l>=l1&&r<=r1) return t4[node];
        int mid=l+r>>1;
        ff(node);
        return max(get_max(node<<1,l,mid,l1,r1),get_max(node<<1|1,mid+1,r,l1,r1));
    }
} st[2];
void upd(int x)
{
    if(pre[x]%2!=x%2&&pre[x]!=0) /// khac bit => ko bao gio co ca 2
    {
        st[0].upd2(1,0,n,0,pre[x]-1,inf);
        st[1].upd2(1,0,n,0,pre[x]-1,inf);
    }
    l=pre[x];
    r=x-1;
    while(l<=r)
    {
        int mid=l+r>>1;
        if(st[1-x%2].get_max(1,0,n,mid,x-1)<nxt[x])r=mid-1;
        else l=mid+1;
    }
    r++;
    ///cout<<r<<" "<<x-1<<" "<<1-x%2<<" "<<nxt[x]<<" "<<" "<<st[1-x%2].t[1].b,debug
    st[1-x%2].upd2(1,0,n,r,x-1,nxt[x]);
    ///     cout<<r<<" "<<x-1<<" "<<1-x%2<<" "<<nxt[x]<<" "<<" "<<st[1-x%2].t[1].b,debug
    f[x]=r;
    /// cung bit => xoa o prex den x-1 deu ko dc hien
}
void cx(int x,int y,int z)
{
    l=x;
    r=y-1;
    while(l<=r)
    {
        int mid=l+r>>1;
        if(st[1-y%2].get_max(1,0,n,l,mid)<=z) l=mid+1;
        else r=mid-1;
    }
    l--;
    if(l<x) return;
    st[1-y%2].upd3(1,0,n,x,l);
    ///cout<<x<<" "<<l,down
}
void reload(int x)
{
    s5=pre[x];
    if(s5!=0)
    {
        st[s5%2].upd(1,0,n,s5,dp[s5]);
        cx(f[s5],s5,x);
    }
}
void phongbeo()
{
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=n; i++)
    {
        pre[i]=c[a[i]];
        c[a[i]]=i;
    }
    for(int i=1; i<=n; i++)
        c[i]=n+1;
    for(int i=n; i>=1; --i)
    {
        nxt[i]=c[a[i]];
        c[a[i]]=i;
    }
    st[0].upd(1,0,n,0,1);
    dp[0]=1;
    for(int i=1; i<=n; i++)
    {
        reload(i);
        upd(i);
        dp[i]=add(st[i%2].get(1,0,n,pre[i],i-1),dp[i-1]);
        if(pre[i]!=0)
            dp[i]=add(dp[i],st[1-(i%2)].get(1,0,n,0,pre[i]-1));
        st[i%2].upd(1,0,n,i,dp[i]);
        if(i>=2)st[i%2].upd(1,0,n,i,dp[i-2]+dp[i]);
    }
    cout<<dp[n];
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   71 | main()
      | ^~~~
Main.cpp: In member function 'void IT::upd(int, int, int, int, int)':
Main.cpp:110:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  110 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'void IT::upd2(int, int, int, int, int, int)':
Main.cpp:140:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  140 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'void IT::upd3(int, int, int, int, int)':
Main.cpp:156:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  156 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'int IT::get(int, int, int, int, int)':
Main.cpp:168:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  168 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'int IT::get_max(int, int, int, int, int)':
Main.cpp:176:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  176 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function 'void upd(int)':
Main.cpp:192:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  192 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function 'void cx(int, int, int)':
Main.cpp:209:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  209 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fin'
   75 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:76:9: note: in expansion of macro 'fou'
   76 |         fou(task);
      |         ^~~

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 5
• Subtask 4: 0 / 6
• Subtask 5: 0 / 7