#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
int a[n];
set<int> st;
int cnt=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(st.find(a[i]+1)==st.end())cnt++;
st.insert(a[i]);
}
cout<<cnt;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
5 |
Incorrect |
111 ms |
6748 KB |
Output isn't correct |
6 |
Incorrect |
103 ms |
7248 KB |
Output isn't correct |
7 |
Incorrect |
93 ms |
6224 KB |
Output isn't correct |
8 |
Incorrect |
79 ms |
5968 KB |
Output isn't correct |
9 |
Incorrect |
93 ms |
6480 KB |
Output isn't correct |
10 |
Incorrect |
97 ms |
6648 KB |
Output isn't correct |