KQUERY - K-query
hide comments
congdanh2504:
2022-02-17 01:39:27
sqrt decomposition + binary search => AC |
|
ryuuk:
2022-02-07 08:42:10
Solved with BIT + offline queries |
|
joynal_67:
2022-01-13 13:29:46
Use Marge Sort Tree + Binary Search |
|
psz2007:
2022-01-13 07:15:05
Use Mo's Algorithm with time complexity O(n\sqrt{n}) and AC !!! |
|
mahbubkuet08:
2021-11-08 19:12:32
Getting WA. Any clue? |
|
adam____:
2021-08-25 14:16:42
used merge sort tree + bin search |
|
challenger_76:
2021-08-18 07:52:18
codencode op
|
|
yasser1110:
2021-07-21 10:51:25
@erne1309 interesting approach. Can you provide details? |
|
erne1309:
2021-07-11 06:10:09
ft+sort :) Last edit: 2021-07-11 06:11:31 |
|
hackerbhaiya:
2021-06-23 18:11:53
You can use square root decomposition here and merge sort trees as well. |
Added by: | Jimmy |
Date: | 2008-10-26 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Gomoku |