Pagini recente » Cod sursa (job #1939063) | Cod sursa (job #1237536) | Cod sursa (job #821197) | Cod sursa (job #1483085) | Cod sursa (job #3166960)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("file.in");
ofstream cout("file.out");
const int Nmax = 250005;
vector<pair<int, int>> query[Nmax];
vector<int> p[Nmax];
int sol[Nmax];
vector<int> c;
void dfs(int x)
{
c.push_back(x);
for(auto it : query[x])
{
int id = c.size() - it.second - 1;
sol[it.first] = c[id];
}
c.pop_back();
}
int main()
{
int m, n;
cin >> n >> m;
for(int i = 1; i<=n; i++)
{
int t;
cin >> t;
p[t].push_back(i);
query[t].push_back(i);
}
for(int i = 1; i<=n; i++)
cout << sol[i] << '\n';
}