QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#750364 | #9574. Strips | UESTC_DECAYALI# | WA | 26ms | 3700kb | C++20 | 2.1kb | 2024-11-15 14:19:34 | 2024-11-15 14:19:35 |
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::vector<int> p(n), pre(n);
// std::cerr << "debug: ";
// for(int i = 0; i < n; ++i) std::cerr << a[i] << char(i == n - 1 ? 10 : 32);
int l = -1;
for(int r = 0; r < n; ++r) {
while(a[l + 1] <= a[r] - w) l++;
if(l < 0) p[r] = std::max(L + 1, r - w + 1);
else p[r] = std::max(p[l] + w, r - w + 1);
pre[r] = l;
}
if(p[n - 1] + w - 1 >= R) return false;
for(int i = n - 1; i >= 0; i = pre[i]) callback(p[i]);
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);
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: 3528kb
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 9 6 14 -1 2 1 4 -1
result:
ok ok 4 cases (4 test cases)
Test #2:
score: -100
Wrong Answer
time: 26ms
memory: 3700kb
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 31 7 3 2 14 21 30 29 28 3 22 46 63 8 4 1 20 17 30 35 54 59 3 3 14 29 6 7 5 3 1 43 41 4 8 34 27 47 2 48 37 1 18 1 9 1 40 5 10 29 27 48 46 2 1 19 3 19 11 29 3 1 9 31 3 6 5 42 3 1 8 50 4 21 11 1 32 2 52 50 3 43 53 63 3 52 42 78 1 21 4 1 8 18 15 5 1 7 19 17 39 2 1 43 2 7 25 1 4 4 9 18 25 22 3 28 26 ...
result:
wrong answer There is no stripe covering red cell 33 (test case 1)