QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#758226	#9574. Strips	WTR2007	TL	0ms	3836kb	C++20	1.7kb	2024-11-17 16:53:19	2024-11-17 16:53:19

Judging History

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

[2024-11-17 16:53:19]
评测

测评结果：TL
用时：0ms
内存：3836kb

查看

[2024-11-17 16:53:19]
提交

answer

#include<bits/stdc++.h>
#define fi first
#define se second
#define MULT_TEST 1
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n, m, k, w;
    n = read(), m = read(), k = read(), w = read();
    vector<int> col(w + 1), b(m + 2);
    for (int a, i = 1; i <= n; i++) col[a = read()] = 1;
    b[0] = 0, b[m + 1] = w + 1;
    for (int i = 1; i <= m; i++) b[i] = read();
    sort(b.begin() + 1, b.end());
    vector<int> A;
    for (int i = 1; i <= m + 1; i++) {
        if (b[i] - b[i - 1] == 1) continue;
        int pos = b[i - 1] + 1, sum = 0;
        while (pos < b[i]) {
            if (col[pos] == 1) sum++, pos += k;
            else pos++;
        }
        if (b[i] - b[i - 1] - 1 < sum * k)
            return printf("-1\n"), void();
        pos = b[i - 1] + 1;
        while (pos <= b[i] - k) {
            if (b[i] - pos == sum * k) {
                for (int j = pos; j < b[i]; j += k) A.push_back(j);
                break;
            }
            if (col[pos] != 1) pos++;
            else sum--, A.push_back(pos), pos += k;
        }
    }
    printf("%d\n", (int)A.size());
    for (auto u : A) printf("%d ", u);
    puts("");
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3836kb

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

Time Limit Exceeded

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...