#560577 (Go) No.990 N×Mマス計算（Kの倍数）

• 問題: No.990 N×Mマス計算（Kの倍数）
• ユーザー: ccppjsrb
• 提出日時: 2020-10-01 11:49:17
• 言語: Go (1.22.1)
• 結果: WA
• 実行時間: -
• コード長: 2,148 bytes
• コンパイル時間: 11,799 ms
• コンパイル使用メモリ: 226,160 KB
• 実行使用メモリ: 14,656 KB
• 最終ジャッジ日時: 2024-07-07 01:13:37
• 合計ジャッジ時間: 12,158 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	19 ms; 8,000 KB
testcase_11	AC	14 ms; 6,940 KB
testcase_12	AC	216 ms; 6,940 KB
testcase_13	AC	10 ms; 6,940 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	24 ms; 8,764 KB
testcase_17	WA	-
testcase_18	AC	221 ms; 6,940 KB
testcase_19	AC	64 ms; 6,940 KB
testcase_20	AC	54 ms; 14,656 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	m := getNextInt(scanner)
	k := getNextInt(scanner)
	op := getNextString(scanner)
	bb := make([]int, m)
	for i := 0; i < m; i++ {
		bb[i] = getNextInt(scanner)
	}
	aa := make([]int, n)
	for i := 0; i < n; i++ {
		aa[i] = getNextInt(scanner)
	}
	var ans int64
	if op == "*" {
		ma := map[int]int{}
		for i := 0; i < n; i++ {
			g := gcd(aa[i], k)
			ma[g]++
		}
		mb := map[int]int{}
		for i := 0; i < m; i++ {
			g := gcd(bb[i], k)
			mb[g]++
		}
		for a, ac := range ma {
			for b, bc := range mb {
				if gcd(a*b, k) == k {
					ans += int64(ac * bc)
				}
			}
		}
		fmt.Fprintln(writer, ans)
		return
	}
	ma := map[int]int{}
	mb := map[int]int{}
	for i := 0; i < n; i++ {
		ma[aa[i]%k]++
	}
	for i := 0; i < m; i++ {
		mb[bb[i]%k]++
	}
	for a, c := range ma {
		ans += int64(c) * int64(mb[k-a])
	}
	fmt.Fprintln(writer, ans)
}
func gcd(m, n int) int {
	if n == 0 {
		return m
	}
	return gcd(n, m%n)
}