Submission #1139278

#	Time	Username	Problem	Language	Result	Execution time	Memory
1139278		THXuan	Baloni (COCI15_baloni)	C++20	0 / 100	161 ms	3968 KiB

baloni

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
typedef long long ll;
using namespace std;

void solve()
{
    int n; cin >> n;
    vector<int>v(n);
    for (int i = 0; i < n; i++)cin >> v[i];
    int ans = 0;
    map<int, int>visited;
    for (int i = 0; i < n; i++) {
        if (!visited[v[i] + 1])++ans;
        else visited[v[i] + 1] = 0;
        visited[v[i]]++;
    }
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;// cin >> t;
    while (t--) solve();
    return 0;
}

• Subtask 1: 0 / 100