[CF 703D]Mishka and Interesting sum
Description 给出n个数，m次询问，每次询问区间[l,r]中出现次数为偶数的数的异或和。 n,m<=10^6，全部数字<=10^9web Solution 颇有必要说明一下，这道题的时限是3.5s 因此说NlogN是能过的，(⊙v⊙)嗯 而后还能怎么打？ 若是出现次数是奇数，直接求区间异或和就行了。 若是是偶数？那就异或上区间全部出现过的数的异或和就行了。 不喜欢hash，用map搞一波
相关文章
- 1. CF747F Igor and Interesting Numbers
- 2. CF Amr and Pins (数学)
- 3. Telcoin and dent make mobile networks interesting and profitable
- 4. CF-weekly4 F. Kyoya and Colored Balls
- 5. CF#637 D. Nastya and Scoreboard DP
- 6. Jamie and Interesting Graph CodeForces #916C[题解]
- 7. CF 1372F Omkar and Modes
- 8. CF 852E Casinos and travel
- 9. CF 1477A. Nezzar and Board
- 10. CF 1372C Omkar and Baseball
- 更多相关文章...
- • SQL SUM() 函数 - SQL 教程
- • W3C RDF and OWL 活动 - W3C 教程
- • RxJava操作符（七）Conditional and Boolean
- • Java 8 Stream 教程
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. CF747F Igor and Interesting Numbers
- 2. CF Amr and Pins (数学)
- 3. Telcoin and dent make mobile networks interesting and profitable
- 4. CF-weekly4 F. Kyoya and Colored Balls
- 5. CF#637 D. Nastya and Scoreboard DP
- 6. Jamie and Interesting Graph CodeForces #916C[题解]
- 7. CF 1372F Omkar and Modes
- 8. CF 852E Casinos and travel
- 9. CF 1477A. Nezzar and Board
- 10. CF 1372C Omkar and Baseball