oj.uz

Submission #237569

# Submission time Handle Problem Language Result Execution time Memory
237569 2020-06-07T11:12:33 Z Nucleist Global Warming (CEOI18_glo) C++14
100 / 100
 833 ms 30048 KB 
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define EPS 0.000001
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
void setIO(string s) {
  ios_base::sync_with_stdio(0); cin.tie(0); 
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str(),"w",stdout);
}
ll dp[200001],lis[200001],shift[200001],seg[800001],mak[200001],yo[200001];
ll n,x;
vedos hed;
ve mol;
set<dos>kol;
void up(ll p,ll l,ll r,ll index,ll val){
  if(l>index || r<index)return;
  if(l==r && l==index){
    seg[p]=val;
    return;
  }
  ll med=(l+r)/2;
  if(med>=index)up(p*2,l,med,index,val);
  else up(p*2+1,med+1,r,index,val);
  seg[p]=max(seg[p*2],seg[p*2+1]);
}
ll quer(ll p,ll l,ll r,ll l1,ll r1){
  if(l>r)return 0;
  if(l>r1 || l1>r)return 0;
  if(l>=l1 && r<=r1)return seg[p];
  ll med=(l+r)/2;
  return max(quer(p*2,l,med,l1,r1),quer(p*2+1,med+1,r,l1,r1));
}
int main()
{
  //flash;
  cin>>n>>x;
  for (ll i = 0; i < n; ++i)
  {
    ll yo;cin>>yo;
    hed.pb({yo,i}),mol.pb(yo),kol.insert({yo,i});
  }
  sort(all(hed));
  ll last=MOD;
  ll indexi=n;
  for (ll i = n-1; i >= 0 ; --i)
  {
    if(hed[i].first!=last){
      last=hed[i].first;
      indexi=i+1;
    }
    yo[hed[i].second]=indexi;
    mak[hed[i].second]=i;
  }
  for (ll i = n-1; i >= 0; --i)
  {
    ll ko=1;
    ll fo=quer(1,0,n-1,yo[i],n-1);
    ko=max(ko,fo+1);
    lis[i]=ko;
    up(1,0,n-1,mak[i],ko);
  }
  for (int i = 0; i < n; ++i)
  {
    up(1,0,n-1,i,0);
  }
  last=MOD;
  indexi=-1;
  for (ll i = 0; i < n; ++i)
  {
    if(hed[i].first!=last){
      last=hed[i].first;
      indexi=i-1;
    }
    yo[hed[i].second]=indexi;
  }
  for (int i = 0; i < n; ++i)
  {
    ll ko=1;
    ll fo=quer(1,0,n-1,0,yo[i]);
    ko=max(ko,fo+1);
    dp[i]=ko;
    up(1,0,n-1,mak[i],ko);
  }
  for (int i = 0; i < n; ++i)
  {
    up(1,0,n-1,i,0);
  }
  ll ans=0;
  for (int i = 0; i < n; ++i)
  {
    ll cur=mol[i]+x;
    auto u=kol.lower_bound({cur,-INF});
    if(u!=kol.begin()){
      u--;
      ll so=quer(1,0,n-1,0,mak[(*u).second]);
      ans=max(ans,so+lis[i]);
    }
    ll ko=1;
    ll fo=quer(1,0,n-1,0,yo[i]);
    ko=max(ko,fo+1);
    up(1,0,n-1,mak[i],ko);
    ans=max(ans,dp[i]+lis[i]-1);
  }
  cout<<ans;
  return 0;
}
//code the AC sol !
// BS/queue/map

Compilation message

glo.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
glo.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
glo.cpp: In function 'void setIO(std::__cxx11::string)':
glo.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen((s+".in").c_str(),"r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen((s+".out").c_str(),"w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 817 ms 29968 KB Output is correct
2 Correct 797 ms 29928 KB Output is correct
3 Correct 807 ms 30044 KB Output is correct
4 Correct 833 ms 30044 KB Output is correct
5 Correct 420 ms 29336 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 7788 KB Output is correct
2 Correct 136 ms 7708 KB Output is correct
3 Correct 141 ms 7796 KB Output is correct
4 Correct 99 ms 7532 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 99 ms 7544 KB Output is correct
7 Correct 129 ms 7792 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 15356 KB Output is correct
2 Correct 271 ms 15076 KB Output is correct
3 Correct 613 ms 29916 KB Output is correct
4 Correct 407 ms 29152 KB Output is correct
5 Correct 199 ms 14820 KB Output is correct
6 Correct 381 ms 27996 KB Output is correct
7 Correct 375 ms 28764 KB Output is correct
8 Correct 223 ms 15076 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 7 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 817 ms 29968 KB Output is correct
28 Correct 797 ms 29928 KB Output is correct
29 Correct 807 ms 30044 KB Output is correct
30 Correct 833 ms 30044 KB Output is correct
31 Correct 420 ms 29336 KB Output is correct
32 Correct 142 ms 7788 KB Output is correct
33 Correct 136 ms 7708 KB Output is correct
34 Correct 141 ms 7796 KB Output is correct
35 Correct 99 ms 7532 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 99 ms 7544 KB Output is correct
38 Correct 129 ms 7792 KB Output is correct
39 Correct 272 ms 15356 KB Output is correct
40 Correct 271 ms 15076 KB Output is correct
41 Correct 613 ms 29916 KB Output is correct
42 Correct 407 ms 29152 KB Output is correct
43 Correct 199 ms 14820 KB Output is correct
44 Correct 381 ms 27996 KB Output is correct
45 Correct 375 ms 28764 KB Output is correct
46 Correct 223 ms 15076 KB Output is correct
47 Correct 327 ms 15076 KB Output is correct
48 Correct 330 ms 15216 KB Output is correct
49 Correct 791 ms 29660 KB Output is correct
50 Correct 408 ms 29148 KB Output is correct
51 Correct 319 ms 22876 KB Output is correct
52 Correct 436 ms 29148 KB Output is correct
53 Correct 391 ms 29276 KB Output is correct
54 Correct 405 ms 29988 KB Output is correct
55 Correct 559 ms 30048 KB Output is correct