Submission #1110233

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1110233	2024-11-09T03:04:57 Z	vjudge1	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++17	9 / 100	5000 ms	29120 KB

Main

#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
ll n,a[600005],b[600005],c[600005];

int getb(int l,int r)
{
	vector<int> vb,vc;
	for(int i=1;i<l;i++) vc.pb(a[i]);
	for(int i=l;i<=r;i++) vb.pb(a[i]);
	for(int i=r+1;i<=2*n;i++) vc.pb(a[i]);
	sort(vc.begin(),vc.end());
	sort(vb.begin(),vb.end());
	
	ll mx=0;
	for(int i=1;i<=n;i++)
	{
		mx=max(mx,abs(b[i]-vb[i-1]));
	}
	
	for(int i=1;i<=n;i++)
	{
		mx=max(mx,abs(c[i]-vc[i-1]));
	}
	return mx;
}



int getc(int l,int r)
{
	vector<int> vb,vc;
	for(int i=1;i<l;i++) vb.pb(a[i]);
	for(int i=l;i<=r;i++) vc.pb(a[i]);
	for(int i=r+1;i<=2*n;i++) vb.pb(a[i]);
	sort(vc.begin(),vc.end());
	sort(vb.begin(),vb.end());
	
	ll mx=0;
	for(int i=1;i<=n;i++)
	{
		mx=max(mx,abs(b[i]-vb[i-1]));
	}
	
	for(int i=1;i<=n;i++)
	{
		mx=max(mx,abs(c[i]-vc[i-1]));
	}
	return mx;
}


bool check(int mid)
{
	for(int i=1;i<=n+1;i++)
	{
		int mx=0;
		mx=getb(i,i+n-1);
		if(mx<=mid) return true;
		mx=getc(i,i+n-1);
		if(mx<=mid) return true;
	}
	return false;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
//	freopen(".INP","r",stdin);
//	freopen(".OUT","w",stdout);
	cin>>n;
	for(int i=1;i<=n*2;i++)
	{
		cin>>a[i];
	}
	for(int i=1;i<=n;i++)
	{
		cin>>b[i];
	}
	for(int i=1;i<=n;i++)
	{
		cin>>c[i];
	}
	sort(b+1,b+1+n);
	sort(c+1,c+1+n);
	
	int l=0,r=1e9,res=0;
	while(l<=r)
	{
		int mid=(l+r)/2;
		if(check(mid))
		{
			res=mid;
			r=mid-1;
		}
		else l=mid+1;
	}
	cout<<res;
	return 0;
}

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4432 KB	Output is correct
2	Correct	1 ms	4432 KB	Output is correct
3	Correct	1 ms	4432 KB	Output is correct
4	Correct	1 ms	4432 KB	Output is correct
5	Correct	1 ms	4432 KB	Output is correct
6	Correct	1 ms	4432 KB	Output is correct
7	Correct	1 ms	4432 KB	Output is correct
8	Correct	1 ms	4432 KB	Output is correct
9	Correct	1 ms	4600 KB	Output is correct
10	Correct	1 ms	4432 KB	Output is correct
11	Correct	1 ms	4564 KB	Output is correct
12	Correct	1 ms	4432 KB	Output is correct

