#592438 (Go) No.1121 Social Distancing in Cinema

• 問題: No.1121 Social Distancing in Cinema
• ユーザー: aru aru
• 提出日時: 2020-12-12 12:12:15
• 言語: Go (1.23.4)
• 結果: WA
• 実行時間: -
• コード長: 2,504 bytes
• コンパイル時間: 11,189 ms
• コンパイル使用メモリ: 227,272 KB
• 実行使用メモリ: 11,952 KB
• 最終ジャッジ日時: 2024-09-19 21:51:10
• 合計ジャッジ時間: 17,121 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 25 WA * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
package main
import (
    "bufio"
    "fmt"
    "os"
    "sort"
    "strconv"
)
var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)
func out(x ...interface{}) {
    fmt.Fprintln(wr, x...)
}
func getI() int {
    sc.Scan()
    i, e := strconv.Atoi(sc.Text())
    if e != nil {
        panic(e)
    }
    return i
}
func getF() float64 {
    sc.Scan()
    i, e := strconv.ParseFloat(sc.Text(), 64)
    if e != nil {
        panic(e)
    }
    return i
}
func getInts(N int) []int {
    ret := make([]int, N)
    for i := 0; i < N; i++ {
        ret[i] = getI()
    }
    return ret
}
func getS() string {
    sc.Scan()
    return sc.Text()
}
// min, max, asub, absなど基本関数
func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}
func min(a, b int) int {
    if a < b {
        return a
    }
    return b
}
func asub(a, b int) int {
    if a > b {
        return a - b
    }
    return b - a
}
func abs(a int) int {
    if a >= 0 {
        return a
    }
    return -a
}
func lowerBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] >= x
    })
    return idx
}
func upperBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] > x
    })
    return idx
}
type pos struct {
    x, y, idx int
}
func calcD(a, b pos) int {
    dx := a.x - b.x
    dy := a.y - b.y
    return dx*dx + dy*dy
}
func main() {
    defer wr.Flush()
    sc.Split(bufio.ScanWords)
    sc.Buffer([]byte{}, 1000000)
    // this template is new version.
    // use getI(), getS(), getInts(), getF()
    N := getI()
    x := make([]int, N)
    y := make([]int, N)
    for i := 0; i < N; i++ {
        x[i], y[i] = getI(), getI()
    }
    K := (N + 89) / 90
    for a := 0; a < 8; a++ {
        for b := 0; b <= 11; b++ {
            ans := make([]int, 0)
            for i := 0; i < N; i++ {
                if x[i]%16 == a%16 && y[i]%12 == b%12 {
                    ans = append(ans, i)
                    continue
                }
                if x[i]%16 == (a+8)%16 && y[i]%12 == (b+6)%12 {
                    ans = append(ans, i)
                    continue
                }
            }
            if len(ans) >= K {
                out(len(ans))
                for _, e := range ans {
                    fmt.Fprint(wr, e+1, " ")
                }
                out()
                return
            }
        }
    }
    // for a := 0; a <= 8; a++ {
    //  for b := 0; b <= 9; b++ {
    //      ans := make([]int, 0)
    //      for i := 0; i < N; i++ {
    //          if x[i]%18 == a%18 && y[i]%10 == b%10 {
    //              ans = append(ans, i)
    //              continue
    //          }
    //          if x[i]%18 == (a+9)%18 && y[i]%10 == (b+5)%10 {
    //              ans = append(ans, i)
    //              continue
    //          }
    //      }
    //      if len(ans) >= K {
    //          out(len(ans))
    //          for _, e := range ans {
    //              fmt.Fprint(wr, e+1, " ")
    //          }
    //          out()
    //          return
    //      }
    //  }
    // }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX