QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #752836 | #9574. Strips | forget-star# | WA | 24ms | 3864kb | C++17 | 1.2kb | 2024-11-16 10:04:36 | 2024-11-16 10:04:36 |
Judging History
answer
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
const int N=1e5+10;
int n,m,k,w,a[N],b[N],c[N];
struct node
{
int l,r;
};
int main()
{
int T;scanf("%d",&T);
while(T--)
{
scanf("%d%d%d%d",&n,&m,&k,&w);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=m;i++) scanf("%d",&b[i]);
sort(a+1,a+n+1);sort(b+1,b+m+1);b[++m]=w+1;
int ans=0;bool check=1;
for(int i=1,l=0;i<=m;i++)
{
while(l<=n&&a[l]<=b[i-1]) l++;
int r=l;
while(r<n&&a[r+1]<=b[i]) r++;
// printf("(%d,%d) l=%d r=%d\n",b[i-1],b[i],l,r);
vector<node>v;v.clear();
for(int j=l,t=0;j<=r;j++)
{
if(a[j]>t) v.push_back(node{a[j],a[j]+k-1}),t=a[j]+k-1;
}
for(int j=(int)v.size()-1,t=b[i];j>=0;j--)
{
if(v[j].r>=t)
{
v[j].r=t-1;
v[j].l=v[j].r-k+1;
}
t=v[j].l;
}
if(v.size()>0&&v[0].l<=b[i-1]) check=0;
for(int j=0;j<v.size();j++) c[++ans]=v[j].l;
l=r;
}
if(!check) ans=-1;
printf("%d\n",ans);
if(ans!=-1)
{
for(int i=1;i<=ans;i++) printf("%d ",c[i]);
puts("");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3864kb
input:
4 5 2 3 16 7 11 2 9 14 13 5 3 2 4 11 6 10 2 1 11 2 1 2 6 1 5 3 2 1 2 6 1 5 2
output:
4 2 7 10 14 -1 2 1 5 -1
result:
ok ok 4 cases (4 test cases)
Test #2:
score: -100
Wrong Answer
time: 24ms
memory: 3820kb
input:
11000 3 8 2 53 32 3 33 35 19 38 20 1 30 10 6 7 10 1 42 3 14 4 36 28 40 22 17 20 12 41 27 7 1 19 13 9 6 6 13 78 55 76 53 32 54 58 62 45 21 4 7 61 8 7 3 68 9 26 54 31 22 3 38 65 34 16 58 47 52 29 53 5 8 4 33 33 5 30 6 15 27 12 9 28 19 2 13 10 6 1 2 48 8 12 48 1 41 31 40 7 6 7 61 20 19 30 52 49 17 40 3...
output:
-1 -1 -1 -1 -1 6 1 8 12 31 41 47 -1 -1 -1 -1 -1 -1 -1 -1 -1 5 3 25 30 40 42 -1 -1 -1 -1 -1 2 3 81 4 2 11 16 23 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 5 14 35 43 87 92 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 5 8 24 28 41 65 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 3 11 26 48 -1 -1 -1 -1 -1 -1 -1 -1 -1 6 6 15...
result:
wrong answer Participant didn't find a solution but the jury found one. (test case 1)