oj.uz

Submission #538121

# Submission time Handle Problem Language Result Execution time Memory
538121 2022-03-16T05:59:30 Z DJ035 Global Warming (CEOI18_glo) C++17
10 / 100
 2000 ms 4336 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <bits/stdc++.h>
#define MEM 1111111
#define sanic ios_base::sync_with_stdio(0)
#define x first
#define y second
#define pf push_front
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz size()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll INF = 1e17+7;
const ll MOD = 998244353;
ll gcd(ll a, ll b){
    if(a%b) return gcd(b, a%b);
    return b;
}
ll t,n,m,a,b,x;
ll ls(vector<ll> l){
    ll ret=0;
    vector<int> lis;
    lis.pb(0);
    for(int i=0; i<n; i++){
        if(lis.back()<l[i])
            lis.pb(l[i]);
        else{
            int idx=lower_bound(lis.begin(), lis.end(), l[i])-lis.begin();
            lis[idx] = l[i];
        }
    }
    ret = lis.sz-1;
    return ret;
}
signed main(){
    sanic; cin.tie(0);
    cin >> n >> x;
    vector<ll> d;
    for(int i=0; i<n; i++){
        ll q;
        cin >> q;
        d.pb(q);
    }
    ll ans=ls(d);
    if(!x){
        cout << ans;
        return 0;
    }
    for(int j=0; j<n; j++){
        vector<ll> g;
        g = d;
        for(int l=0; l<=j; l++)
            g[l] += x;
        ans = max(ls(g), ans);
        g = d;
        for(int l=0; l<=j; l++)
            g[l] -= x;
        ans = max(ls(g), ans);
    }
    cout << ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3556 KB Output is correct
2 Correct 32 ms 3528 KB Output is correct
3 Correct 37 ms 3484 KB Output is correct
4 Correct 45 ms 3568 KB Output is correct
5 Correct 25 ms 4336 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2073 ms 1752 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 2086 ms 2940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

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