QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#784490#9574. Stripswsxcb#WA 31ms3616kbC++171.0kb2024-11-26 15:09:152024-11-26 15:09:38

Judging History

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

  • [2024-11-26 15:09:38]
  • 评测
  • 测评结果:WA
  • 用时:31ms
  • 内存:3616kb
  • [2024-11-26 15:09:15]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

void solve() {
	int n, m, k, w;
	cin >> n >> m >> k >> w;
	vector<int>a(n + 1);
	set<int>st;
	for (int i = 1 ; i <= n ; i++)
		cin >> a[i];
	for (int i = 1 ; i <= m ; i++) {
		int x;
		cin >> x;
		st.insert(x);
	}
	st.insert(0);
	st.insert(w + 1);
	sort(a.begin() + 1, a.end());
	vector<int>ans;
	for (int i = 1; i <= n; i++) {
		auto it = st.upper_bound(a[i]);
		int l = *prev(it);
		int x = upper_bound(a.begin() + 1, a.end(), a[i] + k - 1) - a.begin() - 1;
		int lt = max(l + 1, a[x] - k + 1);
		//	cout << lt << ' ';
		if (lt + k - 1 >= (*it)) {
			//cout << i << ' ';
			cout << "-1\n";
			return ;
		}
		ans.pb(lt);
		st.insert(lt + k - 1);
		i = x;
	}
	cout << ans.size() << '\n';
	for (auto x : ans) {
		cout << x << ' ';
	}
	cout << '\n';
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3612kb

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:

4
1 7 10 14 
-1
2
1 4 
-1

result:

ok ok 4 cases (4 test cases)

Test #2:

score: -100
Wrong Answer
time: 31ms
memory: 3616kb

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
2 32 
7
3 4 14 22 28 36 40 
3
22 46 64 
8
1 7 20 24 30 36 54 63 
3
3 14 30 
6
1 7 11 30 41 47 
4
14 27 34 47 
2
42 65 
1
27 
1
9 
1
62 
5
24 33 42 47 60 
2
3 31 
3
11 19 29 
3
2 15 33 
3
25 30 42 
3
2 17 59 
4
1 11 21 32 
2
53 65 
3
49 58 65 
3
43 60 78 
1
78 
4
1 11 15 21 
5
3 7 17 36 48 
2
1 44 ...

result:

wrong answer Participant didn't find a solution but the jury found one. (test case 48)