@[RanHT](/user/881471)
map 太慢，用 unordered_map
```cpp
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[8]={-1,0,1,0};
int dy[8]={0,1,0,-1};
const int N=10,mod=80112002;
string s,ss,sss;
char cz;
int len,m,a,b,c,d,k,x,y,w[N],f[N],n,o,p,
dp[10],dis[N],bj[1],h[N],ne[N],e[N];
ll idx;
int res,ans,num;
vector<int>v1;
typedef pair<string,string> pp;
queue<pp>q;
unordered_map<ll,ll>mp;
void add(int a,int b,int c)
{
w[idx]=c;
e[idx]=b;
ne[idx]=h[a];
h[a]=idx++;
}
int main()
{
ios::sync_with_stdio(false);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int j=1;j<=n;j++){
vector<int> v;
cin>>m;
for(int i=1;i<=m;i++){
cin>>a;
if(mp[a]!=j){
v.push_back(a);
mp[a]=j;
}
}
for(auto i:v){
cout<<i<<' ';
}
cout<<"\n";
}
return 0;
}
```
by LgxTpre @ 2023-07-13 00:10:49
@[LgxTpre](/user/66709) 好的，谢谢
by RanHT @ 2023-07-13 11:10:11