Kyselyt

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n, q;

int countOfXUpto[202020][101];
int cnt[101];

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  cin>>n>>q;

  for (int i = 1; i <= n; i++) {
    int x; cin>>x;
    countOfXUpto[x][i]++;
    for (int j = 1; j <= 100; j++) {
      countOfXUpto[j][i] += countOfXUpto[j][i-1];
    }
  }
  
  for (int qi = 0; qi < q; qi++) {
    int a, b; cin>>a>>b;

    for (int j = 1; j <= 100; j++) {
      cnt[j] = countOfXUpto[j][b] - countOfXUpto[j][a-1];
    }

    int res = 0;
    for (int j = 100; j >= 1; j--) {
      for (int bottom = j / 2; bottom >= 1; bottom--) {
        int bcnt = cnt[bottom];
        int topcnt = cnt[j];
        int m = min(bcnt, topcnt);
        cnt[bottom] -= m;
        cnt[j] -= m;
        res += m;
        if (cnt[j] == 0) break;
      }
    }

    cout << res << "\n";
  }
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: RUNTIME ERROR

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED