QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#724223	#9574. Strips	552Hz	WA	28ms	5616kb	C++23	1.4kb	2024-11-08 11:03:28	2024-11-08 11:03:29

Judging History

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

[2024-11-08 11:03:29]
评测

测评结果：WA
用时：28ms
内存：5616kb

查看

[2024-11-08 11:03:28]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N=200010;
typedef long long ll;
ll a[N],b[N],k,w;
int n,m;
pair<vector<ll>,bool> clac(vector<ll> pos,ll l,ll r){
	if(pos.size()==0){
		return {{},1};
	}
	ll las_pos=-1E18;
	vector<ll> ans;
	for(auto v:pos){
		if(v>las_pos+k-1){
			ans.push_back(v);
			las_pos=v;
		}
	}
	if(ans[ans.size()-1]+k-1<r){
		return {ans,1};
	}
	for(int i=ans.size()-1;i>=0;i--){
		if(i==ans.size()-1){
			ans[i]=r-k;
		}else{
			if(ans[i]+k-1>ans[i+1]){
				ans[i]=ans[i+1]-k;
			}
		}
	}
	if(ans[0]>l){
		return {ans,1};
	}else{
		return {ans,0};
	}
}
void solve(){
	cin>>n>>m>>k>>w;
	std::vector<pair<ll,ll>> q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		q.push_back({a[i],0});
	}
	for(int i=1;i<=m;i++){
		cin>>b[i];
		q.push_back({b[i],1});
	}
	q.push_back({w+1,1});
	sort(q.begin(),q.end());
	int las_pos=0;
	vector<ll> c;
	vector<ll> ans;
	for(auto [v,flag]:q){
		if(flag){
			vector<ll> node=clac(c,las_pos,v).first;
			if(clac(c,las_pos,v).second==0){
				cout<<-1<<endl;
				return ;
			}
			for(auto v:node){
				ans.push_back(v);
			}
			las_pos=v;
			c.clear();
		}else{
			c.push_back(v);
		}
	}
	cout<<ans.size()<<endl;
	for(auto v:ans){
		cout<<v<<" ";
	}
	cout<<endl;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		solve();
	}
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3616kb

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

memory: 5616kb

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
2 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 are more than one stripe covering cell 11 (test case 18)