oj.uz

Submission #827353

# Submission time Handle Problem Language Result Execution time Memory
827353 2023-08-16T11:46:22 Z OAleksa Baloni (COCI15_baloni) C++14
100 / 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;
			else
				cnt[a[i] + 1]--;
			cnt[a[i]]++;
		}
		cout << ans;
	}
   return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 3 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 3 ms 8148 KB Output is correct
5 Correct 46 ms 14336 KB Output is correct
6 Correct 47 ms 15060 KB Output is correct
7 Correct 38 ms 13780 KB Output is correct
8 Correct 37 ms 13780 KB Output is correct
9 Correct 42 ms 14116 KB Output is correct
10 Correct 42 ms 14364 KB Output is correct