oj.uz

Submission #546362

# Submission time Handle Problem Language Result Execution time Memory
546362 2022-04-07T11:21:41 Z urosk Global Warming (CEOI18_glo) C++14
100 / 100
 51 ms 7784 KB 
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;

typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}

void setIO(string inoutname)
{
	freopen((inoutname+".in").c_str(),"r",stdin);
    	freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
   if(b==0) return a;
   if(a==0) return b;
   if(a>=b)  return gcd(a%b,b);
   return  gcd(a,b%a);
}
ll lcm(ll a,ll b){
   return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
	if(x==mod) x = 0;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
ll po(ll x,ll y){
    if(y==0) return 1LL;
    ll ans = po(x,y/2);
    ans = mul(ans,ans);
    if(y&1) ans = mul(ans,x);
    return ans;
}
ll inv(ll x){return po(x,mod-2);}

#define maxn 200005
ll a[maxn];
ll n,x;
ll l[maxn];
ll r[maxn];
void tc(){
	daj_mi_malo_vremena
    cin >> n >> x;
    for(ll i = 1;i<=n;i++) cin >> a[i];
    vector<ll> dp;
    for(ll i = 1;i<=n;i++){
        ll j = lower_bound(all(dp),a[i]) - dp.begin();
        if(j==sz(dp)){
            dp.pb(a[i]);
        }else{
            dp[j] = a[i];
        }
        l[i] = j+1;
    }
    dp.clear();
    reverse(a+1,a+n+1);
    for(ll i = 1;i<=n;i++) a[i] = -a[i];
    for(ll i = 1;i<=n;i++){
        ll j = lower_bound(all(dp),a[i]+x) - dp.begin();
        r[i] = j+1;
        j = lower_bound(all(dp),a[i]) - dp.begin();
        if(j==sz(dp)){
            dp.pb(a[i]);
        }else{
            dp[j] = a[i];
        }
    }
    reverse(r+1,r+n+1);
    ll ans = 0;
    for(ll i = 1;i<=n;i++) ans = max(ans,l[i] + r[i] - 1);
    cout<<ans<<endl;
}
int main(){
	daj_mi_malo_vremena
	//setIO("lol");
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}

Compilation message

glo.cpp: In function 'void setIO(std::string)':
glo.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:49:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 6868 KB Output is correct
2 Correct 50 ms 6860 KB Output is correct
3 Correct 49 ms 6876 KB Output is correct
4 Correct 48 ms 6892 KB Output is correct
5 Correct 30 ms 6984 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1980 KB Output is correct
2 Correct 14 ms 2036 KB Output is correct
3 Correct 12 ms 1984 KB Output is correct
4 Correct 8 ms 2136 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 2140 KB Output is correct
7 Correct 10 ms 2012 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3620 KB Output is correct
2 Correct 29 ms 3564 KB Output is correct
3 Correct 44 ms 6880 KB Output is correct
4 Correct 31 ms 7120 KB Output is correct
5 Correct 14 ms 3720 KB Output is correct
6 Correct 24 ms 6776 KB Output is correct
7 Correct 29 ms 7416 KB Output is correct
8 Correct 19 ms 3660 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 51 ms 6868 KB Output is correct
28 Correct 50 ms 6860 KB Output is correct
29 Correct 49 ms 6876 KB Output is correct
30 Correct 48 ms 6892 KB Output is correct
31 Correct 30 ms 6984 KB Output is correct
32 Correct 11 ms 1980 KB Output is correct
33 Correct 14 ms 2036 KB Output is correct
34 Correct 12 ms 1984 KB Output is correct
35 Correct 8 ms 2136 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 2140 KB Output is correct
38 Correct 10 ms 2012 KB Output is correct
39 Correct 22 ms 3620 KB Output is correct
40 Correct 29 ms 3564 KB Output is correct
41 Correct 44 ms 6880 KB Output is correct
42 Correct 31 ms 7120 KB Output is correct
43 Correct 14 ms 3720 KB Output is correct
44 Correct 24 ms 6776 KB Output is correct
45 Correct 29 ms 7416 KB Output is correct
46 Correct 19 ms 3660 KB Output is correct
47 Correct 24 ms 3528 KB Output is correct
48 Correct 25 ms 3556 KB Output is correct
49 Correct 49 ms 6896 KB Output is correct
50 Correct 28 ms 6984 KB Output is correct
51 Correct 24 ms 5508 KB Output is correct
52 Correct 32 ms 7112 KB Output is correct
53 Correct 25 ms 7144 KB Output is correct
54 Correct 30 ms 7784 KB Output is correct
55 Correct 38 ms 6852 KB Output is correct