QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#736857	#9574. Strips	ucup-team5799	WA	24ms	9352kb	C++14	2.1kb	2024-11-12 13:42:31	2024-11-12 13:42:31

Judging History

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

[2024-11-12 13:42:31]
评测

测评结果：WA
用时：24ms
内存：9352kb

查看

[2024-11-12 13:42:31]
提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using LL = long long;
const int N = 2e5 + 10;

vector <int> G[N];
struct PI {
    int ty;
    int x;
    bool operator < (PI &a) {
        return x < a.x;
    }
};

int head[N], tail[N];
void solve()
{
    int tot = 0;
    int n, m, k, w, x;
    cin >> n >> m >> k >> w;
    vector <PI> p;
    for(int i = 1; i <= n; i++) {
        G[i].clear();
        cin >> x;
        p.push_back({1, x});
    }
    for(int i = 1; i <= m; i++) {
        cin >> x;
        p.push_back({2, x});
    }
    sort(p.begin(), p.end());
    int R = p.size();

    head[++tot] = 1;
    for(int i = 0; i < R; i++) {
        if(p[i].ty == 1) G[tot].push_back(p[i].x);
        else {
            tail[tot] = p[i].x - 1;
            head[++tot] = p[i].x + 1;
        }
    }
    tail[tot] = w;

    vector <int> ans;
    int cnt = 0;
    for(int i = 1; i <= tot; i++) {
        if(!G[i].size()) continue;
        sort(G[i].begin(), G[i].end());
        vector <int> tmp;
        int end = 0;
        for(int j = 0; j < G[i].size(); j++) {
            int x = G[i][j];
            if(x > end) cnt++, end = x + k - 1, tmp.push_back(x);
        }
        if(end <= tail[i]) {
            for(auto it: tmp) ans.push_back(it);
        }
        else {
            int up = tail[i];
            for(int j = int(tmp.size() - 1); j >= 0; j--) {
                if(tmp[j] + k - 1 > up) {
                    tmp[j] = up - k + 1;
                    up = tmp[j] - 1;
                }
                else break;
            }
            if(up < head[i] - 1) {
                cout << -1 << '\n';
                return;
            }
            else {
                for(auto it : tmp) {
                    ans.push_back(it);
                }
            }
        }
    }
    cout << ans.size() << '\n';
    for(int i = 0; i < ans.size(); i++) cout << ans[i] << ' ';
    cout << '\n';
}

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

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 9352kb

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

memory: 8348kb

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 
-1
6
1 8 12 31 41 47 
4
17 30 39 49 
8
17 52 67 30 49 65 22 33 
1
27 
1
22 
6
16 24 62 30 40 49 
5
24 33 43 48 60 
2
4 31 
-1
7
3 14 16 18 26 28 33 
7
25 30 16 33 34 42 43 
6
3 17 45 47 34 60 
4
1 11 21 33 
2
54 66 
-1
3
50 62 78 
1
...

result:

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