QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#793789	#9574. Strips	moqizhu2005	WA	13ms	3896kb	C++14	1.1kb	2024-11-30 01:06:28	2024-11-30 01:06:29

Judging History

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

[2024-11-30 01:06:29]
评测

测评结果：WA
用时：13ms
内存：3896kb

查看

[2024-11-30 01:06:28]
提交

answer

#include<bits/stdc++.h>
#define il inline
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define ROF(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
const int N = 2e5+5;
int ans[N];
int n,m,k,w;
int a[N],b[N];
int cnt;
int L,R,lastL;
bool f;
il int read(){
	int x=0,f=1;
	char c=getchar();
	for(;!isdigit(c);c=getchar())
		if(c=='-') f=-1;
	for(;isdigit(c);c=getchar())
		x=(x<<1)+(x<<3)+c-'0';
	return x*f; 
}
signed main(){
	int T=read();
	while(T--){
		n=read();
		m=read();
		k=read();
		w=read();
		f=1;
		cnt=0;
		lastL=0;
		FOR(i,1,n) a[i]=read();
		FOR(i,1,m) b[i]=read();
		b[++m]=w+1;
		sort(a+1,a+1+n);
		sort(b+1,b+1+m);
		int j=1;
		FOR(i,1,n){
			while(j<=m&&b[j]<a[i]) ++j;
			int _i=i;
			while(_i<=n&&a[_i]<b[j]&&(a[_i]-a[i]+1<=k)) ++_i;
			--_i;
			L=max(lastL,max(a[_i]-k,b[j-1]));
			R=min(b[j]-k+1,a[i]+1);
			if(L+1>=R){
				f=0;
				break;
			}
			ans[++cnt]=L+1;
			i=_i;
			lastL=L+k;
		}
		if(f==0){
			puts("-1");
			continue;
		}
		else{
			printf("%d\n",cnt);
			FOR(i,1,cnt) printf("%d ",ans[i]);
			puts("");
		}
	}
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3808kb

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: 13ms

memory: 3896kb

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
2 32 
7
3 4 14 22 28 36 40 
3
22 46 64 
8
1 7 20 24 30 36 54 63 
3
3 14 30 
6
1 7 11 30 41 47 
4
14 27 34 47 
2
42 65 
1
27 
1
9 
1
62 
5
24 33 42 47 60 
2
3 31 
3
11 19 29 
3
2 15 33 
3
25 30 42 
3
2 17 59 
4
1 11 21 32 
2
53 65 
3
49 58 65 
3
43 60 78 
1
78 
4
1 11 15 21 
5
3 7 17 36 48 
2
1 44 ...

result:

wrong answer Participant didn't find a solution but the jury found one. (test case 73)