QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#751745 | #9574. Strips | downfall | WA | 23ms | 5732kb | C++17 | 2.2kb | 2024-11-15 20:26:05 | 2024-11-15 20:26:07 |
Judging History
answer
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define frep(i, l, r) for (int i = l; i >= r; i--)
#define eb emplace_back
#define pb push_back
#define endl "\n"
#define int long long
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int N = 2e5 + 3;
const int inf = 0x3f3f3f3f;
int a[N], b[N];
PII c[N];
void solve()
{
int n, m, k, w;
cin >> n >> m >> k >> w;
rep(i, 1, n)
{
cin >> a[i];
c[i] = {a[i], 1};
}
rep(i, 1, m)
{
cin >> b[i];
c[i + n] = {b[i], 2};
}
sort(c + 1, c + 1 + n + m);
c[0] = {0, 2}, c[n + m + 1] = {w + 1, 2};
// rep(i, 0, n + m + 1) cout << c[i].first << " " << c[i].second << endl;
int pre = 0, st = 0;
vector<int> v, ans;
rep(i, 1, n + m + 1)
{
if (c[i].second == 1)
{
if (pre != 0 && pre + k - 1 >= c[i].first)
continue;
else
{
if (pre != 0)
v.push_back(pre);
pre = c[i].first;
}
}
else
{
if (pre == 0)
continue;
v.push_back(pre);
int p = (int)v.size(), nxt = c[i].first;
// cerr << "p:" << p << endl;
// cerr << "st ed:" << st << " " << nxt << endl;
for (int j = p - 1; j >= 0; j--) // end = nxt - 1
{
// cerr << v[j] << "-" << nxt << "-";
if (v[j] + k - 1 >= nxt)
v[j] = nxt - 1 - k + 1;
nxt = v[j];
// cerr << nxt << " ";
}
if (v[0] <= st)
return cout << "-1" << endl, void();
st = c[i].first;
pre = 0;
for (auto k : v)
ans.push_back(k);
v.clear();
}
}
cout << (int)ans.size() << endl;
for (auto x : ans)
cout << x << " ";
cout << endl;
}
signed main()
{
IOS;
int T = 1;
cin >> T;
while (T--)
solve();
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5672kb
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: 23ms
memory: 5732kb
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 1 11 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 is at least one stripe covering black cell 7 (test case 49)