Equal Sums (map的基本應用) 多學騷操作
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 (i≠ji≠j) such that you can remove exactly one element in each of them in such a way that the sum of the changed sequence
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.
InputThe first line contains an integer
Then kk pairs of lines follow, each pair containing a sequence.
The first line in the ii-th pair contains one integer nini (1≤ni<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
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+?+nk≤2?105n1+n2+?+nk≤2?105.
OutputIf 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 (1≤i≤k,1≤x≤ni1≤i≤k,1≤x≤ni), in the third line — two integers jj, yy (1≤j≤k,1≤y≤nj1≤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. i≠ji≠j. You can print them in any order.
If there are multiple possible answers, print any of them.
Examples input2output
5
2 3 1 3 2
6
1 1 2 2 2 1
YESinput
2 6
1 2
3output
1
5
5
1 1 1 1 1
2
2 3
NOinput
4output
6
2 2 2 2 2 2
5
2 2 2 2 2
3
2 2 2
5
2 2 2 2 2
YESNote
2 2
4 1
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.
1 #include <bits/stdc++.h> 2 using namespace std; 3 const int maxn = 2e5 + 10; 4 struct node { 5 int x, y; 6 node(int x, int y): x(x), y(y) {} 7 node () {} 8 bool operator < (node const &a ) const { 9 return a.x < x; 10 } 11 }; 12 map<int,node>mp; 13 int t, n, a[maxn]; 14 int main() { 15 scanf("%d", &t); 16 int flag = 0; 17 for (int k = 1 ; k <= t ; k++) { 18 scanf("%d", &n); 19 int sum = 0; 20 for (int i = 0 ; i < n ; i++ ) { 21 scanf("%d", &a[i]); 22 sum += a[i]; 23 } 24 if (flag) continue; 25 for (int i = 0 ; i < n ; i++) { 26 int temp = sum - a[i]; 27 if (mp.find(temp) != mp.end()) { 28 if (mp[temp].x != k) { 29 printf("YES\n"); 30 printf("%d %d\n", k, i+1); 31 printf("%d %d\n", mp[temp].x, mp[temp].y+1); 32 flag = 1; 33 } 34 } 35 if (flag) break; 36 mp[temp] = node(k, i); 37 } 38 } 39 if (!flag) printf("NO\n"); 40 return 0; 41 }
Equal Sums (map的基本應用) 多學騷操作