Skip to main content

KQUERY

KQUERY - K-query


#include <iostream>
#include <algorithm>

#define pf(i) printf("%ld\n", i)
#define sf(i) scanf("%d", &i)
#define sl(i) scanf("%ld", &i)

using namespace std;

int n, q;
long int l, r, k;

struct node
{
    int l, r, p;
    int v;
};


node makenode(int v,int l, int r, int p)
{
    node temp;
    temp.v = v; //value
    temp.l = l; //left limit
    temp.r = r; //right limit
    temp.p = p; //position

    return temp;
}

bool comp(node a, node b)
{
    if(a.v == b.v)
    {
        return a.l > b.l;
    }

    return a.v > b.v;
}

void update(long int seg[], int l, int r, int index, int pos)
{
    if(l == r)
    {
        seg[index]++;
    }
    else
    {
        int mid = (l + r) / 2;

        if(pos <= mid)
        {
            update(seg, l, mid, 2 * index + 1, pos);
        }
        else
        {
            update(seg, mid + 1, r, 2 * index + 2, pos);
        }

        seg[index] = seg[2 * index + 1] + seg[2 * index + 2];
    }
}

long int query(long int seg[], int l, int r, int qs, int qe, int index)
{
    if(qs > r || qe < l)
        return 0;

    if(qs <= l && qe >= r)
        return seg[index];

    else
    {
        int mid = (l + r) / 2;

        long int p1 = query(seg, l, mid, qs, qe, 2 * index + 1);
        long int p2 = query(seg, mid + 1, r, qs, qe, 2 * index + 2);

        return p1 + p2;
    }
}

node arr[250000];
long int ans[250000];

int main()
{
    sf(n);

    long int seg[120000] = {0}; // max size 4 * n = 120000

    int index  = 0;
    for(int i = 0; i < n; i++)
    {
        sl(k);
        arr[index++] = makenode(k, 0, 0, i);
    }

    sf(q);

    for(int i = 0; i < q; i++)
    {
        sl(l),sl(r), sl(k);
        arr[index++] = makenode(k, l, r, i);
    }

    sort(arr, arr + index, comp);

    for(int i = 0; i < index; i++)
    {
        if(arr[i].l == 0) // means it is an array element
        {
            update(seg, 0, n - 1, 0, arr[i].p);
        }
        else // it is a query
        {
            ans[arr[i].p] = query(seg, 0, n - 1, arr[i].l - 1, arr[i].r - 1, 0);
        }
    }

    for(int i = 0; i < q; i++)
    {
        pf(ans[i]);
    }

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

GCJ101BB - Picking Up Chicks

Problem Link /* explanation     lets solve the problem only for 2 chicken.     s[i] = speed of chicken i     pos[i] = position of chicken i     if s[i] > s[i - 1] then no problem, just check whether both can reach b within time or not.     if s[i] < s[i - 1] then there is a chance that i can slow down i - 1.     lets say s[i] = 1 m/sec and s[i - 1] = 2 m/sec and time limit is T and point to reach is B.     for s[i] pos[i] can be at max B - T. if pos is greater than B-T it can not reach within Tsec.     and for s[i - 1] pos[i - 1] can be at max (B-T)*2. if pos[i - 1] > (B-T)*2 it can not reach within Tsec.     at T sec i will be at B and i - 1 will also be at B. at T - 1 i will be at B-T-1 and i-1 will be at B-T-2 and so on. as we can see i -1 will always be behind i. so there will not be any collision.     if i is pos[i] < B-T then i can reach B before T sec ...
Post a Comment
Read more

KOPC12A

KOPC12A - K12 - Building Construction #include <iostream> #include <cmath> #define REP(i, n) for(int i = 0; i < n; i++) using namespace std; const int N = 10005; int height[N]; int cost[N]; int n; //finds the total cost for height h long long int findCost(int h) {     long long c = 0; //cost     REP(i, n)     {         c += abs(h - height[i]) * cost[i];     }     return c; } int ternary_search(int l, int h) {     while(l <= h)     {         if(l == h)             break;         int mid1 = l + (h - l) / 3;         int mid2 = h - (h - l) / 3;         if(findCost(mid1) > findCost(mid2))             l = mid1 + 1;         else ...
Post a Comment
Read more

Cheese and Random Toppings

Problem Link #include <iostream> #include <vector> #include <cstring> using namespace std; #define LL long long int LL lucas(LL n,LL r,LL p) { LL ans=1,ncr[p][p]; memset(ncr, 0, sizeof ncr); for (int i = 0; i < p; ++i) { ncr[i][0]=1; } for (int i = 1; i < p; ++i) { for (int j = 1; j <= i; ++j) { ncr[i][j]=(ncr[i-1][j] + ncr[i-1][j-1])%p; } } while(n && r) { ans=(ans * ncr[n%p][r%p])%p; n/=p; r/=p; } return ans; } LL fastExpo(LL a, LL b, LL P) {   LL res = 1;   if(b==0) return 1; if(b==1) return a;   while (b) {     if (b & 1) {       res = (res * a) % P;     }     a = (a * a) % P;     b = b >> 1;   }   return res; } int main() { int t; cin>>t; while(t--) { long long int n,r,m,tm,ans=0; cin>>n>>r>>m; tm=m; for (int i = 2; i <= 50; ++i...
Post a Comment
Read more