#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <string.h>
#include <bitset>
#include <numeric>
#include <utility>
using namespace std;
#define ll long long
const int nax = 300'001;
int sq = 500;
ll N, K, t[nax], zers[nax];
vector<ll>SQE[nax / 500 + 5];
vector<ll>ps[nax / 500 + 5];
void inicjuj(int n, int k, int *D)
{
sq = (int)sqrt(n);
for (int i = 0; i < n; i++)
{
t[i] = D[i];
SQE[i / sq].push_back(t[i]);
}
N = n, K = k;
for (int i = 0; i <= n / sq; i++){
ps[i].resize(SQE[i].size());
sort(SQE[i].begin(), SQE[i].end());
SQE[i].erase(unique(SQE[i].begin(),SQE[i].end()),SQE[i].end());
for (int j = i * sq; j < n && j /sq == i; j++){
int pos = lower_bound(SQE[i].begin(), SQE[i].end(), t[j]) - SQE[i].begin();
ps[i][pos]++;
}
for (int j = ps[i].size() - 2; j >= 0; j--){
ps[i][j] += ps[i][j + 1];
}
}
}
void podlej(int a, int b)
{
//--a,--b;
for (int i = a / sq; i * sq <= b; i++){
// cout << i << endl;
if (a <= i * sq && b >= (i + 1) * sq - 1){
zers[i]++;
}else{
SQE[i].clear();
for (int j = max(a,sq*i); j / sq == i && j <= b; j++){
t[j]+=zers[i];
SQE[i].push_back(t[j] + 1);
t[j]++;
}
zers[i] = 0;
sort(SQE[i].begin(), SQE[i].end());
SQE[i].erase(unique(SQE[i].begin(),SQE[i].end()),SQE[i].end());
ps[i].clear();
ps[i].resize(SQE[i].size());
for (int j = max(a,sq*i); j / sq == i && j <= b; j++){
int pos = lower_bound(SQE[i].begin(), SQE[i].end(), t[j]) - SQE[i].begin();
ps[i][pos]++;
}
for (int j = ps[i].size() - 2; j >= 0; j--){
ps[i][j] += ps[i][j + 1];
}
}
}
}
int dojrzale(int a, int b)
{
// --a,--b;
int ans = 0;
for (int i = a / sq; i * sq <= b; i++){
if (a <= i * sq && b >= (i + 1) * sq - 1){
int pos = lower_bound(SQE[i].begin(), SQE[i].end(), K - zers[i]) - SQE[i].begin();
if (pos < SQE[i].size())ans += ps[i][pos];
}else{
for (int j = max(a, i * sq); j / sq == i && j <= b; j++){
if (t[j] + zers[i] >= K)++ans;
}
}
}
return ans;
}
Compilation message
kon.cpp: In function 'void inicjuj(int, int, int*)':
kon.cpp:26:19: error: 'sqrt' was not declared in this scope; did you mean 'sq'?
26 | sq = (int)sqrt(n);
| ^~~~
| sq
kon.cpp: In function 'int dojrzale(int, int)':
kon.cpp:87:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
87 | if (pos < SQE[i].size())ans += ps[i][pos];
| ~~~~^~~~~~~~~~~~~~~
