QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#746724 | #9574. Strips | ATM12345# | WA | 19ms | 3820kb | C++17 | 1.5kb | 2024-11-14 15:22:40 | 2024-11-14 15:22:41 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005
#define mod 1e9+7
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
using namespace std;
ll n,m,k,w;
ll cnt=0;
struct node{
ll num,op;
bool operator <(const node &A)const{
return num<A.num;
}
}t[Ma];
vector <ll> ans;
bool go(ll l,ll r)
{
if (l>r)
return 1;
vector <ll> add;
for (ll i=l;i<=r;i++)
{
if (!add.empty()&&add.back()+k-1>=t[i].num)
continue;
add.pb(t[i].num);
}
if (add.back()+k-1<t[r+1].num)
{
for (auto z:add)
ans.pb(z);
return 1;
}
vector <ll> add2;
add2.pb(t[r+1].num-k);
for (ll i=r;i>=l;i--)
{
if (add2.back()>t[i].num)
add2.pb(min(t[i].num,add2.back()-k));
}
if (add2.back()>t[l-1].num)
{
for (auto z:add2)
ans.pb(z);
return 1;
}
return 0;
}
void sol()
{
cnt=0;
ans.clear();
cin>>n>>m>>k>>w;
for (ll i=1;i<=n;i++)
{
ll x;
cin>>x;
t[++cnt]={x,0};
}
for (ll i=1;i<=m;i++)
{
ll x;
cin>>x;
t[++cnt]={x,1};
}
sort(t+1,t+cnt+1);
t[cnt+1]={w+1,0};
ll l=1;
for (ll i=1;i<=cnt;i++)
{
if (t[i].op)
{
if (!go(l,i-1))
{
printf("-1\n");
return;
}
l=i+1;
}
}
go(l,cnt);
printf("%lld\n",(ll)ans.size());
for (auto z:ans)
printf("%lld ",z);
printf("\n");
}
int main()
{
IOS
ll tt=1;
cin>>tt;
while (tt--)
sol();
return 0;
}
/*
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
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 10 7 14 -1 2 1 5 -1
result:
ok ok 4 cases (4 test cases)
Test #2:
score: -100
Wrong Answer
time: 19ms
memory: 3736kb
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:
2 3 32 7 3 4 14 22 28 36 40 3 32 48 66 8 3 9 22 26 31 38 54 65 3 5 15 30 6 1 8 12 31 47 41 4 17 39 30 49 2 52 67 1 27 1 22 1 62 5 24 33 43 48 60 2 4 31 3 11 20 31 3 3 16 33 3 25 30 42 3 3 17 60 4 21 11 1 33 2 54 66 3 50 59 65 3 50 62 78 1 81 4 2 11 16 23 5 3 7 17 36 49 2 1 45...
result:
wrong answer Participant didn't find a solution but the jury found one. (test case 33)