QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#740228 | #9574. Strips | fosov | WA | 18ms | 3560kb | C++14 | 2.1kb | 2024-11-13 05:03:40 | 2024-11-13 05:03:41 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define N 100010
#define K 20
int main() {
#ifdef TEST
freopen("zz.in", "r+", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t; cin >> t;
while (t --) {
int n, m, k, w; cin >> n >> m >> k >> w;
vector<pii> arr;
arr.emplace_back(0, 0);
arr.emplace_back(w+1, 0);
for (int i = 0; i < n; ++ i) {
int a; cin >> a; arr.emplace_back(a, 1);
}
for (int i = 0; i < m; ++ i) {
int b; cin >> b; arr.emplace_back(b, 0);
}
sort(arr.begin(), arr.end());
vector<int> res;
bool ok = 1;
for (int i = 0, j = 0; i < arr.size() - 1; ++ i) {
if (arr[i].second || !arr[i+1].second) continue;
while (j <= i || arr[j].second) ++ j;
int sz = arr[j].first - arr[i].first - 1;
vector<int> cur;
cur.emplace_back(arr[i+1].first);
for (int l = i+2; l < j; ++ l) {
if (cur.back() + k > arr[l].first) continue;
cur.emplace_back(arr[l].first);
}
if (1ll * k * cur.size() > sz) {
ok = 0;
break;
}
int lb = arr[i].first;
int rb = arr[j].first;
int d = cur.back() + k > rb ? (cur.back() + k - rb) : 0;
for (int l = cur.size() - 1; l >= 0 && d; -- l) {
int dis = l ? (cur[l] - cur[l-1] + k) : 0;
if (!l) assert(cur[l] - lb >= d);
cur[l] -= d;
d = max(0, d - dis);
}
for (auto x : cur) res.emplace_back(x);
i = j - 1;
}
if (!ok) {
cout << -1 << '\n';
continue;
}
cout << res.size() << '\n';
for (auto x : res) cout << x << ' ';
cout << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
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 2 7 10 14 -1 2 1 5 -1
result:
ok ok 4 cases (4 test cases)
Test #2:
score: -100
Wrong Answer
time: 18ms
memory: 3560kb
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 3 32 7 3 4 14 22 28 36 40 3 32 48 66 8 3 9 22 26 31 38 54 65 3 5 15 30 6 1 8 12 31 41 47 4 17 30 39 49 2 52 67 1 27 1 22 1 62 5 24 33 43 48 60 2 4 31 3 11 20 31 3 3 16 33 3 25 30 42 3 3 17 60 4 2 15 21 33 2 54 66 3 50 59 65 3 50 62 78 1 81 4 2 11 16 23 5 3 7 17 36 49 2 1 45...
result:
wrong answer There are more than one stripe covering cell 21 (test case 18)