답안 #1110238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1110238 2024-11-09T03:08:25 Z vjudge1 Growing Vegetables is Fun 5 (JOI24_vegetables5) C++17
9 / 100
5000 ms 13504 KB
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
int n,a[600005],b[600005],c[600005];

int get(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());
	
	int mx1=0,mx2=0;
	for(int i=1;i<=n;i++)
	{
		mx1=max(mx1,abs(b[i]-vb[i-1]));
	}
	
	for(int i=1;i<=n;i++)
	{
		mx1=max(mx1,abs(c[i]-vc[i-1]));
	}
	
	for(int i=1;i<=n;i++)
	{
		mx2=max(mx2,abs(c[i]-vb[i-1]));
	}
	
	for(int i=1;i<=n;i++)
	{
		mx2=max(mx2,abs(b[i]-vc[i-1]));
	}
	
	return min(mx2,mx1);
}



bool check(int mid)
{
	for(int i=1;i<=n+1;i++)
	{
		int mx=0;
		mx=get(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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4568 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4568 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 2 ms 4432 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4508 KB Output is correct
16 Correct 1 ms 4600 KB Output is correct
17 Correct 1 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 2 ms 4432 KB Output is correct
21 Correct 2 ms 4432 KB Output is correct
22 Correct 1 ms 4600 KB Output is correct
23 Correct 1 ms 4432 KB Output is correct
24 Correct 2 ms 4432 KB Output is correct
25 Correct 2 ms 4432 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4568 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 2 ms 4432 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4508 KB Output is correct
16 Correct 1 ms 4600 KB Output is correct
17 Correct 1 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 2 ms 4432 KB Output is correct
21 Correct 2 ms 4432 KB Output is correct
22 Correct 1 ms 4600 KB Output is correct
23 Correct 1 ms 4432 KB Output is correct
24 Correct 2 ms 4432 KB Output is correct
25 Correct 2 ms 4432 KB Output is correct
26 Correct 2214 ms 4596 KB Output is correct
27 Correct 2166 ms 4596 KB Output is correct
28 Correct 209 ms 4432 KB Output is correct
29 Correct 2 ms 4432 KB Output is correct
30 Correct 3168 ms 4604 KB Output is correct
31 Correct 893 ms 4644 KB Output is correct
32 Correct 139 ms 4596 KB Output is correct
33 Correct 44 ms 4432 KB Output is correct
34 Execution timed out 5063 ms 4432 KB Time limit exceeded
35 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5052 ms 13504 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4568 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 1 ms 4600 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 2 ms 4432 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4508 KB Output is correct
16 Correct 1 ms 4600 KB Output is correct
17 Correct 1 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 2 ms 4432 KB Output is correct
21 Correct 2 ms 4432 KB Output is correct
22 Correct 1 ms 4600 KB Output is correct
23 Correct 1 ms 4432 KB Output is correct
24 Correct 2 ms 4432 KB Output is correct
25 Correct 2 ms 4432 KB Output is correct
26 Correct 2214 ms 4596 KB Output is correct
27 Correct 2166 ms 4596 KB Output is correct
28 Correct 209 ms 4432 KB Output is correct
29 Correct 2 ms 4432 KB Output is correct
30 Correct 3168 ms 4604 KB Output is correct
31 Correct 893 ms 4644 KB Output is correct
32 Correct 139 ms 4596 KB Output is correct
33 Correct 44 ms 4432 KB Output is correct
34 Execution timed out 5063 ms 4432 KB Time limit exceeded
35 Halted 0 ms 0 KB -