Submission #62545294

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
using ll = long long;
int main() {
  ll n;
  cin >> n;
  vector<ll> p(n + 1);
  for (ll i = 1; i <= n; i++) {
    cin >> p[i];
  }
  vector<ll> q(n + 1);
  for (ll i = 1; i <= n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<map>

using namespace std;
using ll = long long;

int main() {
	ll n;
	cin >> n;
	vector<ll> p(n + 1);
	for (ll i = 1; i <= n; i++) {
		cin >> p[i];
	}
	vector<ll> q(n + 1);
	for (ll i = 1; i <= n; i++) {
		cin >> q[i];
	}
	vector<ll> re(n + 1);
	for (ll i = 1; i <= n; i++) {
		re[i] = q[p[i]];
	}
	map<ll, ll> m{};
	for (ll i = 1; i <= n; i++) {
		m.insert(make_pair(q[i], re[i]));
	}
	sort(q.begin(), q.end());
	for (int i = 1; i <= n; i++) {
		if (i == n)cout << m[i] << endl;
		else cout << m[i] << ' ';
	}
}

Submission Info

Judge Result