titouan
/
hackerrank
1
0
Fork 0
Code Issues 0 Pull Requests 0 Releases 0 Wiki Activity
41 Commits
1 Branch
56 KiB
Tree: 626654ae69
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '626654ae69'
${ noResults }
Commit Graph

14 Commits (626654ae69475812ec07af1932f98cf7664f130c)

Author SHA1 Message Date
  Titouan Rigoudy 626654ae69 Use interval tree and square root of n amortized approach. Wrong answer and same timeout though 11 years ago
  Titouan Rigoudy bcddc575e2 Use segment tree and flatten each sqrt(n), still too slow -> have to switch to interval tree 11 years ago
  Titouan Rigoudy 55b3dcdeba Changed wording 11 years ago
  Titouan Rigoudy 0539ee7989 Changed from fenwick trees to segment trees, still not fast enough 11 years ago
  Titouan Rigoudy 3c66cad684 Increased buffer size to 10MB, allocated on the heap 11 years ago
  Titouan Rigoudy 5ace988853 Instead of calling fgets for every line, call read once and strtok for each line 11 years ago
  Titouan Rigoudy c5445b6209 Moved v calculation to fenwick tree, always update v on power update 11 years ago
  Titouan Rigoudy e27bd82997 Update every p sequentially but use fenwick tree for sums of p 11 years ago
  Titouan Rigoudy 7d8666aa45 Use Fenwick tree for powers, still too slow 11 years ago
  Titouan Rigoudy 6502f6a60f Moved to longs, added struct adp, changed strtok_r to strtok 11 years ago
  Titouan Rigoudy 7e42d6886e C program looks like it works 11 years ago
  Titouan Rigoudy 916c699b90 Added handle_query 11 years ago
  Titouan Rigoudy c7d4c5c5b7 Added read_adp 11 years ago
  Titouan Rigoudy 284a955bf2 Started work on C arithmetic progressions 11 years ago