bitset高速化を履修 提出 #72398418 - トヨタ自動車プログラミングコンテスト2024#4（AtCoder Beginner Contest 348）

for our example: the interface keyword spans 9 symbol locations 0...8 so the tail 'e' is at position 8 we correlate this with the gram index [1] by finding the rank of 8th bit in the gram_tails bitset (Note: gram_lane indexes are 1-based, symbol coordinates are 0-based)

FPS(形式的冪級数のほう)、bitsetに似てる気がする

@Adriksh std::bit_cast, std::bitset<32> and std::bit_set<64> make bit manipulation easy but take away the fun of LARPing as a C dev.

@chris_thirst @pfiffkas @haraldlaatsch Bitset und Schrauber müssen getrennt voneinander in zugelassenen Waffenschränken gelagert werden.

https://t.co/66BUb4qmal 解説AC これbitset高速化なのか　マジで見えない 10^9回実行しそうで処理がbit演算で表せそうなら疑えるようになりたいな

@second_raon @Harunene 실제로 std::bitset 이 따로 있습니다 ㅋㅋ

@SanderSassen Ja zo’n bitset heb ik nog wel, verder kom ik niet. Wordt een nieuwe denk ik.

things we normalized & didn't specifically 'pay for' in data modelling like the day of the week, we can derive naturally from the bitset since day of week is cyclical (Friday always after Thurs) rare 'win-win' model less, simplify fast queries i.e. what are 'weekend' movies?