| Title |
User |
Message |
Date Posted |
| ... |
Cassian_g |
WTF i got WA on subtasks 5 and 6. Then I added this to the code: if (pos[i] < 1 || pos[i] > n) { cout |
Jul 16, 2016 - 1:51:45 pm UTC |
| Re: Speeding up exponentiation |
spencereir |
Amazingly, it was a silly logic error that caused the program to never terminate under certain cases. Thank you for your help, though! |
Mar 28, 2016 - 11:47:25 pm UTC |
| Re: Speeding up exponentiation |
pyrexshorts |
You are probably using mod too many times, as I see lots of unnecessary mods in your code. Also make sure you are using fast exponentiation in log k time. |
Mar 28, 2016 - 10:38:59 pm UTC |
| Speeding up exponentiation |
spencereir |
Does anyone have any hints for speeding up exponentiation modulo a number, or my program's execution in general? I'm achieving a bound of O(n log n), but subtasks 9 and 10 are still giving TLE... |
Mar 27, 2016 - 11:57:54 pm UTC |
| Re: Subtask 1,2,3 |
FatalEagle |
"Test data being weak" is a known issue in IOI 2014 :). |
Jul 20, 2015 - 10:56:51 pm UTC |
| Subtask 1,2,3 |
bahosain889 |
My solution got AC thought it is wrong ... try this 1 4 1 7 4 9 ans is 0 |
Jul 20, 2015 - 10:32:18 pm UTC |
| Wrong test data |
AlanM |
I downloaded test data and my output is same as expected output, but this judge is showing that i am writing bad number at begin. |
Jun 07, 2015 - 7:48:17 pm UTC |
| Re: (Subtask 4, 5, 6)'s Special Judge is doubtful... |
dopa0509 |
thank you :) |
Aug 19, 2014 - 10:59:48 am UTC |
| Re: (Subtask 4, 5, 6)'s Special Judge is doubtful... |
Alex |
The checker for the subtasks should be working properly now. I have rejudged all the WA's. Note: The length of your replacement sequences should not exceed 250000, or they will be graded as WA. |
Aug 19, 2014 - 4:45:54 am UTC |
| Re: (Subtask 4, 5, 6)'s Special Judge is doubtful... |
dopa0509 |
I've tested in other 2 judges and got AC :) |
Aug 18, 2014 - 8:24:34 am UTC |
