RPLN - Negative Score
Orianna is a great swimmer and she's going to a swimming competition this month and needs your help as she is highly paranoic about the results of the competition.
The competition consists in some sort of evaluations, every judge makes a score and, based on that score and the score of other contestants she will get a score belonging to her results, those scores are final, meaning that will not change in the competition.
Orianna requires this solution with urgency, she is getting evaluated on a lot of ways and she is very worried about her results, so she wants to know what is the worst score from an evaluation A to other evaluation B inclusive.
Input
The first line of the test data will start with an integer T representing the T test cases, then, T cases will follow, each of the cases starts with two integers N and Q, denoting the number of evaluations Orianna had, then, N integers will follow denoting the score on each evaluation, after that, Q queries will begin, each query consist on two integers A and B.
Output
You must output the string “Scenario #i:“, a blank line and then the result of each query, remember, Orianna is interested on the worst score from evaluation A to evaluation B inclusive.
Example
Input: 2 5 3 1 2 3 4 5 1 5 1 3 2 4 5 3 1 -2 -4 3 -5 1 5 1 3 2 4 Output: Scenario #1: 1 1 2 Scenario #2: -5 -4 -4
Constraints
- 1 <= T <= 100
Small input (30%):
- 1 <= N <= 1,000
- 1 <= Q <= 1,000
- -10^9 <= Ni <= 10^9
- 1 <= A <= B <= N
Large input (70%):
- 1 <= N <= 100,000
- 1 <= Q <= 100,000
- -10^9 <= Ni <= 10^9
- 1 <= A <= B <= N
Solutions rejudged due to weak test cases.
hide comments
abdulazizms:
2022-08-31 22:51:58
Used sparse table and getting TLE in Java |
|
raman8421:
2021-06-27 09:15:58
Cakewalk :) but it gives TLE with segtree
|
|
leonardovn2525:
2021-03-03 05:01:20
Just AC with segment tree, there is probably something wrong with @subbu988 's code. Last edit: 2021-03-24 14:24:30 |
|
subbu988:
2021-01-20 07:34:44
After new test cases added, SegTree no longer passes? I tried with O(N,logN) approach |
|
sowmiksarker:
2020-11-05 16:29:03
ac in one go! ->sparse table |
|
ankitsingh123:
2020-06-02 09:24:46
Really @kessi_5424 the scenario part messed. |
|
jony:
2020-02-03 08:47:50
Getting TLE with java, used segment tree. any idea why?
|
|
transonviet:
2019-12-23 06:08:42
AC in one go |
|
madris28:
2019-07-18 19:07:47
easy as taking candy from a baby |
|
nishit5:
2019-07-06 07:48:30
sparse table worked for me!!
|
Added by: | david_8k |
Date: | 2012-06-22 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own Problem used for the RPL contest |