QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#252910	#7678. The Game	ucup-team1321^#	WA	22ms	5520kb	C++23	1.6kb	2023-11-16 14:45:51	2023-11-16 14:45:51

Judging History

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

[2023-11-16 14:45:51]
评测

测评结果：WA
用时：22ms
内存：5520kb

查看

[2023-11-16 14:45:51]
提交

answer

#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
const int N=300005;
int n,m;
int a[N],b[N];
void solve()
{
  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+n+1);
  sort(b+1,b+m+1);
  long long tot=0;
  for(int i=1;i<=m;i++)
    if(a[n-m+i]>b[i])
    {
      cout<<-1<<"\n";
      return;
    }
    else tot+=b[i]-a[n-m+i];
  if(tot>n-m)
  {
    cout<<-1<<"\n";
    return;
  }
  multiset<int>s;
  for(int i=1;i<=n;i++)
    s.insert(a[i]);
  vector<int>ans;
  for(int i=1;i<=(n-m)-tot;i++)
  {
    int v=*s.begin();
    s.erase(s.begin());
    ans.emplace_back(v);
    s.insert(v+1);;
    s.erase(s.begin());
  }
  for(int i=m;i>=1;i--)
  {
    auto it=s.lower_bound(a[n-m+i]);
    if(it==s.end()||*it!=a[n-m+i])
    {
      cout<<-1<<"\n";
      return;
    }
    for(;a[n-m+i]<b[i];a[n-m+i]++)
    {
      ans.emplace_back(a[n-m+i]);
      s.erase(s.lower_bound(a[n-m+i]));
      s.insert(a[n-m+i]+1);
      s.erase(s.begin());
    }
  }
  for(int i=1;i<=m;i++)
  {
    if(*s.begin()!=b[i])
    {
      cout<<-1<<"\n";
      return;
    }
    s.erase(s.begin());
  }
  int l=ans.size();
  cout<<l<<"\n";
  for(int u:ans)
    cout<<u<<" ";
  cout<<"\n";
  return;
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr),cout.tie(nullptr);
  int T;
  cin>>T;
  while(T--)
    solve();
  return 0;
}

/*
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
*/

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3384kb

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: 0

Accepted

time: 3ms

memory: 3384kb

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:

ok ok (7056 test cases)

Test #3:

score: 0

Accepted

time: 2ms

memory: 3408kb

input:

output:

-1
-1
2
1 2 
-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
2
2 3 
-1
-1
-1
2
1 1 
2
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
2
3 4 
-1
-1
-1
2
1 1 
2
3 1 
-1
-1
-1
2
1 2 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
...

result:

ok ok (5880 test cases)

Test #4:

score: 0

Accepted

time: 2ms

memory: 5436kb

input:

output:

result:

ok ok (2640 test cases)

Test #5:

score: 0

Accepted

time: 6ms

memory: 5520kb

input:

output:

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

result:

ok ok (14112 test cases)

Test #6:

score: 0

Accepted

time: 3ms

memory: 3444kb

input:

output:

-1
-1
-1
3
1 2 3 
-1
-1
3
1 1 1 
3
1 2 1 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
2 3 4 
-1
-1
3
1 2 1 
3
2 3 1 
-1
-1
3
2 1 2 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
3 4 5 
-1
-1
3
1 3 1 
3
3 4 1 
-1
3
1 1 2 
3
3 1 2 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
1 4 1 
3
4...

result:

ok ok (5292 test cases)

Test #7:

score: 0

Accepted

time: 0ms

memory: 3476kb

input:

output:

result:

ok ok (3234 test cases)

Test #8:

score: 0

Accepted

time: 4ms

memory: 3504kb

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
-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
...

result:

ok ok (8820 test cases)

Test #9:

score: 0

Accepted

time: 9ms

memory: 3428kb

input:

26460
6 5
1 1 1 1 1 1
1 1 1 1 1
6 5
1 1 1 1 1 1
1 1 1 1 2
6 5
1 1 1 1 1 1
1 1 1 1 3
6 5
1 1 1 1 1 1
1 1 1 1 4
6 5
1 1 1 1 1 1
1 1 1 1 5
6 5
1 1 1 1 1 1
1 1 1 2 2
6 5
1 1 1 1 1 1
1 1 1 2 3
6 5
1 1 1 1 1 1
1 1 1 2 4
6 5
1 1 1 1 1 1
1 1 1 2 5
6 5
1 1 1 1 1 1
1 1 1 3 3
6 5
1 1 1 1 1 1
1 1 1 3 4
6 5
1 1 ...

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

ok ok (26460 test cases)

Test #10:

score: 0

Accepted

time: 22ms

memory: 3512kb

input:

50000
6 4
1 1 1 1 1 1
1 1 1 1
6 4
1 1 1 1 1 1
1 1 1 2
6 4
1 1 1 1 1 1
1 1 1 3
6 4
1 1 1 1 1 1
1 1 1 4
6 4
1 1 1 1 1 1
1 1 1 5
6 4
1 1 1 1 1 1
1 1 1 6
6 4
1 1 1 1 1 1
1 1 2 2
6 4
1 1 1 1 1 1
1 1 2 3
6 4
1 1 1 1 1 1
1 1 2 4
6 4
1 1 1 1 1 1
1 1 2 5
6 4
1 1 1 1 1 1
1 1 2 6
6 4
1 1 1 1 1 1
1 1 3 3
6 4
1 ...

output:

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

result:

ok ok (50000 test cases)

Test #11:

score: 0

Accepted

time: 12ms

memory: 3420kb

input:

25872
6 3
1 1 1 1 1 1
1 1 1
6 3
1 1 1 1 1 1
1 1 2
6 3
1 1 1 1 1 1
1 1 3
6 3
1 1 1 1 1 1
1 1 4
6 3
1 1 1 1 1 1
1 1 5
6 3
1 1 1 1 1 1
1 1 6
6 3
1 1 1 1 1 1
1 2 2
6 3
1 1 1 1 1 1
1 2 3
6 3
1 1 1 1 1 1
1 2 4
6 3
1 1 1 1 1 1
1 2 5
6 3
1 1 1 1 1 1
1 2 6
6 3
1 1 1 1 1 1
1 3 3
6 3
1 1 1 1 1 1
1 3 4
6 3
1 1 ...

output:

-1
-1
-1
3
1 2 3 
-1
-1
-1
3
1 2 1 
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
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
3
2 3 4 
-1
-1
-1
3
2 3 1 
-1
-1
3
2 1 2 
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
1 1 1 
3
2 1 1 
-1
-1
-1
-1
-1
...

result:

ok ok (25872 test cases)

Test #12:

score: -100

Wrong Answer

time: 12ms

memory: 3416kb

input:

25872
6 2
1 1 1 1 1 1
1 1
6 2
1 1 1 1 1 1
1 2
6 2
1 1 1 1 1 1
1 3
6 2
1 1 1 1 1 1
1 4
6 2
1 1 1 1 1 1
1 5
6 2
1 1 1 1 1 1
1 6
6 2
1 1 1 1 1 1
1 7
6 2
1 1 1 1 1 1
2 2
6 2
1 1 1 1 1 1
2 3
6 2
1 1 1 1 1 1
2 4
6 2
1 1 1 1 1 1
2 5
6 2
1 1 1 1 1 1
2 6
6 2
1 1 1 1 1 1
2 7
6 2
1 1 1 1 1 1
3 3
6 2
1 1 1 1 1 ...

output:

result:

wrong answer Jury has answer but participant has not (test case 37)