백준 10813번: 공 바꾸기

https://www.acmicpc.net/problem/10813

1. 문제

2. 알고리즘

키워드 - 구현, 배열, swap

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n, m; cin >> n >> m;
    vector<int> arr;
    for (int i=0; i<n; i++) {
        arr.push_back(i+1);
    }
 
    for (int i=0; i<m; i++) {
        int x, y; cin >> x >> y;
        swap(arr[x-1], arr[y-1]);
    }
 
    for (int i=0; i<n; i++) {
        cout << arr[i] << " ";
    }
    return 0; 
}