[알고리즘] 백준 20361 - 일우는 야바위꾼 (C++)

[문제 링크] : https://www.acmicpc.net/problem/20361

#include <iostream>
#include <vector>
using namespace std;

int N, M, K, Ans;
vector <int> V;

int main(){
    cin >> N >> M >> K;
    V.resize(N + 1);

    for(int i=1; i<=N; i++){
        V[i] = i;
    }

    int a, b;
    for(int i=0; i<K; i++){
        cin >> a >> b;
        swap(V[a], V[b]);
    }

    for(int i=1; i<=N; i++){
        if(V[i] == M){
            Ans = i;
            break;
        }
    }

    cout << Ans << "\n";
    return 0;
}