QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#750176 | #9574. Strips | UESTC_DECAYALI# | WA | 25ms | 3792kb | C++20 | 2.2kb | 2024-11-15 13:14:28 | 2024-11-15 13:14:28 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <functional>
#include <cassert>
bool solve(int L, const std::vector<int> &a, int R, int w, std::function<void(int)> callback) {
int n = a.size();
// std::cerr << "debug(" << L << ", " << R << "): ";
// for(int i = 0; i < n; ++i) std::cerr << a[i] << char(i == n - 1 ? 10 : 32);
int p = std::max(a[0] - w + 1, L + 1), l = a[0];
for(int i = 1; i < n; ++i) {
if(a[i] <= p + w - 1) continue;
if(a[i] <= l + w - 1) {
p = a[i] - w + 1;
continue;
}
callback(p);
p = std::max(a[i] - w + 1, p + w);
if(p + w - 1 >= R) return false;
}
callback(p);
return true;
}
void work() {
int n, m, k, w;
std::cin >> n >> m >> k >> w;
std::vector<std::pair<int, int>> c(n + m + 2);
for(int i = 0; i < n; ++i) std::cin >> c[i].first, c[i].second = 1;
for(int i = n; i < n + m; ++i) std::cin >> c[i].first, c[i].second = 0;
c[n + m] = {w + 1, 0};
c[n + m + 1] = {0, 0};
std::sort(c.begin(), c.end());
int ans = 0, l = 0;
std::vector<int> strip;
while(l < c.size()) {
int pre_l = l; l++;
while(l < c.size() && c[l].second) l++;
if(l == c.size()) break;
assert(!c[pre_l].second && !c[l].second);
int pre = c[pre_l].first;
if(pre_l == l - 1) continue;
if(c[l].first - c[pre_l].first - 1 < k) {
std::cout << "-1\n";
return ;
}
std::vector<int> a(l - pre_l - 1);
for(int i = pre_l + 1; i < l; ++i) a[i - pre_l - 1] = c[i].first;
bool flag = solve(c[pre_l].first, a, c[l].first, k, [&](int pos) {
ans++;
strip.push_back(std::min(pos, c[l].first - k));
});
if(!flag) return std::cout << "-1\n", void(0);
pre = c[l].first;
}
std::cout << ans << char(10);
for(int i = 0; i < strip.size(); ++i) std::cout << strip[i] << char(i == strip.size() - 1 ? 10 : 32);
return ;
}
int main() {
std::ios::sync_with_stdio(false);
int T; std::cin >> T; while(T--) work();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3792kb
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: 25ms
memory: 3632kb
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 3 42 57 68 1 27 1 9 1 62 6 24 33 42 47 59 61 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 4 43 53 63 78 1 78 4 1 11 15 21 -1 2 1 44 2 7 25 1 4 4 9 18 29 32 3 2...
result:
wrong answer Participant's answer is 3. But jury has a better answer 2. (test case 8)