QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#732826	#9574. Strips	mhw^#	WA	25ms	3652kb	C++23	2.4kb	2024-11-10 16:01:48	2024-11-10 16:01:50

Judging History

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

[2024-11-10 16:01:50]
评测

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

查看

[2024-11-10 16:01:48]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const ll inf = 2e18;
#define pii pair<ll, ll>

void slv() {
    ll n, m, k, w; cin >> n >> m >> k >> w;
    vector<ll> a(n + 1), b(m + 1);
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= m; ++i) cin >> b[i];
    b.push_back(w + 1), b[0] = 0;
    sort(a.begin() + 1, a.end()), sort(b.begin(), b.end());
    vector<ll> ans;
    
    int p = 1;
    for(int i = 0; i + 1 < b.size(); ++i) {
        ll l = b[i] + 1, r = b[i + 1] - 1;
        vector<ll> pos;
        while(p <= n && l <= a[p] && a[p] <= r) {
           pos.push_back(a[p]);
           p++;
        }

        vector<ll> tmp_ans;
        ll now = -inf;
        for(auto x:pos) {
            if(x > now + k - 1) {
                tmp_ans.push_back(x);
                now = x;
            }
        }

        if(tmp_ans.size()) {
            ll ecd = tmp_ans.back() + k - 1 - r;
            if(ecd > 0) {
                vector<ll> pr(tmp_ans.size());
                for(int i = (int)tmp_ans.size() - 1; i >= 0; --i) {
                    ll can_pr;
                    if(i == 0) {
                        can_pr = tmp_ans[i] - l;
                    } else {
                        can_pr = tmp_ans[i] - (tmp_ans[i - 1] + k - 1) - 1;
                    }

                    // cout << can_pr << " " << ecd << endl;
                    if(can_pr >= ecd) {
                        pr[i] = ecd;
                        ecd = 0;
                        break;
                    } else {
                        ecd -= can_pr;
                    }
                }

                if(ecd > 0) {
                    cout << -1 << endl;
                    return ;
                }

                for(int i = 1; i < pr.size(); ++i) {
                    pr[i] += pr[i - 1];
                }

                for(int i = 0; i < tmp_ans.size(); ++i) {
                    tmp_ans[i] -= pr[i];
                }                
            }

        }

        for(auto x:tmp_ans) ans.push_back(x);
    }

    cout << ans.size() << endl;
    for(auto x: ans) cout << x << " ";
    cout << endl;
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int _ = 1;
    cin >> _;
    while(_--) slv();
    return 0;
}
/*
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
*/

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3520kb

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: 3652kb

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 14 24 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 31 (test case 18)