QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#747208	#9574. Strips	acansaidong	WA	15ms	3860kb	C++20	2.3kb	2024-11-14 16:35:11	2024-11-14 16:35:11

Judging History

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

[2024-11-14 16:35:11]
评测

测评结果：WA
用时：15ms
内存：3860kb

查看

[2024-11-14 16:35:11]
提交

answer

#include<bits/stdc++.h>
#define int long long
#define inf 0x3f3f3f3f3f3f3f 
#define GG ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define cnot cout<<"NO"<<"\n"
#define cyes cout<<"YES"<<"\n"
#define cans cout<<ans<<"\n"
#define pb push_back
#define x0 first
#define y0 second
#define lc p<<1
#define rc p<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef pair<int,string>Pis;
typedef pair<int,int>Pii;
const int N=2e5+10,mod=1e9+7,M=1e6+10;
int lowbit(int x){
return x&(-x);}
int a[N],b[N];
void solve(){
    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+1+n);
    sort(b+1,b+1+m);
    vector<Pii>op;
    vector<int>ans;
    int l=1,r;
    for(int i=1;i<=m;i++){
        if(b[i]==b[i-1]+1){
            l=b[i]+1;
            continue;
        }
        r=b[i]-1;
        op.pb({l,r});
        l=r+2;
    }
    if(b[m]!=w){
    op.pb({l,w});
    }
    
    int sum=0;
     vector<int>s1,s2;
    int j=1;
    for(int i=0;i<op.size();i++){
        if(j>n){
            break;
        }
        s1.clear();
        s2.clear();
        while(a[j]<=op[i].y0&&j<=n){
            s1.pb(a[j]);
            int o=a[j];
            while(a[j]<=o+k-1&&j<=n){
                j++;
            }
        }
        if(s1.empty()){
            continue;
        }
        if(s1.back()+k-1<=op[i].y0){
            for(int ii=0;ii<s1.size();ii++){
                ans.pb(s1[ii]);
            }
            sum+=s1.size();
            continue;
        }
        int nn=s1.size(),cu=s1.back()+k-1-op[i].y0;
        for(int ii=nn-1;ii>=0;ii--){
            s2.pb(s1[ii]-cu);
            if(ii>=1)
            cu-=(s1[ii]-s1[ii-1]-k);
            else {
                cu-=(s1[0]-op[i].x0);
            }
            cu=max(cu,0ll);
        }
        if(cu>0){
            cout<<-1<<"\n";
            return ;
        }
        for(int ii=nn-1;ii>=0;ii--){
            ans.pb(s2[ii]);
        }
        sum+=s2.size();
    }
    cout<<sum<<"\n";
    for(int i=0;i<ans.size();i++){
        cout<<ans[i]<<" ";
    }
    cout<<"\n";
}
signed main(){
    GG;
    int _t=1;
    cin>>_t;
    while(_t--){
        solve();
    }
    
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3860kb

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

memory: 3840kb

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 no stripe covering red cell 28 (test case 48)