QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#933663	#7678. The Game	DarwinA66	WA	2ms	5856kb	C++20	2.4kb	2025-03-13 23:42:47	2025-03-13 23:42:48

Judging History

This is the latest submission verdict.

[2025-03-13 23:42:48]
Judged

Verdict: WA
Time: 2ms
Memory: 5856kb

Show

[2025-03-13 23:42:47]
Submitted

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=300010;
int a[N],b[N];
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin>>T;
    while(T--){
        int n,m;
        cin>>n>>m;
        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);
        int diff=0;
        bool flag=true;
        for(int i=m;i>=1;i--){
            diff+=b[i]-a[i+n-m];
            if(diff<0)flag=false;
        }
        if(!flag || diff>n-m)cout<<"-1\n";
        else{
            int need_waste=n-m-diff;
            vector<int>ans;
            multiset<int>ms;
            for(int i=1;i<=n;i++)ms.insert(a[i]);
            int bounded_waste=0,max_waste=0;
            int l=0,r=0;
            for(int i=1;i<=n;i++){
                if(a[i]<a[n-m+1]){
                    max_waste++;
                    bounded_waste++;
                }
                if(a[i]==a[n-m+1]){
                    if(!l)l=i;
                    r=i;
                }
            }
            if(b[1]!=a[n-m+1]&&r-n+m<n-m-l+1)max_waste+=(n-m-l+1-r+n-m+1)/2;
            //cout<<"DAMN   "<<need_waste<<" "<<bounded_waste<<"\n";
            if(need_waste>max_waste)cout<<"-1\n";
            else{
                cout<<n-m<<"\n";
                for(int i=1;i<=min(bounded_waste,need_waste);i++){
                    int rm=*(ms.begin());
                    ms.erase(ms.find(rm));
                    cout<<rm<<" ";
                    ms.insert(rm+1);
                    int mn=*(ms.begin());
                    ms.erase(ms.find(mn));
                }
                if(need_waste>bounded_waste){
                    for(int i=1;i<=r-n+m+need_waste-bounded_waste;i++){
                        int rm=*(ms.begin());
                        ms.erase(ms.find(rm));
                        cout<<rm<<" ";
                        ms.insert(rm+1);
                        int mn=*(ms.begin());
                        ms.erase(ms.find(mn));
                    }
                }
                for(int i=1;i<=m;i++){
                    for(int j=a[n-m+i];j+1<=b[i];j++){
                        if(need_waste<=bounded_waste||j>a[n-m+1])cout<<j<<" ";
                    }
                }
                cout<<"\n";
            }
            ms.clear();
        }
    }
    return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 5852kb

input:

6
5 3
1 2 2 3 3
2 3 4
4 2
1 2 2 4
2 4
5 2
2 3 3 4 4
5 5
6 1
1 1 1 1 1 1
4
4 2
1 1 1 2
2 2
4 1
1 1 1 1
2

output:

result:

ok ok (6 test cases)

Test #2:

score: -100

Wrong Answer

time: 2ms

memory: 5856kb

input:

output:

-1
1
1 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
1
2 
-1
-1
-1
1
1 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
...

result:

wrong answer Wrong answer, the final sequence does not equal to B (test case 340)