oj.uz

Submission #444505

# Submission time Handle Problem Language Result Execution time Memory
444505 2021-07-14T07:52:22 Z BT21tata Global Warming (CEOI18_glo) C++17
25 / 100
 2000 ms 1360 KB 
#include<bits/stdc++.h>
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
using namespace std;
const ll MOD=1e9+7;
// mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

int n, x, a[200005], ans, v[200005];

int bs(int l, int r, int k)
{
    ll mid;
    while(l<=r)
    {
        mid=(l+r)>>1;
        if(v[mid]>=k) r=mid-1;
        else l=mid+1;
    }
    return l;
}

int LIS()
{
    v[0]=a[0];
    int p=1;
    for(ll i=1; i<n; i++)
    {
        if(a[i]>v[p-1]) v[p++]=a[i];
        else v[bs(0,p,a[i])]=a[i];
    }
    return p;
}

int main()
{
    SPEED;
    cin>>n>>x;
    for(int i=0; i<n; i++)
        cin>>a[i];
    ans=LIS();
    for(int d=-x; d<=-1; d++)
    {
        for(int s=1; s<=n; s++)
        {
            // [i, i+s-1]
            for(int i=0; i+s-1<n; i++)
            {
                for(int j=i; j<=i+s-1; j++)
                    a[j]+=d;
                ans=max(ans, LIS());
                for(int j=i; j<=i+s-1; j++)
                    a[j]-=d;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 324 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 26 ms 204 KB Output is correct
15 Correct 5 ms 204 KB Output is correct
16 Correct 8 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Execution timed out 2072 ms 332 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 992 KB Output is correct
2 Correct 37 ms 1072 KB Output is correct
3 Correct 37 ms 972 KB Output is correct
4 Correct 38 ms 1088 KB Output is correct
5 Correct 25 ms 1360 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2017 ms 460 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2055 ms 692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 324 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 26 ms 204 KB Output is correct
15 Correct 5 ms 204 KB Output is correct
16 Correct 8 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Execution timed out 2072 ms 332 KB Time limit exceeded
20 Halted 0 ms 0 KB -