QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#785913	#9574. Strips	Gemini7X	WA	23ms	7760kb	C++14	1.5kb	2024-11-26 19:35:35	2024-11-26 19:35:35

Judging History

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

[2024-11-26 19:35:35]
评测

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

查看

[2024-11-26 19:35:35]
提交

answer

#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e6+100;
int n,m,k,w;
int a[N+10],b[N+10],cnt;
struct node
{
	int v,type;
}p[N+10];
bool cmp(node a,node b)
{
	return a.v<b.v;
}
int s[N+10],top,Ans[N+10]; 
int main()
{
//	freopen("K.in","r",stdin);
	int T;
	scanf("%d",&T);
//	T=1;
	for(;T--;)
	{
		scanf("%d %d %d %d",&n,&m,&k,&w);
		cnt=0;
		for(int i=1;i<=n;i++) scanf("%d",&a[i]),p[++cnt]=(node){a[i],0};
		for(int i=1;i<=m;i++) scanf("%d",&b[i]),p[++cnt]=(node){b[i],1};
		sort(p+1,p+1+cnt,cmp);
		int lpos=0,ans=0;
		for(int i=1;i<=cnt;i++)
		{
			if(p[i].type==1)
			{
//				printf("i %d v %d\n",i,p[i].v);
				int r=0;top=0;
				for(int j=lpos+1;j<i;j++)
					if(r<p[j].v)
					{
						s[++top]=p[j].v;
						r=p[j].v+k-1;
					}
				s[top+1]=p[i].v;
				for(int j=top;j>=1;j--)
					if(s[j]+k-1>=s[j+1])
						s[j]=s[j+1]-k;
				if(s[1]<=p[lpos].v&&top!=0)
				{
					ans=-1e9;
					break;
				}
				for(int i=1;i<=top;i++)
					Ans[ans+i]=s[i];
				ans+=top;
				lpos=i;
			}
			else
			{
				if(i==cnt&&p[i].type==0)
				{
					i++;
					int r=0;top=0;
					for(int j=lpos+1;j<i;j++)
						if(r<p[j].v)
						{
							s[++top]=p[j].v;
							r=p[j].v+k-1;
						}
					for(int i=1;i<=top;i++)
						Ans[ans+i]=s[i];
					ans+=top;
				}
			}
		}
		printf("%d\n",ans<0?-1:ans);
		if(ans>=0)
		{
			for(int i=1;i<=ans;i++)
				printf("%d ",Ans[i]);
			puts("");
		}
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 7748kb

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: 7760kb

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 76 
8
3 9 22 26 31 38 54 65 
3
5 15 30 
6
1 8 12 31 41 48 
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 
4
1 11 21 33 
2
54 66 
3
50 59 65 
3
50 62 78 
1
85 
4
2 11 16 23 
5
3 7 17 36 49 
2
1 45...

result:

wrong answer Integer parameter [name=l_i] equals to 76, violates the range [1, 66] (test case 3)