QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#549747 | #8831. Chemistry Class | ucup-team4906# | WA | 87ms | 66516kb | C++20 | 1.9kb | 2024-09-06 20:55:45 | 2024-09-06 20:55:45 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define N 400010
int n;
ll A, B;
ll a[N];
int s[N];
int dp[N];
int mx[2][21][N];
int qry(int t, int l, int r)
{
int p = __lg(r - l + 1);
return max(mx[t][p][r], mx[t][p][l + (1 << t) - 1]);
}
void sol() {
cin >> n >> A >> B;
for (int i = 1; i <= 2 * n; i ++) cin >> a[i];
sort(a + 1, a + 2 * n + 1);
for (int i = 1; i <= n; i ++)
{
if (a[i * 2] - a[i * 2 - 1] > A)
{
cout << "-1\n";
return ;
}
if (i == 1) s[i] = 0;
else
{
s[i] = s[i - 1];
s[i] += (a[i * 2 - 1] - a[i * 2 - 2] <= B);
}
}
for (int i = 1; i <= n; i ++)
{
dp[i] = 0;
int l = 1, r = i, pos = i + 1;
while (l <= r)
{
int mid = (l + r) >> 1;
if (a[i * 2] - a[mid * 2 - 1] <= B)pos = mid, r = mid - 1;
else l = mid + 1;
}
if (pos <= i)
{
dp[i] = max(dp[i], qry(0, pos - 1, i - 1) + i);
}
l = 1, r = i, pos = i + 1;
while (l <= r)
{
int mid = (l + r) >> 1;
if (a[i * 2] - a[mid * 2 - 1] <= A)pos = mid, r = mid - 1;
else l = mid + 1;
}
dp[i] = max(dp[i], qry(1, pos - 1, i - 1) + s[i]);
mx[0][0][i] = dp[i] - i;
mx[1][0][i] = dp[i] - s[i + 1];
for (int j = 1; j <= 20; j ++)
{
if (i - (1 << j) + 1 <= 0)break;
mx[0][j][i] = max(mx[0][j - 1][i], mx[0][j - 1][i - (1 << j - 1)]);
mx[1][j][i] = max(mx[1][j - 1][i], mx[1][j - 1][i - (1 << j - 1)]);
}
}
cout << dp[n] << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t; cin >> t;
while (t --) sol();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 13912kb
input:
4 1 2 1 42 69 2 3 1 1 2 3 4 2 5 1 6 1 3 4 5 19 1 1 7 8 9 10 11 12 13 14 20
output:
-1 2 1 4
result:
ok 4 number(s): "-1 2 1 4"
Test #2:
score: 0
Accepted
time: 81ms
memory: 63508kb
input:
1 199996 67013419502794 1 403716252634677166 895717933735068492 410002430455111886 844431179242134559 322988383133810700 133475121268220299 481706326769800263 606871141911985391 195911124687409946 959578180866483093 930547702157856949 877914383714875160 994158366044742636 890855755285236186 69498488...
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 73ms
memory: 64352kb
input:
1 199998 38987266278826 1 974183459404323858 517476981059568123 730207399881008603 532509909948600146 89227878552241675 16653300445469756 791674368913652595 92177901403222015 980536748304824579 581564387828767376 471919726893404451 759601909683722004 632340812998214017 818440789777778368 18845836031...
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: 0
Accepted
time: 77ms
memory: 66516kb
input:
1 199996 54170919220045 1 968843690955781467 596307347951820347 406785475849275444 383666938223357986 725160735782817082 132577412512120631 891899794864087098 779434145671998619 932681297277907326 208765550447928461 385078857912267975 669360937040314510 917331948890514855 505938744714587815 47145437...
output:
0
result:
ok 1 number(s): "0"
Test #5:
score: -100
Wrong Answer
time: 87ms
memory: 64436kb
input:
1 199998 35667463938291 8255384928693 770468016026697053 519790816750772730 110085058423772871 85144239858008037 782003096084947976 938498644167289660 693768718229582367 242186248813489674 155335549252315364 428982852761422230 890445026369869037 86401573937739054 9122788624365829 63351367715811463 1...
output:
197749
result:
wrong answer 1st numbers differ - expected: '193326', found: '197749'