QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#716551	#9574. Strips	KJJD^#	WA	25ms	3820kb	C++20	2.7kb	2024-11-06 15:30:38	2024-11-06 15:30:38

Judging History

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

[2024-11-06 15:30:38]
评测

测评结果：WA
用时：25ms
内存：3820kb

查看

[2024-11-06 15:30:38]
提交

answer

#include <bits/stdc++.h>
using namespace std;
void solve()
{
    int n, m, k, w;
    cin >> n >> m >> k >> w;
    using P = pair<int, int>;
    // pos,good
    vector<P> pos(1, P(0, 0));
    pos.push_back(P(w + 1, 0));
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        pos.push_back(P(x, 1));
    }
    for (int i = 0; i < m; i++)
    {
        int x;
        cin >> x;
        pos.push_back(P(x, 0));
    }
    sort(pos.begin(), pos.end());
    bool ok = 1;
    int sz = 0, L = -1;
    vector<int> R(n + m + 2);
    R[0] = k;
    // int res = 0;
    vector<int> res;
    vector<int> h;
    for (int i = 1, len = pos.size(); i < len; i++)
    {
        auto [p, g] = pos[i];
        if (g)
        {
            R[i] = max(R[i - 1], p);
            if (L == -1)
            {
                L = i;
                sz++;
                h.push_back(i);
            }
            else
            {
                assert(pos[L].second);
                if (R[i] - pos[L].first >= k)
                {
                    // res++;
                    int bk = h.back();
                    while (!h.empty() && R[h.back()] + k >= p && pos[h.back()].first + k >= p)
                    {
                        bk = h.back();
                        h.pop_back();
                    }
                    // assert(!h.empty());
                    res.push_back(R[bk] - k + 1);
                    R[i] = max(R[bk] + k, p);
                    // res.push_back(R[i - 1] - k + 1);
                    // R[i] = max(R[i - 1] + k, p);
                    h.clear();
                    sz = 1;
                    h.push_back(i);
                    L = i;
                }
                else
                {
                    h.push_back(i);
                    sz++;
                }
            }
        }
        else
        {
            if (!h.empty() && R[i - 1] >= p)
            {
                ok = false;
                break;
            }
            R[i] = p + k;
            if (sz)
            {
                res.push_back(R[i - 1] - k + 1);
                // res++;
            }
            h.clear();
            L = -1;
            sz = 0;
        }
    }
    if (!ok)
    {
        cout << -1 << '\n';
        return;
    }
    cout << res.size() << '\n';
    for (auto it : res)
        cout << it << ' ';
    cout << '\n';
}

int main()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--)
        solve();
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3820kb

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: 25ms

memory: 3644kb

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 32 
7
3 4 14 22 28 36 40 
3
22 46 64 
8
1 7 20 24 30 36 54 63 
3
3 14 30 
6
1 7 11 30 41 47 
4
14 27 34 47 
2
42 65 
1
27 
1
9 
1
62 
5
24 33 42 47 60 
2
3 31 
3
11 19 29 
3
2 15 33 
3
25 30 42 
3
2 17 59 
4
1 11 21 32 
2
53 65 
3
49 58 65 
3
43 60 78 
1
78 
4
1 11 15 21 
5
3 7 17 36 48 
2
1 44 ...

result:

wrong answer There is no stripe covering red cell 47 (test case 53)