結果

問題 No.267 トランプソート
ユーザー ccppjsrbccppjsrb
提出日時 2020-07-14 21:19:25
言語 Go
(1.23.4)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 2,107 bytes
コンパイル時間 14,895 ms
コンパイル使用メモリ 222,316 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-18 15:33:06
合計ジャッジ時間 14,109 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
"strings"
)
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)
cardnumber := map[string]int{
"A": 1,
"T": 10,
"J": 11,
"Q": 12,
"K": 13,
}
for i := 2; i < 10; i++ {
cardnumber[fmt.Sprintf("%d", i)] = i
}
cc := make(cards, n)
for i := 0; i < n; i++ {
s := getNextString(scanner)
cc[i] = newCard(s, cardnumber)
}
sort.SliceStable(cc, cc.less)
ans := make([]string, n)
for i := 0; i < n; i++ {
ans[i] = cc[i].s
}
fmt.Fprintln(writer, strings.Join(ans, " "))
}
func newCard(s string, cn map[string]int) card {
c := card{}
c.s = s
switch s[0] {
case 'D':
c.suit = 0
case 'C':
c.suit = 1
case 'H':
c.suit = 2
case 'S':
c.suit = 3
}
c.num = cn[s[1:]]
return c
}
type card struct {
suit, num int
s string
}
type cards []card
func (c cards) less(i, j int) bool {
if c[i].suit == c[j].suit {
return c[i].num < c[j].num
}
return c[i].suit < c[j].suit
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0