QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#543270	#7678. The Game	rxzfn639	WA	2ms	5856kb	C++23	1.8kb	2024-09-01 15:29:36	2024-09-01 15:29:38

Judging History

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

[2024-09-01 15:29:38]
评测

测评结果：WA
用时：2ms
内存：5856kb

查看

[2024-09-01 15:29:36]
提交

answer

#include<bits/stdc++.h>
#define ll long long
#define int long long
#define pii make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
const ll inf = 1145141919810;
using namespace std;
inline ll read() {
	ll x=0,f=1;
	char c=getchar();
	while (c<'0' || c>'9') {
		if (c=='-')  f=-1;
		c=getchar();
	}
	while (c>='0' && c<='9') {
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void print(ll x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
	return ;
}
inline void pprint(ll x) {
	print(x);
	puts("");
}
const int N = 4e5 + 7;
ll a[N], b[N];
bool cmp(ll x, ll y){
	return x > y;
}
void slv() {
	int n = read(), m = read();
	rep(i, 1, n) a[i] = read();
	rep(i, 1, m) b[i] = read();
	sort(a + 1, a + 1 + n, cmp);
	sort(b + 1, b + 1 + m, cmp);
	if(n < m){
		puts("-1");
		return ;
	}
	vector<int> q, qq;
	ll rst = n - m;
	rep(i, 1, m){
		if(a[i] > b[i]){
			puts("-1");
			return ;
		}
		if(b[i] - a[i] <= rst){
			rep(j, a[i], b[i] - 1){
				qq.pb(j);
			}
			rst -= b[i] - a[i];
		}else{
			puts("-1");
			return ;
		}
	}

	priority_queue<ll> _q;
	for(int i = n; i > m && rst > 0; rst--, i--){
		if(a[i] >= b[m]){
			puts("-1");
			return ;
		}
		_q.push(-a[i]);
	}
    if (rst > 0) {
        cout << -1 << '\n';
        return;
    }

	while(_q.size()){
		ll x = -_q.top();
		if(x >= b[m]) {
			puts("-1");
			return ;
		}
        q.push_back(x);
		_q.pop();
		x++;
		_q.push(-x);
		_q.pop();
	}

    for (auto i: qq) q.push_back(i);

	pprint(q.size());

	for(auto x:q){
		print(x); putchar(' ');
	}
	puts("");
}
signed main() {
	int T = read();
	while(T--) {
		slv();
	}
	return 0;
}

/*
3
6 3
1 1 1 2 2 4
2 3 4

6 3
1 1 3 3 3 5
3 4 5

4 3
2 2 3 3
2 3 4
*/

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 5636kb

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

memory: 5580kb

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

memory: 5592kb

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

memory: 5856kb

input:

output:

result:

ok ok (2640 test cases)

Test #5:

score: 0

Accepted

time: 2ms

memory: 5824kb

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

Wrong Answer

time: 1ms

memory: 5636kb

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:

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