#514455 (Go) No.1092 modular arithmetic

• 問題: No.1092 modular arithmetic
• ユーザー: ccppjsrb
• 提出日時: 2020-07-19 16:02:45
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 59 ms / 2,000 ms
• コード長: 2,457 bytes
• コンパイル時間: 13,917 ms
• コンパイル使用メモリ: 233,068 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-09 15:40:12
• 合計ジャッジ時間: 12,655 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	15 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	29 ms; 5,376 KB
testcase_04	AC	25 ms; 5,376 KB
testcase_05	AC	23 ms; 5,376 KB
testcase_06	AC	17 ms; 5,376 KB
testcase_07	AC	23 ms; 5,376 KB
testcase_08	AC	24 ms; 5,376 KB
testcase_09	AC	20 ms; 5,376 KB
testcase_10	AC	17 ms; 5,376 KB
testcase_11	AC	18 ms; 5,376 KB
testcase_12	AC	15 ms; 5,376 KB
testcase_13	AC	7 ms; 5,376 KB
testcase_14	AC	7 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	6 ms; 5,376 KB
testcase_17	AC	7 ms; 5,376 KB
testcase_18	AC	24 ms; 5,376 KB
testcase_19	AC	15 ms; 5,376 KB
testcase_20	AC	26 ms; 5,376 KB
testcase_21	AC	19 ms; 5,376 KB
testcase_22	AC	23 ms; 5,376 KB
testcase_23	AC	48 ms; 5,376 KB
testcase_24	AC	15 ms; 5,376 KB
testcase_25	AC	37 ms; 5,376 KB
testcase_26	AC	45 ms; 5,376 KB
testcase_27	AC	8 ms; 5,376 KB
testcase_28	AC	37 ms; 5,376 KB
testcase_29	AC	59 ms; 5,376 KB
testcase_30	AC	40 ms; 5,376 KB
testcase_31	AC	6 ms; 5,376 KB
testcase_32	AC	36 ms; 5,376 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) {
	m = mint(getNextInt(scanner))
	n := getNextInt(scanner)
	aa := make([]mint, n)
	for i := 0; i < n; i++ {
		aa[i] = mint(getNextInt(scanner))
	}
	s := getNextString(scanner)
	var ans mint
	ans.addAs(aa[0])
	for i := 0; i < n-1; i++ {
		switch s[i] {
		case '+':
			ans.addAs(aa[i+1])
		case '-':
			ans.subAs(aa[i+1])
		case '*':
			ans.mulAs(aa[i+1])
		case '/':
			ans.divAs(aa[i+1])
		}
	}
	fmt.Fprintln(writer, ans)
}

var m mint

type mint int64

func (mt mint) mod() mint {
	mt %= m
	if mt < 0 {
		return mt + m
	}
	return mt
}
func (mt mint) inv() mint {
	return mt.pow(mint(0).sub(2))
}
func (mt mint) pow(n mint) mint {
	p := mint(1)
	for n > 0 {
		if n&1 == 1 {
			p.mulAs(mt)
		}
		mt.mulAs(mt)
		n >>= 1
	}
	return p
}
func (mt mint) add(x mint) mint {
	return (mt + x).mod()
}
func (mt mint) sub(x mint) mint {
	return (mt - x).mod()
}
func (mt mint) mul(x mint) mint {
	return (mt * x).mod()
}
func (mt mint) div(x mint) mint {
	return mt.mul(x.inv())
}
func (mt *mint) addAs(x mint) *mint {
	*mt = mt.add(x)
	return mt
}
func (mt *mint) subAs(x mint) *mint {
	*mt = mt.sub(x)
	return mt
}
func (mt *mint) mulAs(x mint) *mint {
	*mt = mt.mul(x)
	return mt
}
func (mt *mint) divAs(x mint) *mint {
	*mt = mt.div(x)
	return mt
}