oj.uz

Submission #1038360

# Submission time Handle Problem Language Result Execution time Memory
1038360 2024-07-29T17:34:31 Z MrPavlito Baloni (COCI15_baloni) C++17
0 / 100
 39 ms 8308 KB 
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e6+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

int cnt[MAXN];
int niz[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;
        for(int i=0; i<n; i++)cin >> niz[i];
        for(int i=0; i<n; i++)
        {
            cnt[niz[i]]++;
            if(cnt[niz[i]+1] >0)
            {
                niz[i] = 0;
                cnt[niz[i]+1]--;
            }
        }
        int rez = 0;
        for(int i=0; i<n; i++)if(niz[i] != 0)rez++;
        cout << rez << endl;

    }
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Incorrect 36 ms 8308 KB Output isn't correct
6 Incorrect 37 ms 8280 KB Output isn't correct
7 Incorrect 39 ms 7512 KB Output isn't correct
8 Incorrect 29 ms 7368 KB Output isn't correct
9 Incorrect 35 ms 7764 KB Output isn't correct
10 Incorrect 33 ms 7768 KB Output isn't correct