제출 #1266993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266993		thelegendary08	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++17	30 / 100	5088 ms	18660 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	vin(v, 2*n);
	vin(a, n); 
	vin(b, n);
	sort(all(a)); sort(all(b)); 
	int ans = 4e18; 
	f0r(i, n+1){
		vi x, y; 
		f0r(j,i)x.pb(v[j]);
		FOR(j,i,i+n)y.pb(v[j]);
		FOR(j,i+n,2*n)x.pb(v[j]);
		sort(all(x)); sort(all(y)); 
		int cur = 0; 
		f0r(i,n)cur = max(cur, abs(x[i] - a[i]));
		f0r(i,n)cur = max(cur, abs(y[i] - b[i]));
		ans = min(ans, cur);
		cur = 0; 
		f0r(i,n)cur = max(cur, abs(x[i] - b[i]));
		f0r(i,n)cur = max(cur, abs(y[i] - a[i]));
		ans = min(ans, cur);
	}
	out(ans);
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 21 / 21
• Subtask 4: 0 / 37
• Subtask 5: 0 / 33