codeforces 620D D. Professor GukiZ and Two Arrays
2016-01-28 15:14
381 查看
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\n0");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\n",bound); if(bound==sum[0]-sum[1]){puts("0");return 0;} if(!ans[1].first)cout<<"1\n"<<ans[0].first<<" "<<ans[0].second<<endl; else cout<<"2\n"<<ans[0].first<<" "<<ans[0].second<<endl<<ans[1].first<<" "<<ans[1].second<<endl; return 0; }
相关文章推荐
- Newtonsoft.Json高级用法之枚举中文转义
- 前端——px,em,rem区别
- HTML5:表格
- CSS3下的147个颜色名称及对应颜色值
- jQuery对象和DOM对象互转
- JQuery取消和注册对象Click事件同时防止多播委托
- JS乘法口诀表(一行代码)
- js023-离线应用与客户端存储
- css3伪元素
- js调绝对定位的top
- 用 JavaScript 操作字符串
- Doc13(样式浮动及文本框空就变色)
- Chorme Error 312 (net::ERR_UNSAFE_PORT) | Chorme 不信任端口
- js 事件监听 冒泡事件
- windows下无GPU的caffe的配置
- Javascript学习笔记(一) -- 基础语法
- 原生 drag drop HTML5
- cross-document message 跨文档通信 HTML5
- jQuery获取checkbox选中的值
- 在jsp中如何引入css的三种方法