QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#735592	#9574. Strips	UESTC_NLNS^#	WA	18ms	9812kb	C++14	1.1kb	2024-11-11 20:51:13	2024-11-11 20:51:13

Judging History

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

[2024-11-11 20:51:13]
评测

测评结果：WA
用时：18ms
内存：9812kb

查看

[2024-11-11 20:51:13]
提交

answer

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
const int N=400005;
int t,n,m,k,w,la;
int a[N],b[N],c[N],d[N],f[N],st[N],top,q[N],g[N];
vector<int>Ans;
long long ans;
int solve(int l,int r){
    if(l+1==r)return 0;
    int num=0;
    while(la<=n&&a[la]<=r){
        c[++num]=a[la];
        ++la;
    }
    int la=0;int nm=0;
    for(int i=1;i<=num;++i){
        if(!la||c[i]-la>=k)b[++nm]=c[i],la=c[i];
    }
    if(nm*k>r-l-1)return INF;
    for(int i=1;i<=nm;++i)b[i]=min(b[i],r-1-k*(nm-i+1)+1),Ans.push_back(b[i]);
    return nm;
}
signed main(){
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    cin>>t;
    while(t--){
        cin>>n>>m>>k>>w;ans=0;Ans.clear();
        for(int i=1;i<=n;++i)cin>>a[i];
        for(int i=1;i<=m;++i)cin>>b[i];la=1;
        sort(b+1,b+m+1);sort(a+1,a+n+1);
        for(int i=1;i<=m;++i)ans+=solve(b[i-1],b[i]);
        ans+=solve(b[m],w+1);
        if(ans<INF){
            cout<<ans<<"\n";
            sort(Ans.begin(),Ans.end());
            for(int x:Ans)cout<<x<<" ";cout<<"\n";
        }
        else cout<<"-1\n";
    }
    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: 7648kb

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

memory: 9812kb

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 35 
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 43 (test case 18)