oj.uz

Submission #568686

# Submission time Handle Problem Language Result Execution time Memory
568686 2022-05-26T05:11:46 Z Garguy22 Baloni (COCI15_baloni) C++17
0 / 100
 204 ms 3704 KB 
#include <iostream>
using namespace std;

const int MAXN = 1e6 + 7;

int a[MAXN], f[MAXN];

int main() {
    
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    int ans = 0;
    for(int i = n; i > 0; i--){
        f[a[i]]++;
        if(f[a[i]-1] == 1)
            f[a[i]-1]--;
        else
            ans++;
    }
    cout << ans << endl;

    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Incorrect 2 ms 340 KB Output isn't correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Incorrect 204 ms 3340 KB Output isn't correct
6 Incorrect 178 ms 3704 KB Output isn't correct
7 Incorrect 169 ms 3160 KB Output isn't correct
8 Incorrect 175 ms 3236 KB Output isn't correct
9 Incorrect 156 ms 3188 KB Output isn't correct
10 Incorrect 171 ms 3380 KB Output isn't correct