Key cutting

input/code.cpp: In function 'int main()':
input/code.cpp:45:18: warning: unused variable 'ok' [-Wunused-variable]
   45 |             bool ok = true;
      |                  ^~
input/code.cpp:47:17: warning: unused variable 'mi2' [-Wunused-variable]
   47 |             int mi2 = 1000000001;
      |                 ^~~

#include <bits/stdc++.h>

// g++ -std=c++17 k.cpp -o k
using namespace std;
int s[10101010];
int n;
unordered_map<int, int> lahin;

int hae(int a, int b){
    a +=n; b+=n;
    int mi = 1000000001;
    while(a<=b){
        if(a%2==1) mi = min(mi, s[a++]);
        if(b%2==0) mi = min(mi, s[b--]);
        a/=2; b/=2;
    }
    return mi;
}
void add(int k, int x){
    k+=n;
    s[k]=x;
    for (k /=2; k>=1; k/=2){
        s[k] = min(s[k*2], s[k*2+1]);
    }
}

int main() {
     cin >> n;
    for (int i = 0; i < n;++i){
        int oof;
        cin >> oof;
        add(i, oof);
    }
    unordered_set<int> f;
    int cuts = 0;
    for (int i = 0; i < n; ++i){
        auto coun = lahin.count(s[i+n]);
        //cout << "etsitaaan " << s[i+n] << " " << coun << endl;
        if (coun==0){
            //cout << "ei loyd " << i << " " << s[i+n] << endl;
            cuts += 1;
            lahin[s[i+n]] = i;
        } else {
            auto lah = lahin[s[i+n]];
            bool ok = true;
            int mi = hae(lah+1, i);
            int mi2 = 1000000001;
            //for (int j = i-1; j > lah; --j){
            //    mi2 = min(mi2, s[j+n]);
            //}
            //cout << "loyd " << mi << " " << s[i+n] << endl;
            if (mi < s[i+n]){
                //cout << "lis 1" << endl;
                cuts += 1;
            }
            lahin[s[i+n]] = i;
        }
    }
    cout << cuts << endl;
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER