Cod sursa(job #3269480)

Utilizator stefanrotaruRotaru Stefan-Florin stefanrotaru Data 19 ianuarie 2025 12:57:41
Problema Secventa 5 Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 3.61 kb
#include <fstream>
#include <vector>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	unsigned int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
} f("secv5.in");

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
} g("secv5.out");

int n, l, r, sz;

const int MOD = 666013;

long long a[2000005];

vector<pair<unsigned int, int>> hashMap[MOD];

inline void insertHash(unsigned int k)
{
    int key = k % MOD;

    for (int i = 0; i < (int) hashMap[key].size(); ++i) {
        if (hashMap[key][i].first == k) {
            hashMap[key][i].second++;
            return;
        }
    }

    sz++;
    hashMap[key].push_back({k, 1});
}

inline void eraseHash(unsigned int k)
{
    int key = k % MOD;

    for (int i = 0; i < (int) hashMap[key].size(); ++i) {
        if (hashMap[key][i].first == k) {

            hashMap[key][i].second--;

            if (hashMap[key][i].second == 0) {
                hashMap[key].erase(hashMap[key].begin() + i);
                sz--;
            }

            return;
        }
    }
}

inline long long twoPointers(int i)
{
    int st = 1;

    sz = 0;

    long long ans = 0;

    for (int dr = 1; dr <= n; ++dr) {
        insertHash(a[dr]);

        while (sz > i && st <= dr) {
            eraseHash(a[st]);

            st++;
        }

        ans += dr - st + 1;
    }

    for (int i = 0; i < MOD; ++i) {
        hashMap[i].clear();
    }

    return ans;
}

int main()
{
    f >> n >> l >> r;

    for (int i = 1; i <= n; ++i) {
        f >> a[i];
    }

    g << twoPointers(r) - twoPointers(l - 1);

    return 0;
}