Submission #456129

#TimeUsernameProblemLanguageResultExecution timeMemory
456129Blobo2_Blobo2Money (IZhO17_money)C++14
100 / 100
1140 ms58092 KiB
/* Editor: Abdelrahman Hossam Nickname: Blobo2_Blobo2 IOI next year isA :) */ /*#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")*/ #include<bits/stdc++.h> using namespace std; //#define int long long #define endl "\n" #define all(v) v.begin(),v.end() #define gen(arr,n,nxt) generate(arr,arr+n,nxt) #define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0); const int mo=1e9+7,INF=1e18; int nxt(){int x;cin>>x;return x;} signed main(){ Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty int n=nxt(),arr[n]; gen(arr,n,nxt); int cnt=0,last=-1; set<int>st; for(int i=0;i<n;i++){ auto it = st.lower_bound(arr[i]+1); if(last==-1) last = (it==st.end()?-2:(*it)); else{ int x = (it==st.end()?-2:(*it)); if(last!=x||(i-1>=0&&arr[i]<arr[i-1])){ if(arr[i]!=last) cnt++,last= x; } } st.insert(arr[i]); } cout<<cnt+1; return 0; }

Compilation message (stderr)

money.cpp:19:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int mo=1e9+7,INF=1e18;
      |                        ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...