結果
問題 | No.1115 二つの数列 / Two Sequences |
ユーザー |
![]() |
提出日時 | 2020-07-17 21:51:37 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 2,395 bytes |
コンパイル時間 | 15,779 ms |
コンパイル使用メモリ | 239,556 KB |
実行使用メモリ | 11,648 KB |
最終ジャッジ日時 | 2024-11-29 23:21:22 |
合計ジャッジ時間 | 18,622 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 35 |
ソースコード
package mainimport ("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.Stdinwfp := os.Stdoutextra := 0if 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)aa := make([]int, n)bb := make([]int, n)ii := map[int]int{}seg := newSegment(n)for i := 0; i < n; i++ {seg.update(i, 1, seg.add)}for i := 0; i < n; i++ {aa[i] = getNextInt(scanner)ii[aa[i]] = i}var ans intfor i := 0; i < n; i++ {bb[i] = getNextInt(scanner)ans += seg.query(0, ii[bb[i]], 0, seg.add)seg.update(ii[bb[i]], 0, seg.add)}fmt.Fprintln(writer, ans)}type segment [][]intfunc newSegment(n int) segment {seg := make(segment, 0)for n > 1 {seg = append(seg, make([]int, n))n = (n + 1) >> 1}seg = append(seg, make([]int, 1))return seg}func (seg segment) update(i int, v int, f func(x, y int) int) {seg[0][i] = vfor h := 1; h < len(seg); h++ {i >>= 1if i<<1+1 < len(seg[h-1]) {seg[h][i] = f(seg[h-1][i<<1], seg[h-1][i<<1+1])} else {seg[h][i] = seg[h-1][i<<1]}}}func (seg segment) query(l, r int, s int, f func(x, y int) int) int {for h := 0; h < len(seg) && l < r; h++ {if l&1 == 1 {s = f(s, seg[h][l])l++}l >>= 1if r&1 == 1 {s = f(s, seg[h][r-1])}r >>= 1}return s}func (seg segment) add(x, y int) int {return x + y}