codeforces 620D D. Professor GukiZ and Two Arrays
Professor GukiZ has two arrays of integers, a and b. Professor wants to make the sum of the elements in the array a sa as close as possible to the sum of the elements in the array b sb. So he wants to minimize the value v = |sa - sb|.
In one operation professor can swap some element from the array a and some element from the array b. For example if the array a is[5, 1, 3, 2, 4] and the array b is [3, 3, 2] professor can swap the element 5 from the array a and the element 2 from the array b and get the new array a [2, 1, 3, 2, 4] and the new array b [3, 3, 5].
Professor doesn't want to make more than two swaps. Find the minimal value v and some sequence of no more than two swaps that will lead to the such value v. Professor makes swaps one by one, each new swap he makes with the new arrays a and b.
Input
The first line contains integer n (1 ≤ n ≤ 2000) — the number of elements in the array a.
The second line contains n integers ai ( - 109 ≤ ai ≤ 109) — the elements of the array a.
The third line contains integer m (1 ≤ m ≤ 2000) — the number of elements in the array b.
The fourth line contains m integers bj ( - 109 ≤ bj ≤ 109) — the elements of the array b.
Output
In the first line print the minimal value v = |sa - sb| that can be got with no more than two swaps.
The second line should contain the number of swaps k (0 ≤ k ≤ 2).
Each of the next k lines should contain two integers xp, yp (1 ≤ xp ≤ n, 1 ≤ yp ≤ m) — the index of the element in the array a and the index of the element in the array b in the p-th swap.
If there are several optimal solutions print any of them. Print the swaps in order the professor did them.
Sample test(s)
input
5
5 4 3 2 1
4
1 1 1 1
output
1
2
1 1
4 2
input
5
1 2 3 4 5
1
15
output
0
0
input
5
1 2 3 4 5
4
1 2 3 4
output
1
1
3 1
#include<cstdio>
#include<cstring>
#include<map>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
map<ll,pair<int,int> >f;
int a[2][2005];
ll sum[2];
pair<int,int>ans[2];
int main()
{
int n,m;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[0][i]),sum[0]+=a[0][i];
scanf("%d",&m);
for(int i=0;i<m;i++)
scanf("%d",&a[1][i]),sum[1]+=a[1][i];
if(sum[0]==sum[1]){puts("0
0");return 0;}
ll bound=abs(sum[0]-sum[1]);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
ll tt=abs(sum[0]-2*(ll)a[0][i]+2*(ll)a[1][j]-sum[1]);
if(tt<bound)ans[0].first=i+1,ans[0].second=j+1,bound=tt;
}
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
f[2*(ll)a[0][i]+2*(ll)a[0][j]]=make_pair(i+1,j+1);
for(int i=0;i<m;i++)
for(int j=i+1;j<m;j++)
{
ll tt=sum[0]-sum[1]+2*((ll)a[1][i]+(ll)(a[1][j]));
map<ll,pair<int,int> >::iterator iter=f.lower_bound(tt);
if((iter!=f.end()&&(abs(tt-iter->first)<bound))||(iter!=f.begin()&&(tt-(--iter)->first)<bound))
{
ans[0]=make_pair(iter->second.first,i+1);
ans[1]=make_pair(iter->second.second,j+1);
bound=abs(iter->first-tt);
}
}
printf("%I64d
",bound);
if(bound==sum[0]-sum[1]){puts("0");return 0;}
if(!ans[1].first)cout<<"1
"<<ans[0].first<<" "<<ans[0].second<<endl;
else cout<<"2
"<<ans[0].first<<" "<<ans[0].second<<endl<<ans[1].first<<" "<<ans[1].second<<endl;
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
다양한 언어의 JSONJSON은 Javascript 표기법을 사용하여 데이터 구조를 레이아웃하는 데이터 형식입니다. 그러나 Javascript가 코드에서 이러한 구조를 나타낼 수 있는 유일한 언어는 아닙니다. 저는 일반적으로 '객체'{}...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.