main.go 5.2 KB

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