QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#731582	#9574. Strips	DBsoleil^#	WA	22ms	3964kb	C++23	1.2kb	2024-11-10 09:38:59	2024-11-10 09:39:00

Judging History

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

[2024-11-10 09:39:00]
评测

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

查看

[2024-11-10 09:38:59]
提交

answer

#include<bits/stdc++.h>
#define pb push_back
#define fi first 
#define se second 
using namespace std;
typedef pair<int,int> pii;

const int N=2e5+5;
int n1,n2,k,n,m;
int R[N];
pii p[N];
vector<int> ans;

void input()
{
    scanf("%d%d%d%d",&n1,&n2,&k,&m),n=n1+n2;
    for(int i=1,x;i<=n1;i++) scanf("%d",&x),p[i]={x,1};
    for(int i=1,x;i<=n2;i++) scanf("%d",&x),p[i+n1]={x,2};
    sort(p+1,p+n+1);
    ans.clear();
}

int calc()
{
    int nw=0,lst=0,res=0;
    for(int i=1;i<=n;i++)
    {
        if(p[i].se==2) {lst=p[i].fi; continue;}
        if(nw>=p[i].fi) continue;
        int r=R[i],x=p[i].fi;
        if(r-k<=lst||r-k<=nw) return -1;
        if(r>x+k-1) ans.pb(x),nw=x+k-1,res++;
        else ans.pb(r-k),nw=r-1,res++;
    }
    return res;
}

void solve()
{
    input();
    R[n+1]=m+1;
    for(int i=n;i>=1;i--) R[i]=p[i].se==2?p[i].fi:R[i+1];
    // for(int i=1;i<=n;i++)
    // {
    //     cerr<<' '<<p[i].fi<<' '<<p[i].se<<' '<<R[i]<<endl;

    // }
    int res=calc();
    printf("%d\n",res);
    if(res==-1) return;
    for(int x:ans) printf("%d ",x);
    printf("\n");
}

int main()
{
    int T=1;
    scanf("%d",&T);
    while(T--) solve();
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3964kb

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

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 
-1
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 
2
7 25 
1...

result:

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