QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#795746	#7904. Rainbow Subarray	imwinter^#	WA	225ms	11428kb	C++20	2.6kb	2024-12-01 00:06:09	2024-12-01 00:06:10

Judging History

你现在查看的是最新测评结果

[2024-12-01 00:06:10]
评测

测评结果：WA
用时：225ms
内存：11428kb

查看

[2024-12-01 00:06:09]
提交

answer

#include <bits/stdc++.h>

using i64 = long long;

class Meidum {
private:
    std::multiset<i64> A, B;
    i64 SA, SB;

public:
    Meidum() : SA(0), SB(0) {}

    void init() {
        A.clear();
        B.clear();
        SA = SB = 0;
    }

    void insert(const i64& x) {
        if (B.empty()) {
            B.insert(x);
            SB += x;
            return;
        }

        i64 mid = *B.begin();
        if (x >= mid) {
            B.insert(x);
            SB += x;
            if (A.size() < B.size() - 1) {
                auto it = B.begin();
                SB -= *it;
                SA += *it;
                A.insert(*it);
                B.erase(it);
            }
        } else {
            A.insert(x);
            SA += x;
            if (A.size() > B.size()) {
                auto it = (--A.end());
                SA -= *it;
                SB += *it;
                B.insert(*it);
                A.erase(it);
            }
        }
    }

    void remove(const i64& x) {
        i64 mid = *B.begin();
        if (x >= mid) {
            B.erase(B.find(x));
            SB -= x;
            if (A.size() > B.size()) {
                auto it = (--A.end());
                SA -= *it;
                SB += *it;
                B.insert(*it);
                A.erase(it);
            }
        } else {
            A.erase(A.find(x));
            SA -= x;
            if (A.size() < B.size() - 1) {
                auto it = B.begin();
                SB -= *it;
                SA += *it;
                A.insert(*it);
                B.erase(it);
            }
        }
    }

    i64 calc() {
        i64 mid = *B.begin();
        return (mid * A.size() - SA) + (SB - mid * B.size());
    }
};

i64 sol(int n, int k, std::vector<i64>& a) {
    Meidum S;
    S.init();
    int ans = 0;
    for (int i = 1, j = 0; i <= n; ++i) {
        while (j < n) {
            S.insert(a[++j]);
            if (S.calc() > k) {
                S.remove(a[j--]);
                break;
            }
        }
        ans = std::max(ans, j - i + 1);
        S.remove(a[i]);
    }
    return ans;
}

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

    int _;
    std::cin >> _;
    while (_--) {
        int n, k;
        std::cin >> n >> k;
        std::vector<i64> a(n + 1);
        for (int i = 1; i <= n; ++i) {
            std::cin >> a[i];
            a[i] -= i;
        }

        std::cout << sol(n, k, a) << '\n';
    }

    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3548kb

input:

5
7 5
7 2 5 5 4 11 7
6 0
100 3 4 5 99 100
5 6
1 1 1 1 1
5 50
100 200 300 400 500
1 100
3

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 181ms

memory: 5780kb

input:

11102
2 167959139
336470888 134074578
5 642802746
273386884 79721198 396628655 3722503 471207868
6 202647942
268792718 46761498 443917727 16843338 125908043 191952768
2 717268783
150414369 193319712
6 519096230
356168102 262263554 174936674 407246545 274667941 279198849
9 527268921
421436316 3613460...

output:

result:

ok 11102 lines

Test #3:

score: -100

Wrong Answer

time: 225ms

memory: 11428kb

input:

1
500000 17244641009859
54748096 75475634 204928248 276927808 84875072 103158867 27937890 322595515 186026685 45468307 69240390 139887597 188586447 373764525 121365644 310156469 185188306 60350786 211308832 384695957 370562147 208427221 35937909 267590963 126478310 275357775 55361535 335993561 36696...

output:

result:

wrong answer 1st lines differ - expected: '172998', found: '92681'