| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1112446 |
2024-11-14T08:05:10 Z |
vjudge1 |
Baloni (COCI15_baloni) |
C++14 |
|
193 ms |
7248 KB |
#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;
cout<<endl;
int a[n];
multiset<int> st;
int cnt=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(st.find(a[i]+1)!=st.end())st.erase(a[i]+1);
else cnt++;
st.insert(a[i]);
}
cout<<cnt;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
352 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 5 |
Incorrect |
176 ms |
6480 KB |
Output isn't correct |
| 6 |
Incorrect |
193 ms |
7248 KB |
Output isn't correct |
| 7 |
Incorrect |
149 ms |
5968 KB |
Output isn't correct |
| 8 |
Incorrect |
161 ms |
5968 KB |
Output isn't correct |
| 9 |
Incorrect |
165 ms |
6224 KB |
Output isn't correct |
| 10 |
Incorrect |
162 ms |
6480 KB |
Output isn't correct |
