codeforces-scrape

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

777C.md (2406B)


      1 Source: https://codeforces.com/problemset/problem/777/C
      2 
      3 C. Alyona and Spreadsheet
      4 
      5 time limit per test
      6 
      7 1 second
      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 During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.
     22 
     23 Now she has a table filled with integers. The table consists of *n* rows and *m* columns. By *a**i*, *j* we will denote the integer located at the *i*-th row and the *j*-th column. We say that the table is sorted in non-decreasing order in the column *j* if *a**i*, *j* ≤ *a**i* + 1, *j* for all *i* from 1 to *n* - 1.
     24 
     25 Teacher gave Alyona *k* tasks. For each of the tasks two integers *l* and *r* are given and Alyona has to answer the following question: if one keeps the rows from *l* to *r* inclusive and deletes all others, will the table be sorted in non-decreasing order in at least one column? Formally, does there exist such *j* that *a**i*, *j* ≤ *a**i* + 1, *j* for all *i* from *l* to *r* - 1 inclusive.
     26 
     27 Alyona is too small to deal with this task and asks you to help!
     28 
     29 Input
     30 
     31 The first line of the input contains two positive integers *n* and *m* (1 ≤ *n*·*m* ≤ 100 000) — the number of rows and the number of columns in the table respectively. Note that your are given a constraint that bound the product of these two integers, i.e. the number of elements in the table.
     32 
     33 Each of the following *n* lines contains *m* integers. The *j*-th integers in the *i* of these lines stands for *a**i*, *j* (1 ≤ *a**i*, *j* ≤ 109).
     34 
     35 The next line of the input contains an integer *k* (1 ≤ *k* ≤ 100 000) — the number of task that teacher gave to Alyona.
     36 
     37 The *i*-th of the next *k* lines contains two integers *l**i* and *r**i* (1 ≤ *l**i* ≤ *r**i* ≤ *n*).
     38 
     39 Output
     40 
     41 Print "Yes" to the *i*-th line of the output if the table consisting of rows from *l**i* to *r**i* inclusive is sorted in non-decreasing order in at least one column. Otherwise, print "No".
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 5 4  
     49 1 2 3 5  
     50 3 1 3 2  
     51 4 5 2 3  
     52 5 5 3 2  
     53 4 4 3 4  
     54 6  
     55 1 1  
     56 2 5  
     57 4 5  
     58 3 5  
     59 1 3  
     60 1 5
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 Yes  
     67 No  
     68 Yes  
     69 Yes  
     70 Yes  
     71 No
     72 ```
     73 
     74 Note
     75 
     76 In the sample, the whole table is not sorted in any column. However, rows 1–3 are sorted in column 1, while rows 4–5 are sorted in column 3.