QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#250655 | #7678. The Game | MasterGwx | WA | 24ms | 3484kb | C++14 | 2.3kb | 2023-11-13 15:07:54 | 2023-11-13 15:07:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
typedef long long ll;
const int N=2e5+5;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const ll INF=1e18+3;
#define DEBUG
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif
//debug(n,m);debug("a,b");
//double max:0x7f,0x43 min:0xfe 0x c2 int:0x3f
//运算符 priority 后缀 前缀 */+- 位移 比较 &^| && || 赋值
int T,t;
void solve()
{
int n,m;
int t;
cin>>n>>m;
vector<int> a(n),b(m),ans,res;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
int k=0,p1=n-1,p2=m-1;
while(k<=n-m && p2>=0){
if(a[p1]>b[p2] || k>p1) {
cout<<-1<<'\n';
return;
}
for(int i=a[p1];i<b[p2];i++) ans.push_back(i);
k+=b[p2]-a[p1];
p2--,p1--;
}
if(k>n-m || p2>=0){
cout<<"-1\n";
return;
}
priority_queue<int,vector<int>,greater<int>> q;
for(int i=0;i<n;i++) q.push(a[i]);
//debug(q.size());
for(int i=1;i<=n-m-k;i++){
int x=q.top();
q.pop();
res.push_back(x);
//debug(x);
q.push(x+1);
q.pop();
}
a.clear();
while(!q.empty()){
a.push_back(q.top());
q.pop();
}
//for(auto i:a) cout<<i<<' '; cout<<endl;
k=n-m-k,p1=a.size()-1,p2=m-1;
t=0;
while(k<=n-m && p2>=0){
if(a[p1]>b[p2] ) {
cout<<-1<<'\n';
return;
}
for(int i=a[p1];i<b[p2];i++) res.push_back(i);
k+=b[p2]-a[p1];
t+=b[p2]-a[p1];
p2--,p1--;
}
while(k<n-m){
if(a[t]>=b[0]) {
cout<<"-1\n";
return;
}
res.push_back(a[t]);
t++; k++;
}
if(k!=n-m){
cout<<"-1\n";
return;
}
cout<<res.size()<<'\n';
for(auto i:res) cout<<i<<" ";
cout<<'\n';
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#if 1
cin>>T;
for(int i=1;i<=T;i++) {
t++;
solve();
}
#else
solve();
#endif
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3376kb
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:
2 1 3 -1 3 2 4 4 5 1 1 2 3 2 2 1 1 -1
result:
ok ok (6 test cases)
Test #2:
score: 0
Accepted
time: 3ms
memory: 3368kb
input:
7056 4 3 1 1 1 1 1 1 1 4 3 1 1 1 1 1 1 2 4 3 1 1 1 1 1 1 3 4 3 1 1 1 1 1 1 4 4 3 1 1 1 1 1 1 5 4 3 1 1 1 1 1 1 6 4 3 1 1 1 1 1 2 2 4 3 1 1 1 1 1 2 3 4 3 1 1 1 1 1 2 4 4 3 1 1 1 1 1 2 5 4 3 1 1 1 1 1 2 6 4 3 1 1 1 1 1 3 3 4 3 1 1 1 1 1 3 4 4 3 1 1 1 1 1 3 5 4 3 1 1 1 1 1 3 6 4 3 1 1 1 1 1 4 4 4 3 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 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: 3ms
memory: 3400kb
input:
5880 4 2 1 1 1 1 1 1 4 2 1 1 1 1 1 2 4 2 1 1 1 1 1 3 4 2 1 1 1 1 1 4 4 2 1 1 1 1 1 5 4 2 1 1 1 1 1 6 4 2 1 1 1 1 1 7 4 2 1 1 1 1 2 2 4 2 1 1 1 1 2 3 4 2 1 1 1 1 2 4 4 2 1 1 1 1 2 5 4 2 1 1 1 1 2 6 4 2 1 1 1 1 2 7 4 2 1 1 1 1 3 3 4 2 1 1 1 1 3 4 4 2 1 1 1 1 3 5 4 2 1 1 1 1 3 6 4 2 1 1 1 1 3 7 4 2 1 1...
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: 1ms
memory: 3484kb
input:
2640 4 1 1 1 1 1 1 4 1 1 1 1 1 2 4 1 1 1 1 1 3 4 1 1 1 1 1 4 4 1 1 1 1 1 5 4 1 1 1 1 1 6 4 1 1 1 1 1 7 4 1 1 1 1 1 8 4 1 1 1 1 2 1 4 1 1 1 1 2 2 4 1 1 1 1 2 3 4 1 1 1 1 2 4 4 1 1 1 1 2 5 4 1 1 1 1 2 6 4 1 1 1 1 2 7 4 1 1 1 1 2 8 4 1 1 1 1 3 1 4 1 1 1 1 3 2 4 1 1 1 1 3 3 4 1 1 1 1 3 4 4 1 1 1 1 3 5 4...
output:
-1 -1 3 1 2 1 3 1 2 3 -1 -1 -1 -1 -1 -1 3 1 1 2 3 1 2 3 3 2 3 4 -1 -1 -1 -1 -1 3 1 1 2 3 1 1 3 3 1 3 4 3 3 4 5 -1 -1 -1 -1 -1 3 1 1 2 3 1 1 4 3 1 4 5 3 4 5 6 -1 -1 -1 -1 -1 3 1 1 2 3 1 1 5 3 1 5 6 3 5 6 7 -1 -1 -1 -1 -1 3 1 1 2 3 1 1 6 3 1 6 7 -1 -1 -1 -1 -1 -1 3 1 1 2 3 1 1 7 ...
result:
ok ok (2640 test cases)
Test #5:
score: 0
Accepted
time: 6ms
memory: 3420kb
input:
14112 5 3 1 1 1 1 1 1 1 1 5 3 1 1 1 1 1 1 1 2 5 3 1 1 1 1 1 1 1 3 5 3 1 1 1 1 1 1 1 4 5 3 1 1 1 1 1 1 1 5 5 3 1 1 1 1 1 1 1 6 5 3 1 1 1 1 1 1 2 2 5 3 1 1 1 1 1 1 2 3 5 3 1 1 1 1 1 1 2 4 5 3 1 1 1 1 1 1 2 5 5 3 1 1 1 1 1 1 2 6 5 3 1 1 1 1 1 1 3 3 5 3 1 1 1 1 1 1 3 4 5 3 1 1 1 1 1 1 3 5 5 3 1 1 1 1 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 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: 3392kb
input:
5292 5 2 1 1 1 1 1 1 1 5 2 1 1 1 1 1 1 2 5 2 1 1 1 1 1 1 3 5 2 1 1 1 1 1 1 4 5 2 1 1 1 1 1 1 5 5 2 1 1 1 1 1 1 6 5 2 1 1 1 1 1 2 2 5 2 1 1 1 1 1 2 3 5 2 1 1 1 1 1 2 4 5 2 1 1 1 1 1 2 5 5 2 1 1 1 1 1 2 6 5 2 1 1 1 1 1 3 3 5 2 1 1 1 1 1 3 4 5 2 1 1 1 1 1 3 5 5 2 1 1 1 1 1 3 6 5 2 1 1 1 1 1 4 4 5 2 1 1...
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 2 1 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: 2ms
memory: 3380kb
input:
3234 5 1 1 1 1 1 1 1 5 1 1 1 1 1 1 2 5 1 1 1 1 1 1 3 5 1 1 1 1 1 1 4 5 1 1 1 1 1 1 5 5 1 1 1 1 1 1 6 5 1 1 1 1 1 1 7 5 1 1 1 1 1 2 1 5 1 1 1 1 1 2 2 5 1 1 1 1 1 2 3 5 1 1 1 1 1 2 4 5 1 1 1 1 1 2 5 5 1 1 1 1 1 2 6 5 1 1 1 1 1 2 7 5 1 1 1 1 1 3 1 5 1 1 1 1 1 3 2 5 1 1 1 1 1 3 3 5 1 1 1 1 1 3 4 5 1 1 1...
output:
-1 -1 4 1 1 2 2 4 1 2 3 1 4 1 2 3 4 -1 -1 -1 -1 4 1 1 2 2 4 1 1 2 3 4 1 2 3 4 4 2 3 4 5 -1 -1 -1 -1 4 1 1 2 3 4 1 1 3 4 4 1 3 4 5 4 3 4 5 6 -1 -1 -1 4 1 1 2 3 4 1 1 2 4 4 1 1 4 5 4 1 4 5 6 -1 -1 -1 -1 4 1 1 2 3 4 1 1 2 5 4 1 1 5 6 -1 -1 -1 -1 -1 4 1 1 2 3 4 1 1 2 6 -1 -1 -1 -1 -1...
result:
ok ok (3234 test cases)
Test #8:
score: 0
Accepted
time: 4ms
memory: 3436kb
input:
8820 5 4 1 1 1 1 1 1 1 1 1 5 4 1 1 1 1 1 1 1 1 2 5 4 1 1 1 1 1 1 1 1 3 5 4 1 1 1 1 1 1 1 1 4 5 4 1 1 1 1 1 1 1 1 5 5 4 1 1 1 1 1 1 1 2 2 5 4 1 1 1 1 1 1 1 2 3 5 4 1 1 1 1 1 1 1 2 4 5 4 1 1 1 1 1 1 1 2 5 5 4 1 1 1 1 1 1 1 3 3 5 4 1 1 1 1 1 1 1 3 4 5 4 1 1 1 1 1 1 1 3 5 5 4 1 1 1 1 1 1 1 4 4 5 4 1 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 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: 10ms
memory: 3412kb
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: 24ms
memory: 3412kb
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: 3444kb
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: 3404kb
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:
-1 -1 -1 -1 4 1 2 3 4 -1 -1 4 1 1 1 1 4 1 2 1 1 4 1 2 3 1 -1 -1 -1 4 1 2 1 2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 4 2 3 4 5 -1 -1 -1 4 1 2 3 1 4 2 3 4 1 -1 -1 4 1 2 2 1 4 2 3 1 2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 4 3 4 5 6 -1 -1 -1 4 1 3 4 1 4 3...
result:
wrong answer Wrong answer, erase a number that does not exist (test case 8)