oj.uz

Submission #129488

# Submission time Handle Problem Language Result Execution time Memory
129488 2019-07-12T09:47:39 Z OptxPrime Global Warming (CEOI18_glo) C++11
100 / 100
 71 ms 4344 KB 
#include <iostream>
#include <cmath>
#include<vector>
#include <algorithm>
#include <utility>
#include<stack>
#include<queue>
#include<map>
#include <fstream>
 
using namespace std;
 
#define pb push_back
#define mp make_pair
#define ll long long
 
#define ans Answer
#define query Query
 
    int a[200010],sol[200010];
     int tail[200010];
 
    /*bool cmp( int x, int y )
    {
        if( x > y ) return true;
        return false;
    }*/
    /// Wa bez razloga
 
    int pos( int lo,int hi, int val )
    {
        int ans=0;
            while( lo<=hi ){
                int mid=lo + (hi-lo)/2;
                if( tail[mid] > val ){
                    ans=max( ans, mid );
                    lo=mid+1;
                }
                else hi=mid-1;
            }
            return ans;
    }
 
    int main()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
 
        int n,x;
        int res=0;
        cin>>n>>x;
        for( int i=1;i<=n;i++ ) cin>>a[i];
        tail[1] = a[n] + x;
        sol[n]=1;
       int len=2;
        for( int i=n-1;i>0;i-- ){
            if( a[i] + x >= tail[1] ) {
                tail[1] = a[i]+x, sol[i] = 1;
            }
            else if( a[i]+x < tail[len-1] ) tail[len++]=a[i]+x, sol[i] = len-1;
            else{
                int idx = pos( 1,len-1, a[i]+x )+1;
                tail[idx] = a[i]+x;
                sol[i]=idx;
            }
        }
        res=len-1;
        for(int i=0;i<len;i++) tail[i]=0;
        tail[1]=a[1];
        len=2;
 
        for( int i=2;i<=n;i++ ){
            if( a[i]+x < tail[1] ) res = max( res, sol[i] ); /// ne mozemo ga ljevo nadovezat
            else if( a[i] + x > tail[len-1] ) {
                    res=max( res, len + sol[i] - 1 ) ; ///-1 jer ga racunamo dvaput
            }
            else{
                int idx = lower_bound( tail+1, tail+len, a[i]+x ) - tail;
                res=max( res, idx + sol[i] - 1 );
            }
            if( a[i] < tail[1]  ) tail[1]=a[i];
            else if( a[i] > tail[len-1] ) tail[len++]=a[i];
            else {
		int idx=lower_bound(tail+1,tail+len,a[i] ) - tail;
		tail[idx]=a[i];
           }
 
        }
        cout<<res<<endl;
      return 0;
    }

Subtask #1
5.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 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct

Subtask #2
10.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 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #3
13.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 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 428 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 3804 KB Output is correct
2 Correct 70 ms 3832 KB Output is correct
3 Correct 70 ms 3876 KB Output is correct
4 Correct 70 ms 3832 KB Output is correct
5 Correct 32 ms 3448 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1148 KB Output is correct
2 Correct 18 ms 1272 KB Output is correct
3 Correct 18 ms 1272 KB Output is correct
4 Correct 9 ms 1144 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 9 ms 1144 KB Output is correct
7 Correct 15 ms 1272 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2168 KB Output is correct
2 Correct 29 ms 2168 KB Output is correct
3 Correct 58 ms 3796 KB Output is correct
4 Correct 32 ms 3448 KB Output is correct
5 Correct 16 ms 1912 KB Output is correct
6 Correct 24 ms 3320 KB Output is correct
7 Correct 31 ms 4216 KB Output is correct
8 Correct 25 ms 2168 KB Output is correct

Subtask #7
25.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 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 428 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 70 ms 3804 KB Output is correct
28 Correct 70 ms 3832 KB Output is correct
29 Correct 70 ms 3876 KB Output is correct
30 Correct 70 ms 3832 KB Output is correct
31 Correct 32 ms 3448 KB Output is correct
32 Correct 18 ms 1148 KB Output is correct
33 Correct 18 ms 1272 KB Output is correct
34 Correct 18 ms 1272 KB Output is correct
35 Correct 9 ms 1144 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 9 ms 1144 KB Output is correct
38 Correct 15 ms 1272 KB Output is correct
39 Correct 29 ms 2168 KB Output is correct
40 Correct 29 ms 2168 KB Output is correct
41 Correct 58 ms 3796 KB Output is correct
42 Correct 32 ms 3448 KB Output is correct
43 Correct 16 ms 1912 KB Output is correct
44 Correct 24 ms 3320 KB Output is correct
45 Correct 31 ms 4216 KB Output is correct
46 Correct 25 ms 2168 KB Output is correct
47 Correct 48 ms 2140 KB Output is correct
48 Correct 36 ms 2216 KB Output is correct
49 Correct 71 ms 3888 KB Output is correct
50 Correct 31 ms 3576 KB Output is correct
51 Correct 26 ms 2812 KB Output is correct
52 Correct 32 ms 3552 KB Output is correct
53 Correct 26 ms 3576 KB Output is correct
54 Correct 32 ms 4344 KB Output is correct
55 Correct 56 ms 3832 KB Output is correct