fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 4 3
  28. // 1 7 6 8
  29. // 1 7 2
  30. // 2 9 5
  31.  
  32.  
  33. vector<int> locations;
  34. vector<int> movedFrom;
  35. vector<int> movedTo;
  36.  
  37. vector<int> consistency(int n, int m){
  38.  
  39. set<int> st;
  40. for(int i=0; i<n; i++) st.insert(locations[i]);
  41.  
  42. for(int i=0; i<m; i++){
  43. int x = movedFrom[i];
  44. int y = movedTo[i];
  45.  
  46. st.erase(x);
  47. st.insert(y);
  48. }
  49.  
  50. vector<int> ans;
  51. for(auto& t : st){
  52. ans.push_back(t);
  53. }
  54.  
  55. return ans;
  56. }
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72. vector<int> practice(int n, int m){
  73.  
  74. return {};
  75. }
  76.  
  77.  
  78.  
  79.  
  80.  
  81. void solve() {
  82.  
  83. int n, m;
  84. cin>> n >> m;
  85.  
  86. locations.resize(n);
  87. for(int i=0; i<n; i++) cin >> locations[i];
  88.  
  89. movedFrom.resize(m);
  90. movedTo.resize(m);
  91. for(int i=0; i<m; i++) cin >> movedFrom[i];
  92. for(int i=0; i<m; i++) cin >> movedTo[i];
  93.  
  94. auto ans = consistency(n, m);
  95.  
  96. for(auto& t : ans) cout << t << " "; cout << endl;
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107. int t = 1;
  108. // cin >> t;
  109. while (t--) {
  110. solve();
  111. }
  112.  
  113. return 0;
  114. }
Success #stdin #stdout 0s 5316KB
stdin
4 3
1 7 6 8
1 7 2
2 9 5
stdout
5 6 8 9