QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #695794 | #6433. Klee in Solitary Confinement | s2328995024s | WA | 20ms | 50836kb | C++14 | 1.3kb | 2024-10-31 20:48:39 | 2024-10-31 20:48:40 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6;
int n,k,a[2000005],b[2000005],ans,s[2000005];
vector<int> oc[2000005];
int main()
{
//oc[0].push_back(0);oc[0].push_back(1);oc[0].push_back(2);
//int tt = upper_bound(oc[0].begin(),oc[0].end(),2)-oc[0].begin();
//cout<<tt<<endl;
cin>>n>>k;
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
oc[a[i]+N].push_back(i);
}
for(int i=0;i<=2*N;++i)
{
int tot=0,ii=0,jj=0,j=i-k;
int tt=oc[i].size();
ans=max(ans,tt);
if(j<0||j>2*N) continue;
tot=0;
while(ii<oc[i].size()&&jj<oc[j].size())
{
if(oc[i][ii]<oc[j][jj]) b[++tot]=1,++ii;
else b[++tot]=0,++jj;
}
while(ii<oc[i].size()) b[++tot]=1,++ii;
while(jj<oc[j].size()) b[++tot]=0,++jj;
for(int w=1;w<=tot;++w) s[w]=s[w-1]+b[w];
int temp=-2e9;
for(int w=1;w<=tot;++w)
{
temp=max(temp,s[w-1]*2-w);
int ttt=ans;
ans=max(ans,temp+w+1-s[w]+s[tot]-s[w]);
// if(ans!=ttt&&ans==4) printf("%d %d %d %d %d %d %d %d\n",temp,w,i,tot,s[w],s[w-1],oc[i].size(),oc[j].size());
}
}
printf("%d\n",ans);
return 0;
}
/*
5 2
2 2 4 4 4
5
7 1
3 2 3 2 2 2 3
6
7 1
2 3 2 3 2 3 3
5
9 -100
-1 -2 1 2 -1 -2 1 -2 1
3
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 9ms
memory: 50704kb
input:
5 2 2 2 4 4 4
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: 0
Accepted
time: 8ms
memory: 50684kb
input:
7 1 3 2 3 2 2 2 3
output:
6
result:
ok 1 number(s): "6"
Test #3:
score: 0
Accepted
time: 14ms
memory: 50792kb
input:
7 1 2 3 2 3 2 3 3
output:
5
result:
ok 1 number(s): "5"
Test #4:
score: 0
Accepted
time: 4ms
memory: 50836kb
input:
9 -100 -1 -2 1 2 -1 -2 1 -2 1
output:
3
result:
ok 1 number(s): "3"
Test #5:
score: 0
Accepted
time: 13ms
memory: 50652kb
input:
200 121649 0 527189 -1000000 -306471 -998939 527189 -1000000 -1000000 0 527189 0 527189 0 527189 -306471 -998939 -306471 -306471 -306471 0 0 527189 527189 1000000 527189 -1000000 1000000 648838 -1000000 -998939 -998939 -998939 0 1000000 -1000000 -998939 527189 1000000 648838 -1000000 1000000 648838 ...
output:
37
result:
ok 1 number(s): "37"
Test #6:
score: 0
Accepted
time: 20ms
memory: 50716kb
input:
200 -454379 -385892 454379 -1000000 373644 -665078 -1000000 -1000000 454379 0 1000000 373644 -1000000 1000000 -385892 -1000000 373644 0 -665078 0 -665078 -1000000 -665078 -385892 -665078 -385892 454379 -665078 -385892 -1000000 454379 1000000 -385892 373644 454379 -1000000 -385892 -1000000 -385892 -1...
output:
40
result:
ok 1 number(s): "40"
Test #7:
score: -100
Wrong Answer
time: 7ms
memory: 50696kb
input:
200 0 451272 -1000000 677452 677452 0 18908 451272 677452 -233144 677452 451272 18908 -1000000 18908 -1000000 0 451272 0 -233144 677452 1000000 451272 1000000 18908 -1000000 0 -233144 451272 1000000 18908 677452 0 677452 0 677452 1000000 -233144 18908 451272 -1000000 -233144 18908 1000000 0 0 -23314...
output:
36
result:
wrong answer 1st numbers differ - expected: '35', found: '36'