QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#747147#9574. StripsacansaidongWA 20ms5624kbC++201.2kb2024-11-14 16:27:102024-11-14 16:27:10

Judging History

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

  • [2024-11-14 16:27:10]
  • 评测
  • 测评结果:WA
  • 用时:20ms
  • 内存:5624kb
  • [2024-11-14 16:27:10]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
 
const int N=2e5+10;
const int M=0x3f3f3f3f3f3f3f3f;
int a[N],b[N];


signed main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T;cin>>T;
    while(T--)
    {
        int n,m,k,w;cin>>n>>m>>k>>w;
        for(int i=1;i<=n;i++) cin>>a[i];
        for(int i=1;i<=m;i++) cin>>b[i];
        sort(a+1,a+n+1);
        sort(b+1,b+m+1);
        b[m+1]=w+1;
        int ans=0,ok=1,l=0,r=0;
        queue<int> q;
        for(int i=1,j=1;i<=n;i++)
        {
            while(j<=m&&b[j]<a[i]) j++;
            if(r<a[i]&&a[i]+k-1<b[j]) q.push(a[i]),r=max(r,a[i]+k-1);
            else if(r<a[i]&&a[i]+k-1>=b[j])
            {
                if(b[j]-(r+1)>=k&&b[j]-1<=w)
                {
                    q.push(b[j]-k);
                }
                else ok=0;
                r=max(r,b[j]-1);
            }
        }

        if(ok) 
        {
            cout<<q.size()<<"\n";
            while(q.size())
            {
                cout<<q.front()<<" ";
                q.pop();
            }
            cout<<"\n";
        }
        else cout<<"-1\n";
    }
	
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 5624kb

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:

4
2 7 10 14 
-1
2
1 5 
-1

result:

ok ok 4 cases (4 test cases)

Test #2:

score: -100
Wrong Answer
time: 20ms
memory: 5508kb

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
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 
2
7 25 
1...

result:

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