QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#54296 | #862. Social Justice | ckiseki# | AC ✓ | 341ms | 10500kb | C++ | 2.5kb | 2022-10-07 19:42:54 | 2022-10-07 19:42:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int64_t cdiv(int64_t a, int64_t b) {
return (a + b - 1) / b;
}
signed main() {
cin.tie(nullptr) -> sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
vector<int64_t> a(n);
vector<int64_t> pre(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> id(n);
iota(id.begin(), id.end(), 0);
sort(id.begin(), id.end(), [&](int i, int j) { return a[i] < a[j]; });
int p, q;
cin >> p >> q; // K = p / q
sort(a.begin(), a.end());
for (int i = 0; i < n; i++)
pre[i + 1] = pre[i] + a[i];
const auto ok = [&](int l, int r) {
// using llf = long double;
const int ret = a[r - 1] * q * (r - l) <= p * (pre[r] - pre[l]);
// cerr << a[r-1] << "<=" << (pre[r]-pre[l])/llf(r-l)*p/q << ' ' << ret << endl;
return ret;
};
vector<int> left(n);
int ans = 0;
for (int i = 0; i < n; i++) {
int l = i;
for (int s = 1<<20; s; s >>= 1) {
if (l - s >= 0 && ok(l - s, i + 1)) {
l -= s;
}
}
left[i] = l;
ans = max(ans, i + 1 - l);
}
vector<int> sum(n + 1);
for (int i = 0; i < n; i++) {
if (i + 1 - left[i] != ans) continue;
// a[i] <= (sum - a[left[i]] + a[x]) / ans * K
// a[x] >= ceil(a[i] * ans / K) - (sum - a[left[i]])
// x < left[i];
int64_t U = cdiv(a[i] * ans * q, p) - (pre[i + 1] - pre[left[i] + 1]);
int j = lower_bound(a.begin(), a.begin() + left[i], U) - a.begin();
int k = upper_bound(a.begin(), a.end(), a[i]) - a.begin();
sum[j] += 1;
sum[k] -= 1;
}
for (int i = 1; i < n; i++)
sum[i] += sum[i - 1];
cerr << "MX = " << ans << endl;
vector<int> res;
for (int i = 0; i < n; i++)
if (sum[i] == 0)
res.push_back(id[i]+1);
sort(res.begin(), res.end());
cout << res.size() << '\n';
for (size_t i = 0; i < res.size(); i++) {
cout << res[i];
if (i + 1 != res.size())
cout << ' ';
}
cout << '\n';
// cerr << "max = " << ans << endl;
// for (int i = 0; i < n; i++) {
// cerr << left[i] << ',';
// }
// cerr << endl;
}
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3644kb
input:
3 4 1 2 3 4 3 2 5 1 15 2 5 1 2 1 5 1 2 3 1000 10000 4 3
output:
0 1 2 2 4 5
result:
ok 6 numbers
Test #2:
score: 0
Accepted
time: 18ms
memory: 3572kb
input:
1000 1 10 3 2 2 10 100 3 2 3 10 10 100 3 2 4 1 2 3 4 3 2 5 1 15 2 5 1 2 1 5 1 2 3 1000 10000 4 3 6 1 2 3 4 1000 10000 4 3 5 50000 2 1 1 5000 2 1 10 1 15 2 5 1 10000 1 1 1 1 2 1 20 1 15 2 5 1 10000 1 1 1 1 1 15 2 5 1 10000 1 1 1 1 2 1 25 1 15 2 5 1 10000 1 1 1 1 1 15 2 5 1 10000 1 1 1 1 1 15 2 5 1 2 ...
output:
0 0 1 3 0 1 2 2 4 5 3 1 5 6 2 1 5 3 2 4 6 6 2 4 6 12 14 16 8 2 4 6 12 14 16 22 24 13 1 2 3 4 5 6 7 8 9 10 11 12 20 15 1 2 3 4 5 6 7 8 9 10 11 12 18 19 20 0 2 2 8 2 9 12 2 2 14 10 1 4 5 6 7 13 14 15 18 20 2 9 16 2 16 18 2 5 13 10 4 5 6 9 11 15 16 18 19 20 2 5 19 2 5 13 2 10 15 2 14 17 10 1 2 4 6 ...
result:
ok 6086 numbers
Test #3:
score: 0
Accepted
time: 132ms
memory: 4016kb
input:
125 5000 1 1 1 1000000000 1000000000 1000000000 1000000000 1 1 1 1 1 1000000000 1 1 1 1 1 1 1000000000 1000000000 1 1000000000 1000000000 1000000000 1 1000000000 1000000000 1000000000 1 1 1000000000 1000000000 1 1000000000 1 1 1 1000000000 1000000000 1000000000 1000000000 1000000000 1 1 1 1000000000...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4491 3 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 42 43 44 45 46 48 49 50 51 53 54 55 56 57 58 59 62 63 64 66 67 68 70 71 72 74 75 76 77 78 79 80 81 82 83 84 85 87 88 89 90 93 94 95 96 97 ...
result:
ok 242748 numbers
Test #4:
score: 0
Accepted
time: 289ms
memory: 10500kb
input:
5 200000 512314734 33319999 85503340 443544695 92411616 149252701 723302421 176149500 143875507 972078271 907672089 585808794 390600756 700244129 848509047 550288071 859158053 356354007 437419096 572862734 118863313 959486458 472657137 107261032 199102866 190553436 489624108 79203044 147746132 47881...
output:
181062 1 2 3 4 5 6 7 8 9 12 13 14 15 16 17 18 19 20 21 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 91 92 94 95 96 98 99 100 101 102 103 104 105 106 1...
result:
ok 380173 numbers
Test #5:
score: 0
Accepted
time: 341ms
memory: 9512kb
input:
5 200000 15187692 56 41 5053827 3148366 6530 10 131 4381 380972680 499497 8727 371 555036936 2810792 641 3116415 4514225 22284 542730997 129 2227 173361 49408 4 528 1 2660 20568 466863 1 5348 206792 6 150 37 576581 240275683 318 24664 99 34829 38855 177 18018 189646 653 437641 2 219866 5294 3476 856...
output:
83879 2 3 7 8 9 13 16 21 22 25 26 27 28 31 34 35 36 39 41 44 47 49 52 54 58 60 61 66 67 68 69 70 71 72 73 75 77 81 84 86 88 90 92 93 95 96 97 98 99 100 105 106 107 114 117 119 121 122 123 125 126 130 131 135 136 146 147 148 149 152 153 154 156 158 160 161 163 168 170 171 174 179 180 182 184 186 189 ...
result:
ok 176756 numbers