QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#755043	#9574. Strips	Magical_Kingdom^#	WA	20ms	3688kb	C++17	2.1kb	2024-11-16 16:19:03	2024-11-16 16:19:04

Judging History

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

[2024-11-16 16:19:04]
评测

测评结果：WA
用时：20ms
内存：3688kb

查看

[2024-11-16 16:19:03]
提交

answer

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int n, m, k, w;
int a[maxn], b[maxn], c[maxn][3];
void solve() {
    int top = 0;
    cin >> n >> m >> k >> w;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= m; i++)
        cin >> b[i];
    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);
    m++;
    w++;
    b[0] = 0;
    b[m] = w + 1;
    int p = 0, l = 1, r = 0;
    while (p < m) {
        while (a[r + 1] < b[p + 1] && r < n)
            r++;
        if (l > r) {
            p++;
            continue;
        }
        if (b[p + 1] - b[p] <= k) {
            cout << "-1\n";
            return;
        }
        top++;
        c[top][0] = a[l];
        c[top][1] = c[top][2] = min(a[l] - b[p] - 1, k - 1);
        for (int i = l + 1; i <= r; i++) {
            if (c[top][0] + k - 1 >= a[i])
                continue;
            else {
                top++;
                c[top][0] = a[i];
                if (a[i] - (c[top - 1][0] + k) < k - 1) {
                    c[top][1] = a[i] - (c[top - 1][0] + k);
                    c[top][2] = c[top - 1][2] + c[top][1];
                } else
                    c[top][1] = c[top][2] = k - 1;
            }
        }
        if (c[top][0] + k - 1 >= b[p + 1]) {
            if (c[top][2] < c[top][0] + k - b[p + 1]) {
                cout << "-1\n";
                return;
            }
            int num = c[top][0] + k - b[p + 1], s = top;
            while (num > 0) {
                if (num > c[s][2]) {
                    c[s][0] = c[s][0] - c[s][2];
                    num -= c[s][2];
                } else {
                    c[s][0] = c[s][0] - num;
                    num = 0;
                }
                s--;
            }
        }
        p++;
        l = r + 1;
    }
    cout << top << "\n";
    for (int i = 1; i <= top; i++)
        cout << c[i][0] << " ";
    cout << "\n";
    return;
}

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

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3604kb

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:

result:

ok ok 4 cases (4 test cases)

Test #2:

score: -100

Wrong Answer

time: 20ms

memory: 3688kb

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 67 
8
3 9 22 26 31 38 54 65 
3
5 15 30 
6
1 8 12 31 41 48 
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
82 
4
2 11 16 23 
5
3 7 17 36 49 
2
1 45...

result:

wrong answer Integer parameter [name=l_i] equals to 67, violates the range [1, 66] (test case 3)