QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#657462 | #7904. Rainbow Subarray | Dynamic_Pigeon | TL | 1282ms | 6256kb | C++20 | 2.5kb | 2024-10-19 14:48:34 | 2024-10-19 14:48:38 |
Judging History
answer
#include <bits/stdc++.h>
#include <iterator>
#ifdef DYNAMIC_PIGEON
#include "algo/debug.h"
#else
#define debug(...) 114514
#endif
#define Dynamic_Pigeon 0
using i64 = std::int64_t;
using u64 = std::uint64_t;
using u32 = std::uint32_t;
constexpr i64 MOD = i64(1e9) + 7;
constexpr int INF = 1e9;
constexpr i64 INF_LONG_LONG = 1e18;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
struct Node {
std::multiset<int> l, r;
i64 pre = 0, lst = 0;
int get_mid() {
return *l.rbegin();
}
void insert(int x) {
if (l.empty() || x > *l.rbegin()) {
r.insert(x);
lst += x;
} else {
l.insert(x);
pre += x;
}
if (r.size() + 1 < l.size()) {
i64 p = l.extract(std::prev(l.end())).value();
lst += p;
pre -= p;
r.emplace(p);
}
if (l.size() < r.size()) {
i64 p = r.extract(r.begin()).value();
lst -= p;
pre += p;
l.emplace(p);
}
}
void erase(int x) {
if (x > *l.rbegin()) {
lst -= x;
r.extract(x);
} else {
pre -= x;
l.extract(x);
}
if (r.size() + 1 < l.size()) {
i64 p = l.extract(std::prev(l.end())).value();
lst += p;
pre -= p;
r.emplace(p);
}
if (l.size() < r.size()) {
i64 p = r.extract(r.begin()).value();
lst -= p;
pre += p;
l.emplace(p);
}
}
void clear() {
l.clear();
r.clear();
pre = 0;
lst = 0;
}
};
void tizzytyt_SuKi() {
int n;
i64 k;
std::cin >> n >> k;
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
a[i] -= i;
}
Node m;
auto check = [&](int len) -> bool {
m.clear();
for (int i = 1; i < len; i++) {
m.insert(a[i]);
}
i64 res = INF_LONG_LONG;
for (int i = len; i <= n; i++) {
m.insert(a[i]);
i64 mid = m.get_mid();
i64 p = mid * (len & 1) + m.lst - m.pre;
res = std::min(res, p);
m.erase(a[i - len + 1]);
}
return res <= k;
};
int l = 1, r = n;
while (l < r) {
int mid = (l + r + 1) >> 1;
if (check(mid)) {
l = mid;
} else {
r = mid - 1;
}
}
std::cout << l << "\n";
}
signed main() {
#ifdef DYNAMIC_PIGEON
freopen("input.in", "r", stdin);
#else
std::cin.tie(0)->sync_with_stdio(0);
#endif
int t = 1;
std::cin >> t;
while (t--) {
tizzytyt_SuKi();
}
return Dynamic_Pigeon;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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:
4 3 5 1 1
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 1282ms
memory: 6256kb
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:
1 4 3 2 6 5 7 2 4 1 4 1 1 3 2 2 7 8 7 7 1 7 6 2 4 3 1 6 7 7 3 4 3 9 3 8 6 6 3 1 6 3 1 2 4 6 4 6 4 1 4 7 1 6 3 5 6 6 1 7 5 3 1 6 4 5 3 2 2 6 2 3 10 1 4 3 2 4 5 1 7 5 5 5 8 5 3 6 3 5 5 8 5 4 5 2 1 5 2 3 3 4 8 1 3 1 2 2 8 3 1 6 8 1 8 4 5 6 6 8 4 8 3 2 8 4 5 6 2 6 2 4 1 5 4 5 3 2 4 1 2 1 4 5 8 3 7 3 3 3...
result:
ok 11102 lines
Test #3:
score: -100
Time Limit Exceeded
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...