QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#742804	#9574. Strips	ranxi	WA	22ms	3712kb	C++14	2.0kb	2024-11-13 17:21:21	2024-11-13 17:21:22

Judging History

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

[2024-11-13 17:21:22]
评测

测评结果：WA
用时：22ms
内存：3712kb

查看

[2024-11-13 17:21:21]
提交

answer

#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define vi vector<int>
#define alls(x) x.begin(),x.end()
#define PII pair<int,int>
void solve()
{
    int n,m,k,w;
    cin >> n >>m >>k >> w;
    vi 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];
    sort(a.begin()+1,a.end());
    sort(b.begin()+1,b.end());
    b.emplace_back(w+1);
    int now = 1;
    vi ans;
    auto calc = [&](vi x,int base,int lim)
    {
        vi tmp;
        int sz = x.size();
        int now = x[0];
        tmp.emplace_back(x[0]);
        for(int i = 0;i<sz;i++)
        {
            if(x[i]>now+k-1)
            {
                now = x[i];
                tmp.emplace_back(now);
            }
        }
        if(now+k-1<lim)
        {
            for(auto i:tmp)ans.emplace_back(i + base);
            return true;
        }
        if(tmp.size()==1)
            return false;
        *tmp.rbegin() = lim-k;
        now = lim-k;
        for(int i = tmp.size()-2;i>=0;i--)
        {
            if(tmp[i]+k-1<now)
            {
                break;
            }
            else
            {
                tmp[i] = now-k;
                now = tmp[i];
            }
        }
        if(tmp[0]>=1)
        {
            for(auto i:tmp)ans.emplace_back(i+base);
            return true;
        }
        return false;
    };
    for(int i = 1;i<=m+1;i++)
    {
        int st = b[i-1],ed = b[i];
        if(ed==st+1)continue;
        if(a[now]>ed)
            continue;
        vi t;
        while(now<=n && a[now]<ed)
            t.emplace_back(a[now++]-st);
        if(t.empty())continue;
        bool f = calc(t,st,ed-st);
        if(!f)
        {
            cout<<-1<<'\n';
            return;
        }
    }
    cout<<ans.size()<<'\n';
    for(auto i:ans)cout<<i<<" ";
    cout<<'\n';
}

int main()
{
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    int _ = 1;
    cin >> _;
    while(_--)solve();
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3712kb

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

memory: 3496kb

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 
6
1 8 12 31 41 47 
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 
4
4 33...

result:

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