#512028 (Go) No.90 品物の並び替え

• 問題: No.90 品物の並び替え
• ユーザー: ccppjsrb
• 提出日時: 2020-07-16 00:25:52
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 328 ms / 5,000 ms
• コード長: 2,084 bytes
• コンパイル時間: 16,045 ms
• コンパイル使用メモリ: 222,640 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-22 18:20:48
• 合計ジャッジ時間: 16,780 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 9

ソースコード

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
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)
    items := make([]item, m)
    for i := 0; i < m; i++ {
        items[i].l = getNextInt(scanner)
        items[i].r = getNextInt(scanner)
        items[i].score = getNextInt(scanner)
    }
    var ans int
    dfs(0, n, make([]int, n), 0, items, &ans)
    fmt.Fprintln(writer, ans)
}
type item struct {
    l, r, score int
}
func dfs(i, n int, a []int, used uint32, items []item, ans *int) {
    if i == n {
        m := len(items)
        score := 0
        var ll uint32
        for j := 0; j < n; j++ {
            for k := 0; k < m; k++ {
                if items[k].r != a[j] {
                    continue
                }
                if ll>>uint(items[k].l)&1 == 0 {
                    continue
                }
                score += items[k].score
            }
            ll = ll | 1<<uint(a[j])
        }
        if *ans < score {
            *ans = score
        }
    }
    for j := 0; j < n; j++ {
        if used>>uint(j)&1 == 1 {
            continue
        }
        a[i] = j
        dfs(i+1, n, a, used|1<<uint(j), items, ans)
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX