main.go 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271
  1. package main
  2. import (
  3. "fmt"
  4. "os"
  5. "sort"
  6. )
  7. var input *os.File
  8. var output *os.File
  9. var R int
  10. var C int
  11. var F int
  12. var N int
  13. var B int
  14. var T int
  15. var Rides []*Ride
  16. var Cars []*Car
  17. var Sched Scheduler
  18. type Ride struct {
  19. ID int
  20. a, b, x, y, s, f int
  21. used bool
  22. }
  23. type ByEndtime []*Ride
  24. func (rs ByEndtime) Len() int { return len(rs) }
  25. func (rs ByEndtime) Swap(i, j int) { rs[i], rs[j] = rs[j], rs[i] }
  26. func (rs ByEndtime) Less(i, j int) bool {
  27. return rs[i].f < rs[j].f
  28. }
  29. type Scheduler interface {
  30. Add(*Car)
  31. Pop() *Car
  32. }
  33. type Car struct {
  34. ID int
  35. Rides []int
  36. Arrival int
  37. X int
  38. Y int
  39. }
  40. func (c *Car) Update(r *Ride) {
  41. c.moveTo(r.a, r.b)
  42. c.moveTo(r.x, r.y)
  43. c.Rides = append(c.Rides, r.ID)
  44. }
  45. func (c *Car) moveTo(x, y int) {
  46. xdist := c.X - x
  47. if xdist < 0 {
  48. xdist = -xdist
  49. }
  50. ydist := c.Y - y
  51. if ydist < 0 {
  52. ydist = -ydist
  53. }
  54. c.Arrival += xdist + ydist
  55. c.X = x
  56. c.Y = y
  57. }
  58. func Choose(c *Car) *Ride {
  59. sort.Sort(ByEndtime(Rides))
  60. for _, r := range Rides {
  61. if !r.used {
  62. return r
  63. }
  64. }
  65. return nil
  66. }
  67. func assign() bool {
  68. c := Sched.Pop()
  69. if c == nil {
  70. return false
  71. }
  72. r := Choose(c)
  73. if r == nil {
  74. return true
  75. }
  76. r.used = true
  77. c.Update(r)
  78. Sched.Add(c)
  79. return true
  80. }
  81. func solve() {
  82. Sched = &prioq{}
  83. // create cars
  84. for i := 0; i < F; i++ {
  85. c := &Car{
  86. ID: i,
  87. Arrival: 0,
  88. X: 0,
  89. Y: 0,
  90. }
  91. Cars = append(Cars, c)
  92. Sched.Add(c)
  93. }
  94. for assign() {
  95. }
  96. for _, c := range Cars {
  97. fmt.Fprintf(output, "%d", len(c.Rides))
  98. for _, ri := range c.Rides {
  99. fmt.Fprintf(output, " %d", ri)
  100. }
  101. fmt.Fprintf(output, "\n")
  102. }
  103. }
  104. func main() {
  105. sample := os.Args[1]
  106. fileIn := sample + ".in"
  107. fileOut := sample + ".out"
  108. var err error
  109. input, err = os.Open(fileIn)
  110. if err != nil {
  111. panic(fmt.Sprintf("open %s: %v", fileIn, err))
  112. }
  113. output, err = os.Create(fileOut)
  114. if err != nil {
  115. panic(fmt.Sprintf("creating %s: %v", fileOut, err))
  116. }
  117. defer input.Close()
  118. defer output.Close()
  119. // Global
  120. R = readInt()
  121. C = readInt()
  122. F = readInt()
  123. N = readInt()
  124. B = readInt()
  125. T = readInt()
  126. for i := 0; i < N; i++ {
  127. Rides = append(Rides, &Ride{
  128. ID: i,
  129. a: readInt(),
  130. b: readInt(),
  131. x: readInt(),
  132. y: readInt(),
  133. s: readInt(),
  134. f: readInt(),
  135. })
  136. }
  137. solve()
  138. }
  139. func readInt() int {
  140. var i int
  141. fmt.Fscanf(input, "%d", &i)
  142. return i
  143. }
  144. func readString() string {
  145. var str string
  146. fmt.Fscanf(input, "%s", &str)
  147. return str
  148. }
  149. func readFloat() float64 {
  150. var x float64
  151. fmt.Fscanf(input, "%f", &x)
  152. return x
  153. }
  154. // Prioq
  155. // Invariant: both children are bigger
  156. type prioq struct {
  157. bintree []*Car
  158. }
  159. func (pq *prioq) Add(car *Car) {
  160. pq.bintree = append(pq.bintree, car)
  161. // Rebalance tree to respect invariant
  162. var i = len(pq.bintree) - 1
  163. var p = (i - 1) / 2
  164. for p >= 0 && pq.bintree[p].Arrival > pq.bintree[i].Arrival {
  165. pq.bintree[p], pq.bintree[i] = pq.bintree[i], pq.bintree[p]
  166. i = p
  167. p = (i - 1) / 2
  168. }
  169. }
  170. func (pq *prioq) Pop() *Car {
  171. if len(pq.bintree) == 0 {
  172. return nil
  173. }
  174. if len(pq.bintree) == 1 {
  175. elem := pq.bintree[0]
  176. pq.bintree = pq.bintree[:0]
  177. return elem
  178. }
  179. elem := pq.bintree[0]
  180. // Put last element at root
  181. pq.bintree[0] = pq.bintree[len(pq.bintree)-1]
  182. // Remove last element
  183. pq.bintree = pq.bintree[:len(pq.bintree)-1]
  184. // 1 9
  185. // 10 9 10 12
  186. // 11 12 13 14 -> 11 12 13 14
  187. // 12
  188. // Rebalance tree to respect invariant
  189. len := len(pq.bintree)
  190. i, left, right := 0, 0, 0
  191. for {
  192. left = 2*i + 1
  193. right = 2*i + 2
  194. if left < len && right < len { // Two children
  195. if pq.bintree[left].Arrival <= pq.bintree[right].Arrival {
  196. if pq.bintree[i].Arrival <= pq.bintree[left].Arrival {
  197. break // Inferior to both children
  198. } else {
  199. pq.bintree[i], pq.bintree[left] = pq.bintree[left], pq.bintree[i]
  200. i = left
  201. }
  202. } else {
  203. if pq.bintree[i].Arrival <= pq.bintree[right].Arrival {
  204. break // Inferior to both children
  205. } else {
  206. pq.bintree[i], pq.bintree[right] = pq.bintree[right], pq.bintree[i]
  207. i = right
  208. }
  209. }
  210. } else if left < len { // One child (left)
  211. if pq.bintree[i].Arrival <= pq.bintree[left].Arrival {
  212. break // Inferior to only child
  213. }
  214. pq.bintree[i], pq.bintree[left] = pq.bintree[left], pq.bintree[i]
  215. i = left
  216. } else { // No child
  217. break
  218. }
  219. }
  220. return elem
  221. }
  222. func (pq *prioq) empty() bool {
  223. return len(pq.bintree) == 0
  224. }