QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#786996	#9574. Strips	xiaofanger	WA	26ms	3596kb	C++17	2.1kb	2024-11-27 08:18:01	2024-11-27 08:18:01

Judging History

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

[2024-11-27 08:18:01]
评测

测评结果：WA
用时：26ms
内存：3596kb

查看

[2024-11-27 08:18:01]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

void solve() {
    int n, m, k, w;
    cin >> n >> m >> k >> w;
    vector<int>a(n + 1);
    set<int>st;
    for (int i = 1 ; i <= n ; i++)
        cin >> a[i];
    for (int i = 1 ; i <= m ; i++) {
        int x;
        cin >> x;
        st.insert(x);
    }
    st.insert(0);
    st.insert(w + 1);
    sort(a.begin() + 1, a.end());
    vector<int>ans;
    for (int i = 1; i <= n; i++) {
        auto it = st.upper_bound(a[i]);
        int ri = *it, le = *prev(it);

        int cur = i;
        vector<int> b;
        while (1) {
            int pos = upper_bound(a.begin() + 1, a.end(), a[cur] + k - 1) - a.begin() - 1;
            //cout << pos << ' ';
            if (a[pos] >= ri || (pos == cur && a[cur] + k - 1 >= ri)) {
                int suf = ri - k;
                for (int j = b.size() - 1 ; j >= 0 ; j--) {
                    if (b[j] + k - 1 >= suf) {
                        b[j] = suf - k;
                        suf = b[j];
                    } else {
                        break;
                    }
                }
                if (b.size() > 0 && b[0] <= le) {
                    cout << "-1\n";
                    return;
                }
                else if(ri - k <= le){
                	cout << "-1\n";
                	return;
                }
                b.push_back(ri - k);
                cur = pos + (cur == pos);
                break;
            } else {
                b.push_back(a[cur]);
                cur = pos + 1;

            }
            if (a[cur] >= ri || cur > n)
                break;
        }
        for(auto x : b) ans.push_back(x);
        i = cur - 1;
        //cout << '\n';
    }

    cout << ans.size() << '\n';
    for (auto x : ans) {
        cout << x << ' ';
    }
    cout << '\n';
}



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

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3596kb

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

memory: 3592kb

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 53 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
85 
4
2 11 16 23 
5
3 7 17 36 49 
2
1 52...

result:

wrong answer There is at least one stripe covering black cell 61 (test case 3)