oj.uz

Submission #827127

# Submission time Handle Problem Language Result Execution time Memory
827127 2023-08-16T09:01:34 Z OAleksa Baloni (COCI15_baloni) C++14
0 / 100
 47 ms 15060 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std; 
#define int long long
const int maxn = 1e6 + 69;
vector<int> cnt(maxn);
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while(tt--) {
		int n;
		cin >> n;
		vector<int> a(n);
		for(int i = 0;i < n;i++)
			cin >> a[i];
		int ans = 1;
		cnt[a[0]] = 1;
		for(int i = 1;i < n;i++) {
			if(!cnt[a[i] + 1])
				++ans;
			cnt[a[i]]++;
			cnt[a[i] + 1]--;
		}
		cout << ans;
	}
   return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 8148 KB Output isn't correct
2 Incorrect 3 ms 8148 KB Output isn't correct
3 Incorrect 3 ms 8148 KB Output isn't correct
4 Incorrect 3 ms 8148 KB Output isn't correct
5 Incorrect 47 ms 14292 KB Output isn't correct
6 Incorrect 46 ms 15060 KB Output isn't correct
7 Incorrect 39 ms 13872 KB Output isn't correct
8 Incorrect 41 ms 13796 KB Output isn't correct
9 Incorrect 42 ms 14116 KB Output isn't correct
10 Incorrect 41 ms 14292 KB Output isn't correct