oj.uz

Submission #935355

# Submission time Handle Problem Language Result Execution time Memory
935355 2024-02-29T03:57:55 Z HuyQuang_re_Zero Meetings (IOI18_meetings) C++14
36 / 100
 536 ms 257832 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define maxn 100005
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define IDB pair <db,int>
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x)
#include "meetings.h"
using namespace std;
const ll oo=round(1e18);
ll a[maxn],i,j,q,n,up[5005][5005],down[5005][5005];
struct pt
{
    int res,l,r,full;
    friend pt operator + (pt a,pt b)
    {
        pt c;
        c.res=max(max(a.res,b.res),a.r+b.l);
        c.l=a.l+(a.full ? b.l : 0);
        c.r=b.r+(b.full ? a.r : 0);
        c.full=a.full&b.full;
        return c;
    }
};
struct Interval_Tree
{
    pt st[4*maxn];
    void build(int id,int l,int r)
    {
        if(l==r)
        {
            if(a[l]==1) st[id]={ 1,1,1,1 };
            else st[id]={ 0,0,0,0 };
            return ;
        }
        int mid=(l+r)>>1;
        build(id*2,l,mid); build(id*2+1,mid+1,r);
        st[id]=st[id*2]+st[id*2+1];
    }
    pt get(int id,int l,int r,int u,int v)
    {
        if(u<=l && r<=v) return st[id];
        int mid=(l+r)>>1;
        if(v<=mid) return get(id*2,l,mid,u,v);
        if(u>mid) return get(id*2+1,mid+1,r,u,v);
        return get(id*2,l,mid,u,mid)+get(id*2+1,mid+1,r,mid+1,v);
    }
} IT;
vector <ll> minimum_costs(vector <int> h,vector <int> L,vector <int> R)
{
    for(int x:h) a[++n]=x;
    q=L.size();
    for(i=0;i<q;i++) L[i]++,R[i]++;
    vector <ll> res(q);
    if(n<=5000 && q<=5000)
    {
        for(i=1;i<=n;i++)
        {
            ll ma=0;
            for(j=i;j>=1;j--)
            {
                ma=max(ma,a[j]);
                down[i][j]=down[i][j+1]+ma;
            }

            ma=0;
            for(j=i;j<=n;j++)
            {
                ma=max(ma,a[j]);
                up[i][j]=up[i][j-1]+ma;
            }
        }

        for(i=0;i<q;i++)
        {
            int l=L[i],r=R[i];
            res[i]=oo;
            for(int u=l;u<=r;u++)
                res[i]=min(res[i],down[u][l]+up[u][r]-a[u]);
        }
    }
    else
    {
        IT.build(1,1,n);
        for(i=0;i<q;i++)
        {
            int l=L[i],r=R[i];
            res[i]=2*(r-l+1)-IT.get(1,1,n,l,r).res;
        }
    }
    return res;
}
/*
int main()
{
  //  freopen("meetings.inp","r",stdin);
    //freopen("meetings.out","w",stdout);
    vector <int> a,L,R;
    int k,n,l,r;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>k,a.push_back(k);
    while(cin>>l>>r) L.push_back(l),R.push_back(r);
    vector <ll> res=minimum_costs(a,L,R);
    for(int x:res) cout<<x<<'\n';
}

*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 47 ms 112592 KB Output is correct
3 Correct 44 ms 112724 KB Output is correct
4 Correct 43 ms 112728 KB Output is correct
5 Correct 44 ms 112840 KB Output is correct
6 Correct 42 ms 112724 KB Output is correct
7 Correct 42 ms 112724 KB Output is correct
8 Correct 42 ms 112720 KB Output is correct
9 Correct 42 ms 112828 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 47 ms 112592 KB Output is correct
3 Correct 44 ms 112724 KB Output is correct
4 Correct 43 ms 112728 KB Output is correct
5 Correct 44 ms 112840 KB Output is correct
6 Correct 42 ms 112724 KB Output is correct
7 Correct 42 ms 112724 KB Output is correct
8 Correct 42 ms 112720 KB Output is correct
9 Correct 42 ms 112828 KB Output is correct
10 Correct 276 ms 257672 KB Output is correct
11 Correct 536 ms 257792 KB Output is correct
12 Correct 256 ms 257616 KB Output is correct
13 Correct 536 ms 257792 KB Output is correct
14 Correct 266 ms 257832 KB Output is correct
15 Correct 267 ms 257792 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 20 ms 4060 KB Output is correct
3 Correct 58 ms 10624 KB Output is correct
4 Correct 57 ms 10576 KB Output is correct
5 Correct 45 ms 10580 KB Output is correct
6 Correct 54 ms 10584 KB Output is correct
7 Correct 57 ms 10588 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 20 ms 4060 KB Output is correct
3 Correct 58 ms 10624 KB Output is correct
4 Correct 57 ms 10576 KB Output is correct
5 Correct 45 ms 10580 KB Output is correct
6 Correct 54 ms 10584 KB Output is correct
7 Correct 57 ms 10588 KB Output is correct
8 Incorrect 59 ms 10580 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 47 ms 112592 KB Output is correct
3 Correct 44 ms 112724 KB Output is correct
4 Correct 43 ms 112728 KB Output is correct
5 Correct 44 ms 112840 KB Output is correct
6 Correct 42 ms 112724 KB Output is correct
7 Correct 42 ms 112724 KB Output is correct
8 Correct 42 ms 112720 KB Output is correct
9 Correct 42 ms 112828 KB Output is correct
10 Correct 276 ms 257672 KB Output is correct
11 Correct 536 ms 257792 KB Output is correct
12 Correct 256 ms 257616 KB Output is correct
13 Correct 536 ms 257792 KB Output is correct
14 Correct 266 ms 257832 KB Output is correct
15 Correct 267 ms 257792 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 20 ms 4060 KB Output is correct
18 Correct 58 ms 10624 KB Output is correct
19 Correct 57 ms 10576 KB Output is correct
20 Correct 45 ms 10580 KB Output is correct
21 Correct 54 ms 10584 KB Output is correct
22 Correct 57 ms 10588 KB Output is correct
23 Incorrect 59 ms 10580 KB Output isn't correct
24 Halted 0 ms 0 KB -