結果
問題 | No.1245 ANDORゲーム(calc) |
ユーザー |
![]() |
提出日時 | 2021-01-22 20:59:46 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 116 ms / 2,000 ms |
コード長 | 2,487 bytes |
コンパイル時間 | 13,864 ms |
コンパイル使用メモリ | 223,612 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-27 19:53:03 |
合計ジャッジ時間 | 19,185 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
package mainimport ("bufio""fmt""math""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}// min for n entryfunc nmin(a ...int) int {ret := a[0]for _, e := range a {ret = min(ret, e)}return ret}// max for n entryfunc nmax(a ...int) int {ret := a[0]for _, e := range a {ret = max(ret, e)}return ret}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}func main() {defer wr.Flush()sc.Split(bufio.ScanWords)sc.Buffer([]byte{}, math.MaxInt32)// this template is new version.// use getI(), getS(), getInts(), getF()N, Q := getI(), getI()a := getInts(N)s := getS()var d [32][2]intfor i := 0; i < 32; i++ {for x := 0; x < 2; x++ {cur := xprev := xfor j := 0; j < N; j++ {if s[j] == '0' {cur &= (a[j] >> i) & 1} else {cur |= (a[j] >> i) & 1}if cur != prev {d[i][x]++}prev = cur}}}t := getInts(Q)for i := 0; i < Q; i++ {tot := 0for j := 0; j < 32; j++ {x := (t[i] >> j) & 1tot += d[j][x] << j}out(tot)}// for i := 0; i < 32; i++ {// out(d[i])// }// out(Q)// for i := 0; i < N; i++ {// fmt.Printf("%8.8b\n", a[i])// }}func f(t int, a []int, s string) {b := make([]int, 0)b = append(b, t)for i := 0; i < len(a); i++ {b = append(b, a[i])}x := b[0]ans := 0prev := b[0]for i := 1; i <= len(s); i++ {if s[i-1] == '0' {x &= b[i]} else {x |= b[i]}ans += abs(prev - x)prev = x}out(ans)}