Submission #158639

#TimeUsernameProblemLanguageResultExecution timeMemory
158639GoldNextYearBaloni (COCI15_baloni)C++14
0 / 100
325 ms6924 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 340 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1000000007; const ll mod2=998244353; const ll inf=1e18*4; const ld pai=acos(-1); int n; int a[1000009]; map<int,int>num; int main(){ fast; cin>>n; int ans=0; for(int i=0;i<n;i++)cin>>a[i],num[a[i]]++; for(int i=0;i<n;i++){ if(num[a[i]]==0)C; ans++; int crnt=a[i]; while(crnt){ if(num[crnt]==0)break; num[crnt]--; crnt--; } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...