Submission #818922

#	Time	Username	Problem	Language	Result	Execution time	Memory
818922		vjudge1	Poklon (COCI17_poklon)	C++17	140 / 140	705 ms	44756 KiB

poklon

#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()

using namespace std;

const int N = 1e6+7;
const int oo = 1e9+7;

int n, q;
int s[4 * N], a[N], pre[N], res[N],idx[N];
vector<pair<int, int>> v[N];
vector<int>b;
map<ll, int> mp;

void update(int id, int l, int r, int x, int val)
{
    if (l > x || r < x)
        return;
    if (l == r)
    {
        s[id] += val;
        return;
    }

    int mid = (l + r) /2;
    update(id * 2, l, mid, x, val);
    update(id * 2 + 1, mid + 1, r, x, val);
    s[id] = s[id * 2] + s[id * 2 + 1];
}

ll get(int id, int l, int r, int x, int y)
{
    if (l > y || r < x)
        return 0;
    if (x <= l && r <= y)
        return s[id];

    int mid = (l + r) / 2;
    return get(id * 2, l, mid, x, y) + get(id * 2 + 1, mid + 1, r, x, y);
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen(".INP", "r", stdin);
//    freopen(".OUT", "w", stdout);
    cin>> n>> q;
    for (int i = 1; i <= n; i++)
    {
        cin>> a[i];
       //b.pb(a[i]);

        idx[i] = mp[a[i]];
        mp[a[i]] = i;
    }
    sort(b.begin(),b.end());
    for (int i = 1; i <= q; i++)
    {
        int l, r;
        cin>> l>> r;
        v[r].pb({l, i});
    }
//    for (int i = 1; i <= n; i++) {
//        int p = lower_bound(all(b),a[i]) - b.begin() + 1;
//        idx[i] = pre[p];
//        pre[p] = i;
//    }
    for (int i = 1; i <= n; i++)
    {
        int x = idx[i];
        int y = idx[x];
        int z = idx[y];
        if (x > 0)
            update(1, 1, n, x, 1);
        if (y > 0)
            update(1, 1, n, y, -2);
        if(z) update(1,1,n,z,1);
        for (auto l:v[i])
            res[l.se] = get(1, 1, n, l.fi, i);
    }
    for (int i = 1; i <= q; i++)
        cout<< res[i]<< '\n';
    return 0;
}

• Subtask 1: 140 / 140