Don’t think so. He already denied idraumr and I think someone else as well.
So, I scored 100. How much did you score?
If anyone finds a discrepancy in their score, please tell here too. That would imply a re-evaluation of the cutoff.
2 Likes
well, unfortunately im getting 60, not the claimed 100. it appears my code trying to access out of bounds elements in subtask4, anddue to just that, ill be unable to make it to TC this year, unless of curse cutoff falls to 60… 
the worst day of my life…
110 
Got exactly what I expected!
@nibnalin, no issues, brother. You’ve got more years to try again. The cut-off is likely to be 100, unless a re-evaluation happens for several, in which case it will likely increase.
@ketanhwr, yayy! We’ll meet at IOITC!
I couldn’t score that 30 marks because I forgot the case where a[i] and a[i + 1] would be maximum, for a [i, i + 1] sequence. sigh
Well, I wasn’t right, I was talking about the announcement, not the final result. Technically the announcement came today. (announcement of your score)
I ended up getting 100 as well -.-
Oh, elaborate? What did you do wrong?
Ah, I meant the announcement of the final list.
Wait a few minutes while I confirm what I know is the only mistake
I got 130 instead of 200 because of a stupid initialization mistake. Thank god everyone made equally stupid mistakes 
Yeah haha.
Initially I had:
int curmin = a[1];
int cur = a[1];
This wasn’t working out so I changed a[1] to -a[1] + b[1] but forgot to change curmin -_-
One or two cases in each subtask are wrong because of this
int curmin = a[1];
int cur = -a[1] + b[1];
Ouch. I hope someday this happens with an online judge, or maybe an offline one with all the test cases with output hashed and present there.
The cutoff better be 100
I think the cutoff is, as of now, 100. It would change if a sufficient number of people ask for re-evaluation of their programs, and they then score greater than 100 (and previously they scored < 100).
I had ll curmax = ans; changing it to ll curmax = A[n - 1]; got me 100
My score is 110 .
It was 75 on the grader.
The time limit is 8 seconds for JAVA and my code works within that time , (7.5 seconds) in the worst case N=150000 , but it gives some weird Wall Clock Time Limit Exceeded error instead of Execution Timed out . They said they checked my algorithm and its OK so my score is 110. Hopefully cut-off won’t increase!
I think the wall clock thing means you took more time on I/O.
At least, that’s what it means on wcipeg