|
@@ -8,9 +8,22 @@ import (
|
8
|
8
|
var input *os.File
|
9
|
9
|
var output *os.File
|
10
|
10
|
|
11
|
|
-var A int
|
12
|
|
-var B int
|
|
11
|
+var R int
|
13
|
12
|
var C int
|
|
13
|
+var F int
|
|
14
|
+var N int
|
|
15
|
+var B int
|
|
16
|
+var T int
|
|
17
|
+
|
|
18
|
+var Rides []Ride
|
|
19
|
+
|
|
20
|
+var Cars []*Car
|
|
21
|
+
|
|
22
|
+var Sched Scheduler
|
|
23
|
+
|
|
24
|
+type Ride struct {
|
|
25
|
+ a, b, x, y, s, f int
|
|
26
|
+}
|
14
|
27
|
|
15
|
28
|
type Scheduler interface {
|
16
|
29
|
Add(Car)
|
|
@@ -26,7 +39,30 @@ type Car struct {
|
26
|
39
|
Y int
|
27
|
40
|
}
|
28
|
41
|
|
|
42
|
+func assign() bool {
|
|
43
|
+ c := sched.Pop()
|
|
44
|
+ r := Choose(c)
|
|
45
|
+ c.Update(r)
|
|
46
|
+ sched.Add(c)
|
|
47
|
+}
|
|
48
|
+
|
29
|
49
|
func solve() {
|
|
50
|
+
|
|
51
|
+ // create cars
|
|
52
|
+ for i := 0; i < F; i++ {
|
|
53
|
+ c := &Car{
|
|
54
|
+ ID: i,
|
|
55
|
+ Arrival: 0,
|
|
56
|
+ X: 0,
|
|
57
|
+ Y: 0,
|
|
58
|
+ }
|
|
59
|
+ Cars = append(Cars, c)
|
|
60
|
+ Sched.Add(c)
|
|
61
|
+ }
|
|
62
|
+
|
|
63
|
+ for assign() {
|
|
64
|
+ }
|
|
65
|
+
|
30
|
66
|
fmt.Fprintf(output, "%d\n", C)
|
31
|
67
|
}
|
32
|
68
|
|
|
@@ -51,9 +87,23 @@ func main() {
|
51
|
87
|
defer output.Close()
|
52
|
88
|
|
53
|
89
|
// Global
|
54
|
|
- A = readInt()
|
55
|
|
- B = readInt()
|
|
90
|
+ R = readInt()
|
56
|
91
|
C = readInt()
|
|
92
|
+ F = readInt()
|
|
93
|
+ N = readInt()
|
|
94
|
+ B = readInt()
|
|
95
|
+ T = readInt()
|
|
96
|
+
|
|
97
|
+ for i := 0; i < N; i++ {
|
|
98
|
+ Rides = append(Rides, Ride{
|
|
99
|
+ a: readInt(),
|
|
100
|
+ b: readInt(),
|
|
101
|
+ x: readInt(),
|
|
102
|
+ y: readInt(),
|
|
103
|
+ s: readInt(),
|
|
104
|
+ f: readInt(),
|
|
105
|
+ })
|
|
106
|
+ }
|
57
|
107
|
|
58
|
108
|
solve()
|
59
|
109
|
}
|