# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40703 | Hassoony | Baloni (COCI15_baloni) | C++14 | 321 ms | 604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=1e6+9;
int n,a[MX],ans,x;
set<int>s;
int main(){
cin>>n;
for(int i=0;i<n;i++){
scanf("%d",&x);
if(s.find(x)!=s.end()){
s.erase(s.find(x));
x--;
if(x>=1)s.insert(x);
continue;
}
else s.insert(x-1),ans++;
}
cout<<ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |