Segcolt/CSES-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add a lot more of my solutions.

Browse Source 
I don't remember which ones doesn't pass though
This commit is contained in:
Segcolt
2025-09-12 14:51:10 -03:00
parent 2a94def2d6
commit 8b03716512
114 changed files with 14012 additions and 95 deletions
Download Patch File Download Diff File Expand all files Collapse all files

256
.gdb_history Normal file
View File

@@ -0,0 +1,256 @@
p b
next
run
next
p pref[i - a]
next
next
p vaar
p var
p pref[i]
p pref[i] - *var.begin()
next
break 94
run
next
p i - b + 1
p i - b + 1
p i
break 94
run
run
next
p i - b + 1
p a
p b
p i - b + 1
p i
p i - b - 1
break 94
run
next
next
p ans
p var
p pref[i - a]
break 94
run
next
p anms
p ans
next
p i - a
p pref[i - a]
p i
next
p ansd
p ans
next
p var
break 127
ru
p log
next
p log
p l
p r
p r - (1 << log)
sparse
p sparse
break 128
run
p sparse
continue
run
p sparse[l][log]
p l
p r
break 128
run
break 154
run
p seg[0 + fds.size()]
p segl[0 + fds.size()]
p segl[1 + fds.size()]
p segl[1 + fds.size()]
p segl[2 + fds.size()]
p segl[3 + fds.size()]
p segl[4 + fds.size()]
p segl[5 + fds.size()]
next
p i
p fds[i]
p sparsequery(i, i)
p ans
p i
next
p segr[8 + fds.size()]
p segr[7 + fds.size()]
p segr[8 + fds.size()]
p segr[9 + fds.size()]
break 178
ru
p segr
p segr[5 + fds.size()]
break 138
run
nextr
next
pi
p i
p i
p i
continue
necxt
nexty
next
continue
next
continue
next
next
p seg[6 + fds.size()]
break 139
run
continue
next
p ans
break 126
run
p count
p n
break 109
run
next
p ans
p count
break 90
run
next
p sum
next
p i
next
break 110
run
p sum
p count
break 86
run
break 87
run
next
next
p tmp
next
next
p i
p s.top().second
p
p s
next
p s
p tmp
next
p s
p i
p fds[i]
next
break 135
run
next
next
step
next
break 157
run
next
p pdis[i
p pdis[i
break 120
run
p parent
break 121
run
p reachable
break 121
run
p reachable
break 121
ru
run
p reachable
break 94
run
next
break 25
break 120
run
next
p j
next
p res
break 120
run
ruk
run
next
p i
next
p ans
next
p i
p res
break 183
run
1 2
1 3
p loop
p cyclesize
groupsize
p cyclepos
p groupsize
run
p loop
p groupsize
p groups
p group
p cyclechoice
next
next
p choice
next
p pos[a]
p ((cyclepos[b] - cyclepos[a]) % groupsize[g] + groupsize[g]) % groupsize[g]
p b
p ((cyclepos[b] - cyclepos[choice]) % groupsize[g] + groupsize[g]) % groupsize[g]
next
run
next
next
p j
run
run
continue
next
next
p ff
p F
step
next
p ff
step
break 1154
break 115
continue
p f
next
p f
p e.cap - e.flow
p e.cap
p e.flow
p f
p e.cap - e.flow
continue
p v
p f