QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#727918	#9574. Strips	ucup-team5319^#	WA	23ms	3956kb	C++14	1.3kb	2024-11-09 14:09:03	2024-11-09 14:09:03

Judging History

你现在查看的是最新测评结果

[2024-11-09 14:09:03]
评测

测评结果：WA
用时：23ms
内存：3956kb

查看

[2024-11-09 14:09:03]
提交

answer

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e5+9;
int n,m,K,w;
int a[N],b[N];
int ans[N],ans_cnt=0;
struct abc{int st,len;}lxd[N];
int lxd_cnt=0;
void work()
{
	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[0]=0,b[m+1]=w+1;
	ans_cnt=0;
	for(int i=1,j=0;i<=m+1;i++)
	{
		lxd_cnt=0;
		lxd[++lxd_cnt]={b[i-1]-K+1,1};
		while(j<n&&a[j+1]<=b[i])
		{
			j++;
			if(lxd[lxd_cnt].st+lxd[lxd_cnt].len*K-1>=a[j]) continue;
			if(a[j]+K-1<b[i]) lxd[++lxd_cnt]={a[j],1};
			else
			{
				int d=(a[j]+K-1)-b[i]+1;
				lxd[++lxd_cnt]={a[j],1};
				while(d&&lxd_cnt>1)
				{
					int d0=lxd[lxd_cnt].st-(lxd[lxd_cnt-1].st+lxd[lxd_cnt-1].len*K);
					int mn=min(d,d0);
					d-=mn,d0-=mn,lxd[lxd_cnt].st-=mn;
					if(!d0)
					{
						lxd[lxd_cnt-1].len+=lxd[lxd_cnt].len;
						lxd_cnt--;
					}
				}
				if(d) return puts("-1"),void();
			}
		}
		for(int i=2;i<=lxd_cnt;i++)
		{
//			cerr<<lxd[i].st<<" "<<lxd[i].len<<endl;
			for(int j=0;j<lxd[i].len;j++) ans[++ans_cnt]=lxd[i].st+j*K;
		}
	}
	printf("%d\n",ans_cnt);
	for(int i=1;i<=ans_cnt;i++) printf("%d ",ans[i]);
	puts("");
}
signed main()
{
	int T;
	scanf("%d",&T);
	while(T--) work();
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3956kb

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:

result:

ok ok 4 cases (4 test cases)

Test #2:

score: -100

Wrong Answer

time: 23ms

memory: 3908kb

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 41 47 
4
17 30 39 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 
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 
1
45 
0

0

3
...

result:

wrong answer There is no stripe covering red cell 2 (test case 18)