QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#773008	#9574. Strips	buling	WA	24ms	3644kb	C++14	2.1kb	2024-11-22 23:32:33	2024-11-22 23:32:33

Judging History

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

[2024-11-22 23:32:33]
评测

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

查看

[2024-11-22 23:32:33]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define lll i << 1
#define rrr i << 1 | 1




      
    const int N=2e5+6;

int ma,mi;
int  n,m,a[N],b[N],dd[N];
int ans=0;

void solve()
{
	string s,s2;
	int res=0,q,re;
	ans=0;
	cin>>n>>m>>re>>q;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int j=1;j<=m;j++)
		cin>>b[j];
	sort(a+1,a+n+1);
	sort(b+1,b+m+1);
	b[m+1]=q+1;
	a[n+1]=2e16;
	int j=1;
	for(int i=0;i<=m;i++)
	{
		for(;j<=n;)
		{
			map<int,int> mp;
			int k=j,l=b[i],tt=0;
			if(b[i]<a[j]&&b[i+1]>a[j])
			{
				for(k=j;k<=n;k++)
				{
					if(b[i]<a[k]&&b[i+1]>a[k])
					{
						if(l>=a[k])
							continue;
						tt++;
						int r=min(b[i+1]-1,a[k]+re-1);
						
						int yy=r-re+1;
						
                        int mm=l-yy+1;
                        
						if(yy>l)
						{
							mp[tt]+=yy-l-1;
							if(mp[tt]==0)
								mp.erase(tt);
						}
						else
						{
							for (auto it = mp.rbegin(); it != mp.rend(); it++)
							{
							    auto &[x,y]=*it;
							    if(y<=mm)
							    {
							    	mm-=y;
							    	y=0;
							    	mp.erase(x);
									if(mp.size()==0)
										break;	
								}
								else
								{
									y-=mm;	
									mm=0;
								}
							}
						}
						if(mm>0)
						{
                            cout<<-1<<"\n";
							return ;
                        }
						l=r;
					}
					else
						break;
						
				}
				int rer=b[i];
				for(int qw=ans+1;qw<=ans+tt;qw++)
				{
					dd[qw]=rer+mp[qw-ans]+1;
                    //cout<<qw<<" "<<j<<" "<<b[i]<<" "<<mp[qw-ans]<<" "<<rer<<" "<<dd[qw]<<"\n";
					rer=dd[qw]+re-1;			
				}
				j=k;
			}
			else
				break;
			ans+=tt;
			
		}
	}
	cout<<ans<<"\n";
	for(int i=1;i<=ans;i++)
		cout<<dd[i]<<" ";
	for(int i=1;i<=max(n,max(m,ans));i++)
	{
		a[i]=b[i]=dd[i]=0;
	}
	cout<<"\n";

}

signed main()
{
	std::ios::sync_with_stdio(false);//取消cin与stdin同步,加速读入 
	cin.tie(0);cout.tie(0);
 	int t;
 	t=1;
 	
	cin>>t;
	while(t--)
	{
		solve();
	}
	
    return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3644kb

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

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)