oj.uz

Submission #208286

# Submission time Handle Problem Language Result Execution time Memory
208286 2020-03-10T14:11:21 Z Neklixx Baloni (COCI15_baloni) C++14
100 / 100
 83 ms 7520 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define sh cin.tie(0); cin.sync_with_stdio(0); cout.tie(0);
#define FILE freopen("test.in", "r", stdin);
#define vprint(v) for (int ii = 0; ii < v.size(); ii++){cout << v[ii] << " ";}
#define debugv(v) if (v.size() != 0) {cout << "[ "; for (int __ = 0; __ < (int)(v.size()) - 1; __++){cout << v[__] << ", ";} cout << v[(int)(v.size()) - 1] << " ]" << endl;} else {cout << "[]" << endl;}
#define debug cout << "-----------------------------------------------" << endl;
#define print1(a) cout << "{ " << a << " }" << endl;
#define print2(a, b) cout << "{ " << a << ", " << b << " }" << endl;
#define print3(a, b, c) cout << "{ " << a << ", " << b << ", " << c << " }" << endl;
#define print4(a, b, c, d) cout << "{ " << a << ", " << b << ", " << c << ", " << d << " }" << endl;
using namespace std;
//#define int long long
const int INF = 1e9 + 228;
const int MAXN = 1e6 + 228;
int cnt[MAXN];
signed main()
{
#ifdef LOCAL
    FILE;
#endif
    sh;
	int n, ans = 0;
	vector<int> v;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int aa;
		cin >> aa;
		v.pb(aa);
	}    
	for (int i = 0; i < n; i++) {
		if (cnt[v[i]] == 0) {
			cnt[v[i]]++;
			ans++;
		}
		cnt[v[i]]--;
		cnt[v[i] - 1]++;
	}
	cout << ans << endl;
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 83 ms 7144 KB Output is correct
6 Correct 81 ms 7520 KB Output is correct
7 Correct 68 ms 6892 KB Output is correct
8 Correct 70 ms 7056 KB Output is correct
9 Correct 73 ms 7020 KB Output is correct
10 Correct 78 ms 6888 KB Output is correct