BOJ / 12789번 / 도키도키 간식드리미 [Go][Python3]

👩🏻‍💻 문제

12789번: 도키도키 간식드리미

---

✍🏻 풀이

🎨 Go

// https://www.acmicpc.net/problem/12789
package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()

	var n int
	fmt.Fscanln(reader, &n)
	var students = make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscanf(reader, "%d ", &students[i])
	}
	fmt.Fprintln(writer, getResult(students))
}

func getResult(students []int) string {
	var stack []int
	var line []int
	for len(students) > 0 {
		if len(stack) == 0 {
			stack = append(stack, students[0])
			students = students[1:]
		} else {
			if stack[len(stack)-1] > students[0] {
				stack = append(stack, students[0])
				students = students[1:]
			} else {
				line = append(line, stack[len(stack)-1])
				students = students[1:]
			}
		}
	}
	for len(stack) > 0 {
		line = append(line, stack[len(stack)-1])
		stack = stack[:len(stack)-1]
	}
	if sort.SliceIsSorted(line, func(i, j int) bool {
		return line[i] < line[j]
	}) {
		return "Nice"
	}
	return "Sad"
}

🎨 Python3

# https://www.acmicpc.net/problem/12789
import sys

def get_result(students):
    stack = []
    line = []
    while len(students) > 0:
        if len(stack) == 0:
            stack.append(students.pop(0))
        else:
            if stack[-1] > students[0]:
                stack.append(students.pop(0))
            else:
                line.append(stack[-1])
                students.pop(0)
    while len(stack) > 0:
        line.append(stack[-1])
        stack.pop(-1)
    if line == sorted(line):
        return "Nice"
    return "Sad"

if __name__ == "__main__":
    n = int(sys.stdin.readline())
    students = list(map(int, sys.stdin.readline().rstrip().split()))
    print(get_result(students))