| Title |
User |
Message |
Date Posted |
| Re: Hints? |
bobhob314 |
Python hashtable: Use integers as the keys. For each i & -i update, first check if the idx is in your dict; then update if it is. |
May 18, 2015 - 3:46:07 pm UTC |
| Re: Hints? |
jungernaut165 |
Hi there, I understand the point for a hashtable. I just don't know how to apply a BIT to a hashtable. |
Apr 26, 2015 - 9:21:51 pm UTC |
| Re: Hints? |
jargon |
I think you're misunderstanding the point of the hashtable. Reread the above comments. In any case, I wonder whether this is getting to be too much discussion about the answer... people looking for c... |
Apr 26, 2015 - 7:47:13 pm UTC |
| Re: Hints? |
jungernaut165 |
Ohh wow cool! Congrats! Excuse my elementary understanding, but with a BIT you update at every incremented i & -i position. If you used a hashtable, you might not have keys when you compute the inc... |
Apr 26, 2015 - 7:29:17 pm UTC |
| Re: Hints? |
awaykened |
I passed with BIT + compression |
Apr 26, 2015 - 1:43:51 pm UTC |
| Re: Hints? |
jungernaut165 |
Thank you much! So I am assuming you didn't use a binary indexed tree for this problem? |
Apr 26, 2015 - 4:43:30 am UTC |
| Re: Hints? |
awaykened |
like fifiman said, if you have friends with IDs 1,6,8,10 you don't need to keep an array of 1 to 10, you only need an array of 1-4, and a map that looks something like {1:0,6:2,8:3,10:4}. That way whe... |
Apr 25, 2015 - 11:44:28 pm UTC |
| Re: Hints? |
fifiman |
You dont have to consider all the 10^8 possible ratings, just the ones that your friends will be using |
Apr 25, 2015 - 2:14:36 am UTC |
| Re: Hints? |
jungernaut165 |
Hi Awaykened, Thanks for your input. I'm fairly new. Can you elaborate a little further of what you mean by compression, maps? Thank you! |
Apr 25, 2015 - 1:00:43 am UTC |
| Re: Hints? |
awaykened |
You can use compression! :D (maps and stuff) |
Apr 24, 2015 - 5:01:23 pm UTC |
