oj.uz

Submission #920146

# Submission time Handle Problem Language Result Execution time Memory
920146 2024-02-02T06:27:27 Z Muhammad_Aneeq Global Warming (CEOI18_glo) C++17
62 / 100
 46 ms 9164 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/
 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int const N=2e5+10;
int a[N]={};
int n;
inline void solve()
{
    int x;
    cin>>n>>x;
    for (int i=0;i<n;i++)
        cin>>a[i];
    int ans=0;
    vector<int>dp;
    pair<int,int> pre[n+1]={};
    pre[0]={0,-1e9-10};
    for (int i=0;i<n;i++)
    {
        int z=lower_bound(begin(dp),end(dp),a[i])-begin(dp);
        if (z==dp.size())
            dp.push_back(a[i]);
        else
            dp[z]=a[i];
        pre[i+1]={dp.size(),dp.back()};
    }
    for (int i=0;i<n;i++)
        a[i]=-a[i];
    reverse(a,a+n);
    dp={};
    pair<int,int>suf[n+1]={};
    suf[0]={0,-1e9-10};
    for (int i=0;i<n;i++)
    {
        int z=lower_bound(begin(dp),end(dp),a[i])-begin(dp);
        if (z==dp.size())
            dp.push_back(a[i]);
        else
            dp[z]=a[i];
        suf[i+1]={dp.size(),-dp.back()};
    }
    for (int i=0;i<n;i++)
    {  
        if (pre[i].second-suf[n-i].second<x)
            ans=max(ans,pre[i].first+suf[n-i].first);
    }
    cout<<ans<<endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Compilation message

glo.cpp: In function 'void solve()':
glo.cpp:28:14: 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]
   28 |         if (z==dp.size())
      |             ~^~~~~~~~~~~
glo.cpp:43:14: 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]
   43 |         if (z==dp.size())
      |             ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Incorrect 1 ms 344 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 8280 KB Output is correct
2 Correct 40 ms 8212 KB Output is correct
3 Correct 40 ms 8192 KB Output is correct
4 Correct 38 ms 8272 KB Output is correct
5 Correct 22 ms 9164 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2392 KB Output is correct
2 Correct 10 ms 2392 KB Output is correct
3 Correct 10 ms 2392 KB Output is correct
4 Correct 6 ms 2524 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 6 ms 2524 KB Output is correct
7 Correct 8 ms 2392 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4352 KB Output is correct
2 Correct 21 ms 4184 KB Output is correct
3 Correct 46 ms 8152 KB Output is correct
4 Correct 23 ms 9092 KB Output is correct
5 Correct 11 ms 4824 KB Output is correct
6 Correct 22 ms 8660 KB Output is correct
7 Correct 24 ms 8664 KB Output is correct
8 Correct 16 ms 4184 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Incorrect 1 ms 344 KB Output isn't correct
20 Halted 0 ms 0 KB -