Submit | All submissions | Best solutions | Back to list |
UPDATEIT - Update the array ! |
You have an array containing n elements initially all 0. You need to do a number of update operations on it. In each update you specify l, r and val which are the starting index, ending index and value to be added. After each update, you add the 'val' to all elements from index l to r. After 'u' updates are over, there will be q queries each containing an index for which you have to print the element at that index.
Input
First line consists of t, the number of test cases. (1 ≤ t ≤ 10)
Each test case consists of "n u", number of elements in the array and the number of update operations, in the first line (1 ≤ n ≤ 10000 and 1 ≤ u ≤ 100000)
Then follow u lines each of the format "l r val" (0 ≤ l, r < n, 0 ≤ val ≤ 10000)
Next line contains q, the number of queries. (1 ≤ q ≤ 10000)
Next q lines contain an index (0 ≤ index < n)
Output
For each test case, output the answers to the corresponding queries in separate lines.
Example
Input: 1
5 3
0 1 7
2 4 6
1 3 2
3
0
3
4
Output:
7
8
6
Added by: | Pandian |
Date: | 2013-10-15 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own |
hide comments
|
||||||||||||||
2016-06-18 19:54:22
Learnt something new !!! |
||||||||||||||
2016-05-27 13:10:04 KD
learned something new :P |
||||||||||||||
2016-05-18 17:29:12
TLE when using Segmented Tree + lazy propagation ! AC -> O(n) ...Prefix sum |
||||||||||||||
2016-02-27 13:44:14 hashem sllat
TLE with segment tree + lazy propogation |
||||||||||||||
2016-02-19 09:38:19
Small tip: Use fast I/O guys. |
||||||||||||||
2016-01-17 04:39:31 minhthai
java + O(n) and still TLE :( Anyway, learned something new, sweet! |
||||||||||||||
2015-12-20 19:12:16 SUBHAJIT GORAI
simple O(n) solution ...no need of segment tree ....notice =>no query in between the updates ... |
||||||||||||||
2015-11-01 20:56:04 Lai Manh Tuan
got AC with fast IO + segment tree (lazy propagation) Last edit: 2015-11-01 20:56:22 |
||||||||||||||
2015-10-19 18:32:51 Abhinandan Agarwal
BIT->0.10s O(n)->0.02s |
||||||||||||||
2015-09-14 07:09:02 Dhiresh
Using prinf scanf instead of cin cout saved me from TLE. PS: used BIT |