oj.uz

Submission #140836

# Submission time Handle Problem Language Result Execution time Memory
140836 2019-08-05T14:20:14 Z rzbt Global Warming (CEOI18_glo) C++14
0 / 100
 911 ms 26724 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 200005
typedef long long ll;

using namespace std;

int n,d;
int niz[MAXN];
set<int> s;
map<int,int> m;
int tren=0;
int seg1[MAXN*4],seg2[MAXN*4];

void dodaj(int l,int d,int p,int x,int k,int *seg){
    //if(seg==seg2)printf("    %d %d       kek\n",p,x);
    //else printf("    %d %d       lel\n",p,x);
    if(l==d){
        seg[k]=max(seg[k],x);
        return;
    }
    int mid=(l+d)/2;
    if(p<=mid)dodaj(l,mid,p,x,k+k,seg);
    else dodaj(mid+1,d,p,x,k+k+1,seg);
    seg[k]=max(seg[k+k],seg[k+k+1]);
}
int dobij(int l,int d,int tl,int td,int k,int *seg){
    if(l>td || d<tl)return 0;
    if(l>=tl && d<=td)return seg[k];
    int mid=(l+d)/2;
    return max(dobij(l,mid,tl,td,k+k,seg),dobij(mid+1,d,tl,td,k+k+1,seg));
}
int dp[MAXN][2];

int main()
{
    scanf("%d %d", &n, &d);
    for(int i=1;i<=n;i++)
        scanf("%d",niz+i);

    for(int i=1;i<=n;i++)
        s.insert(niz[i]);


    for(auto x:s){
        tren++;
        m[x]=tren;
    }
    for(int i=1;i<=n;i++){
        int tren=m[niz[i]];
        if(tren==1){
            dp[i][0]=1;
            dp[i][1]=1+dobij(1,n,1,m[*(--s.lower_bound(niz[i]+d))],1,seg1);
            dodaj(1,n,tren,dp[i][0],1,seg1);
            dodaj(1,n,tren,dp[i][1],1,seg2);
            //printf("     %d %d\n",niz[i],*(--s.lower_bound(niz[i]+d)));
        }else{
            dp[i][0]=1+dobij(1,n,1,tren-1,1,seg1);
            dp[i][1]=max(1+dobij(1,n,1,m[*(--s.lower_bound(niz[i]+d))],1,seg1), 1+dobij(1,n,1,tren-1,1,seg2));
            dodaj(1,n,tren,dp[i][0],1,seg1);
            dodaj(1,n,tren,dp[i][1],1,seg2);
            //printf("   %d %d\n",niz[i],*(--s.lower_bound(niz[i]+d)));
        }
        //printf("        %d %d\n",dp[i][0],dp[i][1]);

    }
    printf("%d",dp[n][1]);


    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &d);
     ~~~~~^~~~~~~~~~~~~~~~~
glo.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",niz+i);
         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 911 ms 26724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 154 ms 7144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 308 ms 14044 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -