codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

988C.md (2674B)


      1 Source: https://codeforces.com/problemset/problem/988/C
      2 
      3 C. Equal Sums
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given $k$ sequences of integers. The length of the $i$-th sequence equals to $n_i$.
     22 
     23 You have to choose exactly two sequences $i$ and $j$ ($i \ne j$) such that you can remove exactly one element in each of them in such a way that the sum of the changed sequence $i$ (its length will be equal to $n_i - 1$) equals to the sum of the changed sequence $j$ (its length will be equal to $n_j - 1$).
     24 
     25 Note that it's required to remove exactly one element in each of the two chosen sequences.
     26 
     27 Assume that the sum of the empty (of the length equals $0$) sequence is $0$.
     28 
     29 Input
     30 
     31 The first line contains an integer $k$ ($2 \le k \le 2 \cdot 10^5$) — the number of sequences.
     32 
     33 Then $k$ pairs of lines follow, each pair containing a sequence.
     34 
     35 The first line in the $i$-th pair contains one integer $n_i$ ($1 \le n_i \lt 2 \cdot 10^5$) — the length of the $i$-th sequence. The second line of the $i$-th pair contains a sequence of $n_i$ integers $a_{i, 1}, a_{i, 2}, \dots, a_{i, n_i}$.
     36 
     37 The elements of sequences are integer numbers from $-10^4$ to $10^4$.
     38 
     39 The sum of lengths of all given sequences don't exceed $2 \cdot 10^5$, i.e. $n_1 + n_2 + \dots + n_k \le 2 \cdot 10^5$.
     40 
     41 Output
     42 
     43 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 $i$, $x$ ($1 \le i \le k, 1 \le x \le n_i$), in the third line — two integers $j$, $y$ ($1 \le j \le k, 1 \le y \le n_j$). It means that the sum of the elements of the $i$-th sequence without the element with index $x$ equals to the sum of the elements of the $j$-th sequence without the element with index $y$.
     44 
     45 Two chosen sequences must be distinct, i.e. $i \ne j$. You can print them in any order.
     46 
     47 If there are multiple possible answers, print any of them.
     48 
     49 Examples
     50 
     51 Input
     52 
     53 ```
     54 2  
     55 5  
     56 2 3 1 3 2  
     57 6  
     58 1 1 2 2 2 1
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 YES  
     65 2 6  
     66 1 2
     67 ```
     68 
     69 Input
     70 
     71 ```
     72 3  
     73 1  
     74 5  
     75 5  
     76 1 1 1 1 1  
     77 2  
     78 2 3
     79 ```
     80 
     81 Output
     82 
     83 ```
     84 NO
     85 ```
     86 
     87 Input
     88 
     89 ```
     90 4  
     91 6  
     92 2 2 2 2 2 2  
     93 5  
     94 2 2 2 2 2  
     95 3  
     96 2 2 2  
     97 5  
     98 2 2 2 2 2
     99 ```
    100 
    101 Output
    102 
    103 ```
    104 YES  
    105 2 2  
    106 4 1
    107 ```
    108 
    109 Note
    110 
    111 In the first example there are two sequences $[2, 3, 1, 3, 2]$ and $[1, 1, 2, 2, 2, 1]$. You can remove the second element from the first sequence to get $[2, 1, 3, 2]$ and you can remove the sixth element from the second sequence to get $[1, 1, 2, 2, 2]$. The sums of the both resulting sequences equal to $8$, i.e. the sums are equal.