문제

풀이

#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

void solution(int N, int M) {
    vector<int> basket(N);
    for (int idx = 0; idx < N; idx++) {
        basket[idx] = idx+1;
    }
    int i, j;
    
    while (M--) {
        cin >> i >> j;
        swap(basket[i-1], basket[j-1]);
    }

    for (auto& num : basket) {
        cout << num << ' ';
    }
}