5
5
4
3
2
1

1
2
3
4
5

코드

import Foundation

let N = Int(readLine()!)!
var arr = [Int]()

for _ in 0..<N {
    arr.append(Int(readLine()!)!)
}

var resArr = arr.sorted()

for i in 0..<N{
    print(resArr[i])
}

10
5
2
3
1
4
2
3
5
1
7

1
1
2
2
3
3
4
5
5
7

코드

import Foundation

let N = Int(readLine()!)!
var arr = [Int]()

for _ in 0..<N {
    arr.append(Int(readLine()!)!)
}

var resArr = arr.sorted()

for i in 0..<N{
    print(resArr[i])
}

당연히 sort를 사용하여 푸는 문제라고 접근하여서 풀었더니 시간초과만 주구장창 나왔다...

N의 범위가 N(1 ≤ N ≤ 10,000,000) 이니 입력을 받을때와 print를 할때 시간이 오래걸리는것을 알았지만~

그다음은 생각을 못하였다..

https://gist.github.com/JCSooHwanCho/30be4b669321e7a135b84a1e9b075f88

검색후 입력을 야무지게 받을수 있는것을 찾았고..(정말 감사합니다 ㅠㅠ)

새로운 결과 배열을 추가하지않고 String에 줄바꿈을 하며 +하기로 하였다.

최종코드

import Foundation

final class FileIO {
    private let buffer:[UInt8]
    private var index: Int = 0

    init(fileHandle: FileHandle = FileHandle.standardInput) {
        
        buffer = Array(try! fileHandle.readToEnd()!)+[UInt8(0)] // 인덱스 범위 넘어가는 것 방지
    }

    @inline(__always) private func read() -> UInt8 {
        defer { index += 1 }

        return buffer[index]
    }

    @inline(__always) func readInt() -> Int {
            var sum = 0
            var now = read()
            var isPositive = true

            while now == 10
                || now == 32 { now = read() } // 공백과 줄바꿈 무시
            if now == 45{ isPositive.toggle(); now = read() } // 음수 처리
            while now >= 48, now <= 57 {
                sum = sum * 10 + Int(now-48)
                now = read()
            }

            return sum * (isPositive ? 1:-1)
        }
}

let file = FileIO()

let N = file.readInt()
var arr = Array(repeating:0,count:10001)

for _ in 0 ..< N {
    let i = file.readInt()
    arr[i] += 1
}

var res = ""

for i in 1...10000 {
    res += String(repeating:"\(i)\n",count:arr[i])
}
print(res)

216

198

import Foundation

let N = Int(readLine()!)!
var res = 1

for i in 0 ..< N{
    var temp = i
    var sum = 0
    while( temp != 0){
        sum += temp % 10
        temp /= 10
    }
    if (sum + i == N){
        res = i
        break
    }
}
print(res)

https://www.acmicpc.net/

14
push 1
push 2
top
size
empty
pop
pop
pop
size
empty
pop
push 3
empty
top

2
2
0
2
1
-1
0
1
-1
0
3

코드

import Foundation

public struct Stack<T>{
    private var elements = [T]()
    public init() {}
    
    public mutating func push(_ element: T){
        self.elements.append(element)
    }
    
    public mutating func pop() -> T? {
        return self.elements.popLast()
    }
    
    public func top() -> T? {
        return self.elements.last
    }
    
    public func empty() -> Bool {
        return self.elements.isEmpty
    }
    
    public var size: Int {
        return self.elements.count
    }
}

var myStack = Stack<Int>()
var arr : [String] = []

let input = Int(readLine()!)!

for _ in 0 ..< input {
    arr.append(readLine()!)
}

for i in 0 ..< input {
    var narr = arr[i].split(separator: " ")
    if narr[0] == "top"{
        let top = myStack.top()
        if top == nil{
            print(-1)
        }else{
            print(top!)
        }
    }
    if narr[0] == "size"{
        print(myStack.size)
    }
    if narr[0] == "pop"{
        let pop = myStack.pop()
        if pop == nil {
            print(-1)
        }else{
            print(pop!)
        }
    }
    if narr[0] == "empty"{
        if myStack.empty() == true{
            print(1)
        }else{
            print(0)
        }
    }
    if narr[0] == "push"{
        let n : Int = Int(narr[1])!
        myStack.push(n)
    }
    narr.removeAll()
}

• 문제를 만든 사람: baekjoon
• 데이터를 추가한 사람: deunlee, djm03178

6 2 10 3

1

코드

import Foundation

let input = readLine()!.split(separator: " ").map{Int(String ($0))!}

let inputX = input[0]
let inputY = input[1]
let compX = input[2]
let compY = input[3]

var resX = inputX-compX
var resY = inputY-compY


if (resX < 0){
    resX = resX * -1
}
if (resY < 0){
    resY = resY * -1
}

print(min(resX,resY,inputX,inputY))

• 문제를 번역한 사람: baekjoon

8 8
WBWBWBWB
BWBWBWBW
WBWBWBWB
BWBBBWBW
WBWBWBWB
BWBWBWBW
WBWBWBWB
BWBWBWBW

1

코드

import Foundation

let input = readLine()!.split(separator: " ").map{Int(String($0))!}
let row = input.first!
let col = input.last!
var arr : [[String]] = []
var res = 999

for _ in 0 ..< row {
    arr.append(readLine()!.map{String($0)})
}

let White =
[["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"]]

let Black =
[["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"],
["B","W","B","W","B","W","B","W"],
["W","B","W","B","W","B","W","B"]]

func compare(trow: Int,tcol:Int)-> Int{
    var Wcount = 0
    var Bcount = 0
    for i in 0..<8{
        for j in 0..<8{
            if White[i][j] != arr[trow + i][ tcol + j]{
                Wcount += 1
            }
            if Black[i][j] != arr[trow + i][ tcol + j]{
                Bcount += 1
            }
        }
    }
    if Wcount >= Bcount{
        return Bcount
    }else{
        return Wcount
    }
}

for i in 0...row-8{
    for j in 0...col-8{
        res = min(compare(trow: i, tcol: j),res)
    }
}

print(res)

• 문제를 번역한 사람: baekjoon
• 데이터를 추가한 사람: jh05013
• 문제를 다시 작성한 사람: jh05013