QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#722080	#9574. Strips	ucup-team4474^#	WA	17ms	3792kb	C++20	2.1kb	2024-11-07 17:43:09	2024-11-07 17:43:10

Judging History

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

[2024-11-07 17:43:10]
评测

测评结果：WA
用时：17ms
内存：3792kb

查看

[2024-11-07 17:43:09]
提交

answer

#include <bits/stdc++.h>
using namespace std;

bool Memory_begin;

bool Memory_end;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        int n, m, k, w;
        cin >> n >> m >> k >> w;
        priority_queue<int, vector<int>, greater<int>> q1, q2;
        q2.push(w + 1);
        for (int i = 1, x; i <= n; i++)
            cin >> x, q1.push(x);
        for (int i = 1, x; i <= m; i++)
            cin >> x, q2.push(x);

        vector<int> ans;
        bool flag = true;
        int l = 0;
        while (!q2.empty() and flag)
        {
            int r = q2.top();
            q2.pop();
            int pre = l + 1, extra = 0;
            while (!q1.empty() and q1.top() < r)
            {
                int cur = q1.top();
                if (cur + k <= r)
                {
                    extra += cur - pre;
                    ans.push_back(cur);
                    while (!q1.empty() and q1.top() < cur + k)
                        q1.pop();
                    pre = cur + k;
                }
                else
                {
                    int need = cur + k - r;
                    if (extra < need)
                    {
                        flag = false;
                        break;
                    }
                    else
                    {
                        extra -= need;
                        ans.push_back(r - k);
                        while (!q1.empty() and q1.top() <= r)
                            q1.pop();
                        pre = r;
                    }
                }
            }
            l = r;
        }
        if (!flag)
            cout << "-1\n";
        else
        {
            cout << ans.size() << '\n';
            for (int i = (int)ans.size() - 2; i >= 0; i--)
                ans[i] = min(ans[i], ans[i + 1] - k);
            for (int i : ans)
                cout << i << ' ';
            cout << '\n';
        }
    }
}
/*
 */

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3668kb

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

memory: 3792kb

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 
-1
8
3 9 22 26 31 38 54 65 
3
5 15 30 
-1
4
17 30 39 49 
2
52 67 
1
27 
1
22 
-1
-1
2
4 31 
-1
-1
3
25 30 42 
3
3 17 60 
-1
2
54 66 
3
50 59 65 
3
50 62 78 
-1
-1
-1
-1
-1
-1
-1
3
25 27 44 
3
7 8 36 
-1
-1
-1
1
38 
-1
4
35 43 87 92 
4
18 28 43 47 
-1
-1
-1
-1
-1
4
1 7 3...

result:

wrong answer Participant didn't find a solution but the jury found one. (test case 3)