Subtask #2
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4432 KB	Output is correct
2	Correct	1 ms	4432 KB	Output is correct
3	Correct	1 ms	4432 KB	Output is correct
4	Correct	1 ms	4432 KB	Output is correct
5	Correct	1 ms	4432 KB	Output is correct
6	Correct	1 ms	4432 KB	Output is correct
7	Correct	1 ms	4432 KB	Output is correct
8	Correct	1 ms	4432 KB	Output is correct
9	Correct	1 ms	4600 KB	Output is correct
10	Correct	1 ms	4432 KB	Output is correct
11	Correct	1 ms	4564 KB	Output is correct
12	Correct	1 ms	4432 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4432 KB	Output is correct
15	Correct	1 ms	4432 KB	Output is correct
16	Correct	1 ms	4432 KB	Output is correct
17	Correct	2 ms	4432 KB	Output is correct
18	Correct	1 ms	4432 KB	Output is correct
19	Correct	1 ms	4432 KB	Output is correct
20	Correct	1 ms	4432 KB	Output is correct
21	Correct	1 ms	4432 KB	Output is correct
22	Correct	1 ms	4432 KB	Output is correct
23	Correct	2 ms	4432 KB	Output is correct
24	Correct	1 ms	4432 KB	Output is correct
25	Correct	2 ms	4432 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4432 KB	Output is correct
2	Correct	1 ms	4432 KB	Output is correct
3	Correct	1 ms	4432 KB	Output is correct
4	Correct	1 ms	4432 KB	Output is correct
5	Correct	1 ms	4432 KB	Output is correct
6	Correct	1 ms	4432 KB	Output is correct
7	Correct	1 ms	4432 KB	Output is correct
8	Correct	1 ms	4432 KB	Output is correct
9	Correct	1 ms	4600 KB	Output is correct
10	Correct	1 ms	4432 KB	Output is correct
11	Correct	1 ms	4564 KB	Output is correct
12	Correct	1 ms	4432 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4432 KB	Output is correct
15	Correct	1 ms	4432 KB	Output is correct
16	Correct	1 ms	4432 KB	Output is correct
17	Correct	2 ms	4432 KB	Output is correct
18	Correct	1 ms	4432 KB	Output is correct
19	Correct	1 ms	4432 KB	Output is correct
20	Correct	1 ms	4432 KB	Output is correct
21	Correct	1 ms	4432 KB	Output is correct
22	Correct	1 ms	4432 KB	Output is correct
23	Correct	2 ms	4432 KB	Output is correct
24	Correct	1 ms	4432 KB	Output is correct
25	Correct	2 ms	4432 KB	Output is correct
26	Correct	3955 ms	4688 KB	Output is correct
27	Correct	3838 ms	4660 KB	Output is correct
28	Correct	344 ms	4432 KB	Output is correct
29	Correct	3 ms	4432 KB	Output is correct
30	Execution timed out	5073 ms	4688 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

Subtask #4
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	5049 ms	29120 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4432 KB	Output is correct
2	Correct	1 ms	4432 KB	Output is correct
3	Correct	1 ms	4432 KB	Output is correct
4	Correct	1 ms	4432 KB	Output is correct
5	Correct	1 ms	4432 KB	Output is correct
6	Correct	1 ms	4432 KB	Output is correct
7	Correct	1 ms	4432 KB	Output is correct
8	Correct	1 ms	4432 KB	Output is correct
9	Correct	1 ms	4600 KB	Output is correct
10	Correct	1 ms	4432 KB	Output is correct
11	Correct	1 ms	4564 KB	Output is correct
12	Correct	1 ms	4432 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4432 KB	Output is correct
15	Correct	1 ms	4432 KB	Output is correct
16	Correct	1 ms	4432 KB	Output is correct
17	Correct	2 ms	4432 KB	Output is correct
18	Correct	1 ms	4432 KB	Output is correct
19	Correct	1 ms	4432 KB	Output is correct
20	Correct	1 ms	4432 KB	Output is correct
21	Correct	1 ms	4432 KB	Output is correct
22	Correct	1 ms	4432 KB	Output is correct
23	Correct	2 ms	4432 KB	Output is correct
24	Correct	1 ms	4432 KB	Output is correct
25	Correct	2 ms	4432 KB	Output is correct
26	Correct	3955 ms	4688 KB	Output is correct
27	Correct	3838 ms	4660 KB	Output is correct
28	Correct	344 ms	4432 KB	Output is correct
29	Correct	3 ms	4432 KB	Output is correct
30	Execution timed out	5073 ms	4688 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

Submission #1110233

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 5.0 / 5.0

Subtask #3 0 / 21.0

Subtask #4 0 / 37.0

Subtask #5 0 / 33.0

Subtask #1
4.0 / 4.0

Subtask #2
5.0 / 5.0

Subtask #3
0 / 21.0

Subtask #4
0 / 37.0

Subtask #5
0 / 33.0