oj.uz

답안 #1096267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096267 2024-10-04T07:31:37 Z trinhvtuan Global Warming (CEOI18_glo) C++17
38 / 100
 2000 ms 12752 KB 
#include <bits/stdc++.h>
using namespace std;
long long k,c,d,x,y,z,n,kq,kq1;
int i,j;
long long ans[1000001],b[1000001],st[1000001];
struct gv
{
    long long val,vitri;
};
gv a[1000001];
bool cmp(gv x,gv y)
{
    if (x.val<y.val) return true;
    if (x.val==y.val && x.vitri>y.vitri) return true;
    return false;
}
void buildtree(int id,int l,int r)
{
    if (l==r)
    {
        st[id]=0; return;
    }
    int mid=(l+r)/2;
    buildtree(id*2,l,mid);
    buildtree(id*2+1,mid+1,r);
    st[id]=st[id*2]+st[id*2+1];
}
void update(int id,int l,int r,int i,int val)
{
    if (i<l || r<i) return;
    if (l==r)
    {
        st[id]=val;
        return;
    }
    int mid=(l+r)/2;
    update(id*2,l,mid,i,val);
    update(id*2+1,mid+1,r,i,val);
    st[id]=max(st[id*2],st[id*2+1]);
}
long long get(int id,int l,int r,int u,int v)
{
    if (v<l || r<u) return 0;
    if (u<=l && r<=v) return st[id];
    int mid=(l+r)/2;
    return max(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
}
void solve()
{
    buildtree(1,1,n); kq=0;
    sort(a+1,a+n+1,cmp);
    for (int i=1;i<=n;i++)
    {
        c=get(1,1,n,1,a[i].vitri)+1;
        ans[a[i].vitri]=c;
        update(1,1,n,a[i].vitri,c);
    }
    for (int i=1;i<=n;i++)
    kq=max(kq,ans[i]);
    //cout<<kq<<"\n";
    kq1=max(kq1,kq);
}
void sub1()
{
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<i;j++)
        {
            a[j].val=b[j]; a[j].vitri=j;
        }
        for (int j=i;j<=n;j++)
        {
            a[j].val=b[j]+k; a[j].vitri=j;
        }
        solve();
    }
    cout<<kq1;
}
void sub2()
{
    for (int i=1;i<=n;i++)
    {
        a[i].val=b[i]; a[i].vitri=i;
    }
    sort(a+1,a+n+1,cmp);
    for (int i=1;i<=n;i++)
    {
        c=get(1,1,n,1,a[i].vitri)+1;
        ans[a[i].vitri]=c;
        update(1,1,n,a[i].vitri,c);
    }
    for (int i=1;i<=n;i++)
    kq=max(kq,ans[i]);
    cout<<kq;
}
int main()
{
    //freopen("daydep.inp", "r" ,stdin);
    //freopen("daydep.out", "w" ,stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>k;
    for (int i=1;i<=n;i++)
    {
        cin>>b[i];
    }
    if (k!=0) sub1(); else
    sub2();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 412 KB Output is correct
19 Correct 187 ms 520 KB Output is correct
20 Correct 179 ms 344 KB Output is correct
21 Correct 175 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 170 ms 520 KB Output is correct
24 Correct 169 ms 348 KB Output is correct
25 Correct 118 ms 348 KB Output is correct
26 Correct 164 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 12624 KB Output is correct
2 Correct 103 ms 12716 KB Output is correct
3 Correct 106 ms 12752 KB Output is correct
4 Correct 104 ms 12624 KB Output is correct
5 Correct 73 ms 11860 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2059 ms 3420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2052 ms 6484 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 412 KB Output is correct
19 Correct 187 ms 520 KB Output is correct
20 Correct 179 ms 344 KB Output is correct
21 Correct 175 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 170 ms 520 KB Output is correct
24 Correct 169 ms 348 KB Output is correct
25 Correct 118 ms 348 KB Output is correct
26 Correct 164 ms 344 KB Output is correct
27 Correct 100 ms 12624 KB Output is correct
28 Correct 103 ms 12716 KB Output is correct
29 Correct 106 ms 12752 KB Output is correct
30 Correct 104 ms 12624 KB Output is correct
31 Correct 73 ms 11860 KB Output is correct
32 Execution timed out 2059 ms 3420 KB Time limit exceeded
33 Halted 0 ms 0 KB -