oj.uz

Submission #877167

# Submission time Handle Problem Language Result Execution time Memory
877167 2023-11-23T02:20:33 Z noiaint Poklon (COCI17_poklon) C++17
140 / 140
 743 ms 27592 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

const int block = 750;

struct query {
    int l, r, id;
    query(int _l = 0, int _r = 0, int _id = 0) {
        l = _l;
        r = _r;
        id = _id;
    }
    bool operator < (const query &a) const {
        return l / block != a.l / block ? l / block < a.l / block : r < a.r;
    }
};

int n, q;
int a[N];
vector<query> queries;
int cnt[N];
int ans[N];
int res = 0;

void ins(int x) {
    cnt[x] += 1;
    if (cnt[x] == 2) ++res;
    if (cnt[x] == 3) --res;
}
void del(int x) {
    cnt[x] -= 1;
    if (cnt[x] == 2) ++res;
    if (cnt[x] == 1) --res;
}

void process() {
    cin >> n >> q;
    vector<int> values;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        values.push_back(a[i]);
    }
    sort(all(values));
    for (int i = 1; i <= n; ++i) a[i] = lower_bound(all(values), a[i]) - values.begin();

    for (int i = 1; i <= q; ++i) {
        int l, r;
        cin >> l >> r;
        queries.emplace_back(l, r, i);
    }       
    sort(all(queries));
    int L = 1, R = 1;
    ins(a[1]);
    for (auto [l, r, id] : queries) {
        while (L < l) del(a[L++]);
        while (L > l) ins(a[--L]);
        while (R < r) ins(a[++R]);
        while (R > r) del(a[R--]);
        ans[id] = res;
    }   

    for (int i = 1; i <= q; ++i) cout << ans[i] << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    int tc = 1;
    // cin >> tc;
    
    while (tc--) {
        process();
    }

    return 0;
}

/*

*/

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 2652 KB Output is correct
5 Correct 91 ms 8328 KB Output is correct
6 Correct 81 ms 8520 KB Output is correct
7 Correct 212 ms 15176 KB Output is correct
8 Correct 391 ms 20404 KB Output is correct
9 Correct 620 ms 23708 KB Output is correct
10 Correct 743 ms 27592 KB Output is correct