[Swift] 프로그래머스92342 양궁대회

import Foundation

func solution(_ n:Int, _ info:[Int]) -> [Int] {
    var max_diff:Int = 0
    var max_lst:[Int] = []    
    var dfs = [(0,0,0,0,Array(repeating: 0, count:11))]
    
    while dfs.count > 0 {
        let now = dfs.removeLast()
        let ascore = now.0
        let lscore = now.1
        let idx = now.2
        let cnt = now.3
        var lst = now.4
        
        if cnt > n {
            continue    
        }
        
        if idx > 10 {
            let diff = lscore - ascore
            if diff > max_diff {
                lst[10] = n - cnt
                max_lst = lst
                max_diff = diff
            }
            continue
        }
        
        if info[10-idx] > 0 {
            dfs.append((ascore+idx, lscore, idx+1, cnt, lst))
        } else {
            dfs.append((ascore, lscore, idx+1, cnt, lst))
        }
        
        if cnt < n {
            lst[10-idx] = info[10-idx] + 1
            dfs.append((ascore, lscore+idx, idx+1, cnt+info[10-idx]+1, lst))
        }
    }    
    
    return max_diff == 0 ? [-1] : max_lst
}

너무 어려워서 못풀었다.
continue를 활용해 필요없는 로직을 넘기는 부분과 dfs아이디어 너무 좋아서 가져왔다.