Equal Sums

Posted 行远山

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Equal Sums相关的知识,希望对你有一定的参考价值。

You are given kk sequences of integers. The length of the ii-th sequence equals to nini.

You have to choose exactly two sequences ii and jj (iji≠j) such that you can remove exactly one element in each of them in such a way that the sum of the changed sequence ii (its length will be equal to ni?1ni?1) equals to the sum of the changed sequence jj (its length will be equal to nj?1nj?1).

Note that it‘s required to remove exactly one element in each of the two chosen sequences.

Assume that the sum of the empty (of the length equals 00) sequence is 00.

Input

The first line contains an integer kk (2k2?1052≤k≤2?105) — the number of sequences.

Then kk pairs of lines follow, each pair containing a sequence.

The first line in the ii-th pair contains one integer nini (1ni<2?1051≤ni<2?105) — the length of the ii-th sequence. The second line of the ii-th pair contains a sequence of nini integers ai,1,ai,2,,ai,niai,1,ai,2,…,ai,ni.

The elements of sequences are integer numbers from ?104?104 to 104104.

The sum of lengths of all given sequences don‘t exceed 2?1052?105, i.e. n1+n2+?+nk2?105n1+n2+?+nk≤2?105.

Output

If it is impossible to choose two sequences such that they satisfy given conditions, print "NO" (without quotes). Otherwise in the first line print "YES" (without quotes), in the second line — two integers ii, xx (1ik,1xni1≤i≤k,1≤x≤ni), in the third line — two integers jj, yy (1jk,1ynj1≤j≤k,1≤y≤nj). It means that the sum of the elements of the ii-th sequence without the element with index xx equals to the sum of the elements of the jj-th sequence without the element with index yy.

Two chosen sequences must be distinct, i.e. iji≠j. You can print them in any order.

If there are multiple possible answers, print any of them.

Examples
input
Copy
2
5
2 3 1 3 2
6
1 1 2 2 2 1
output
Copy
YES
2 6
1 2
input
Copy
3
1
5
5
1 1 1 1 1
2
2 3
output
Copy
NO
input
Copy
4
6
2 2 2 2 2 2
5
2 2 2 2 2
3
2 2 2
5
2 2 2 2 2
output
Copy
YES
2 2
4 1
Note

In the first example there are two sequences [2,3,1,3,2][2,3,1,3,2] and [1,1,2,2,2,1][1,1,2,2,2,1]. You can remove the second element from the first sequence to get [2,1,3,2][2,1,3,2] and you can remove the sixth element from the second sequence to get [1,1,2,2,2][1,1,2,2,2]. The sums of the both resulting sequences equal to 88, i.e. the sums are equal.

 

学习了一发map和pair的用法。

由于我们是要求 sum[i1]-a[i1][j1]=sum[i2]-a[i2][j2]。

可以用map来保存每个sum[i1]-a[i1][j1].然后用pair记录i,j。

#include <bits/stdc++.h>
#define maxn 200005
using namespace std;
typedef long long ll;
map < int,pair<int,int> > mp;
int main()
{
   int n,i,j,m;
   scanf("%d",&n);
   for(i=1;i<=n;i++)
   {
       int sum=0;
       int a[maxn]={0};
       scanf("%d",&m);
       for(j=1;j<=m;j++)
       {
           scanf("%d",&a[j]);
           sum+=a[j];
       }
       for(j=1;j<=m;j++)
       {
           if(mp.count(sum-a[j]))
           {
               printf("YES\n");
               printf("%d %d\n",i,j);
               printf("%d %d\n",mp[sum-a[j]].first,mp[sum-a[j]].second);
               return 0;
           }
       }
       for(j=1;j<=m;j++)
       {
           mp[sum-a[j]]=make_pair(i,j);
       }
   }
   printf("NO\n");
    return 0;
}

  

以上是关于Equal Sums的主要内容,如果未能解决你的问题,请参考以下文章

Codeforces Round #486 (Div. 3) C. Equal Sums

CF988 C. Equal Sums

leetcode_1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold_[二维前缀和](代码片段

如何在 python 中并行化以下代码片段?

Python代码阅读(第13篇):检测列表中的元素是否都一样

POJ3187 Backward Digit Sums