Points: 5 (partial)
Time limit: 2.5s
Memory limit: 256M
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.
- 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 .
For each query, print the total mass of the trees at position such that .
- For 30% of the points, .
- For 50% of the points, .
- For the rest, .
5 1 2 3 4 5 3 0 4 1 3 2 2
15 9 3
with Python3 if u tle on the last 2 try using fast input
I got a TLE, not sure how to fix it, can anyone help me, thanx XD
This problem requires prefix sum arrays to handle queries in constant time.
Thanks so much
cin/cout might be too slow to pass. Try one of the tips!
How come when I use fast I/O in my IDE it works but when I submit it TLE
You are a saint
Is this question doable in Turing with the current time limit?
The OpenTuring we use includes some benchmarks against Python in its README, which might be of help.
Give PYPY a try. (Why must I rhyme?)
This comment is hidden due to too much negative feedback. Show it anyway.