QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#751906	#9574. Strips	whileone27	WA	32ms	7748kb	C++14	1.1kb	2024-11-15 21:15:01	2024-11-15 21:15:05

Judging History

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

[2024-11-15 21:15:05]
评测

测评结果：WA
用时：32ms
内存：7748kb

查看

[2024-11-15 21:15:01]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define mk make_pair
const int N=5e6+5;
int T,n,m,w,K;
int ans[N],anss,a[N],b[N];
signed main(){
	ios::sync_with_stdio(0);
	cin>>T;
	while(T--){
		cin>>n>>m>>K>>w;
		for(int i=1;i<=n;++i)cin>>a[i];
		for(int j=1;j<=m;++j)cin>>b[j];
		sort(a+1,a+n+1);
		sort(b+1,b+m+1);
		anss=0;
		b[m+1]=w+1;
		b[0]=1;
		int j=1,op=0;
		for(int i=1;i<=m+1;++i){
			int ls=j;
			while(a[j]<b[i]&&j<=n)++j;
			int rs=j-1,mx=a[ls]-1;
			if(rs<ls)continue;
			int fl=anss;
			for(int k=ls;k<=rs;++k)
			if(mx<a[k])ans[++anss]=a[k],mx=a[k]+K-1;
			if(mx>=b[i]){
//			cout<<mx<<"CNMCNM\n";
				int mn=b[i]-K;
				ans[anss]=mn;
//				cout<<mn<<" "<<ans[1]<<' '<<fl<<' '<<b[i]<<" "<<b[i-1]<<"FSDJLK\n";
				for(int k=anss-1;k>fl;--k)
				if(ans[k]+K-1>=ans[k+1])ans[k]=ans[k+1]-K;
//				cout<<ans[fl+1]<<' '<<anss<<' '<<fl+1<<" "<<a[ls]<<"CNMCNMCNM\n";
				if(ans[fl+1]<b[i-1]){
					op=1;
					break;
				}
			}
		}
		if(op)cout<<-1<<'\n';
		else{
			cout<<anss<<'\n';
			for(int i=1;i<=anss;++i)
			cout<<ans[i]<<" ";
			cout<<'\n';
		}
	}
}

源文件, 语言: C++14

详细

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

memory: 7692kb

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 
4
1 11 21 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 There is at least one stripe covering black cell 1 (test case 92)