Submission #1105037

#	Time	Username	Problem	Language	Result	Execution time	Memory
1105037		modwwe	Real Mountains (CCO23_day1problem2)	C++17	25 / 25	2567 ms	192664 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 = 1e6+3;
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;

};

int  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,invf;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int c[1000002];
int b[1000002];
int bit[1000002];
int a[1000002];
vector<int> v;
vector<int> pos[1000002];
vector<int>hihi[1000002];
set<int>s;
int cost(int l,int r)
{
    if(l>r) return 0;
    return ((r+l)*(r-l+1)/2)%mod2;
}
struct IT
{
    int t[4000001];
    void build(int node,int l,int r)
    {
        if(l==r)
        {
            t[node]=a[l];
            return;
        }
        int mid=l+r>>1;
        build(node<<1,l,mid);
        build(node<<1|1,mid+1,r);
        t[node]=min(t[node<<1],t[node<<1|1]);
    }
    void upd(int node,int l,int r,int l1)
    {
        if(l==r)
        {
            t[node]=inf;
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid) upd(node<<1,l,mid,l1);
        else upd(node<<1|1,mid+1,r,l1);
        t[node]=min(t[node<<1],t[node<<1|1]);
    }
    int get(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1||t[node]==inf) return inf;
        if(l>=l1&&r<=r1) return v[t[node]-1];
        int mid=l+r>>1;
        return min(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
    }
} st;
int min_cost(int l,int r,int x,int y)
{
    int costleft=st.get(1,1,n,1,l-1)
                 +st.get(1,1,n,l+1,n)
                 +st.get(1,1,n,r+1,n);
    int costright=st.get(1,1,n,1,r-1)+
                  st.get(1,1,n,r+1,n)+
                  st.get(1,1,n,1,l-1);
    return min(costleft,costright)*(v[x]-v[y])
           +cost(v[y]+1,v[x])*((s.size()-2)*2+1);
}
void phongbeo()
{
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i],v.pb(a[i]);
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    for(int i=1; i<=n; i++)
        a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin()+1,
             hihi[a[i]-1].pb(i);
    st.build(1,1,n);
    for(int i=1; i<=n; i++)
    {
        if(a[i]>=c[i-1]) c[i]=a[i],s2=i;
        else c[i]=c[i-1];
        pos[c[i]-1].pb(i);
    }
    for(int i=1; i<=s2; i++)
        s4=s4+cost(v[a[i]-1],v[c[i]-1]-1);
    for(int i=n; i>=s2+1; --i)
    {
        if(a[i]>=c[i+1]) c[i]=a[i];
        else c[i]=c[i+1];
        pos[c[i]-1].pb(i);
        s4=s4+cost(v[a[i]-1],v[c[i]-1]-1);
    }
    for(int i=0; i<v.size(); i++)
    {
        if(s.size()>1)
        {
            s2=*s.begin();
            s3=*s.rbegin();
            s4=s4+min_cost(s2,s3,i,i-1);
        }
        else  if(s.size()==1)
        {
            s2=*s.begin();
            s4+=(st.get(1,1,n,1,s2-1)+st.get(1,1,n,s2+1,n))*(v[i]-v[i-1]);
        }
        for(auto f:hihi[i])
            s.insert(f),
                     st.upd(1,1,n,f);
        for(auto f:pos[i])
            s.erase(f);
    }
    cout<<s4%mod2;
}

Compilation message (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::build(long long int, long long int, long long int)':
Main.cpp:107:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  107 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'void IT::upd(long long int, long long int, long long int, long long int)':
Main.cpp:119:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  119 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'long long int IT::get(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:128:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  128 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function 'void phongbeo()':
Main.cpp:169:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  169 |     for(int i=0; i<v.size(); i++)
      |                  ~^~~~~~~~~
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: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 3 / 3
• Subtask 4: 3 / 3
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 4 / 4