## DMOPC '14 Contest 2 P4 - Deforestation

View as PDF

Points: 5 (partial)
Time limit: 2.5s
Memory limit: 256M

Authors:
Problem type

The Logging Company has a long line of trees numbered from to . Each tree has a mass . The Company wants to cut some of the trees, so they hired you to calculate the mass of all the wood they would get from cutting all the trees between positions and inclusive . In particular, they want you to answer such queries.

#### Input Specification

• First line: .
• Lines to : line is the mass of tree , .
• The line will contain the integer , the number of queries the logging company wants answered.
• The next lines will contain the integers and .

#### Output Specification

For each query, print the total mass of the trees at position such that .

#### Scoring

• For 30% of the points, .
• For 50% of the points, .
• For the rest, .

#### Sample Input

5
1
2
3
4
5
3
0 4
1 3
2 2

#### Sample Output

15
9
3

• commented on Nov. 30, 2019, 10:46 p.m. edited

with Python3 if u tle on the last 2 try using fast input

https://dmoj.ca/tips/#python-in

• commented on Sept. 23, 2019, 2:54 a.m.

I got a TLE, not sure how to fix it, can anyone help me, thanx XD

• commented on Sept. 23, 2019, 12:13 p.m.

This problem requires prefix sum arrays to handle queries in constant time.

• commented on Sept. 25, 2019, 11:11 p.m.

Thanks so much

• commented on Oct. 10, 2015, 3:50 a.m.

cin/cout might be too slow to pass. Try one of the tips!

• commented on Jan. 12, 2020, 1:45 a.m.

How come when I use fast I/O in my IDE it works but when I submit it TLE

• commented on Sept. 14, 2019, 5:11 p.m.

You are a saint

• commented on May 14, 2016, 9:13 p.m.

Is this question doable in Turing with the current time limit?

• commented on May 14, 2016, 9:23 p.m. edited

The OpenTuring we use includes some benchmarks against Python in its README, which might be of help.

Conclusion

Python is faster than Turing.

• commented on Nov. 19, 2014, 4:22 a.m.

Give PYPY a try. (Why must I rhyme?)

• commented on Nov. 20, 2014, 5:30 p.m.

This comment is hidden due to too much negative feedback. Show it anyway.