mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-08 02:13:51 +08:00
更新了许多
This commit is contained in:
40
小码君的好同学.cpp
Normal file
40
小码君的好同学.cpp
Normal file
@ -0,0 +1,40 @@
|
||||
#include <algorithm>
|
||||
#include <iostream>
|
||||
#include <iomanip>
|
||||
#include <cstring>
|
||||
#include <cstdio>
|
||||
#include <stack>
|
||||
#include <ctime>
|
||||
#include <cmath>
|
||||
#include <queue>
|
||||
typedef long long l;
|
||||
typedef double d;
|
||||
typedef char c;
|
||||
using namespace std;
|
||||
int vis[10000005];
|
||||
int main(){
|
||||
int n,m;
|
||||
cin >>n>>m;
|
||||
queue<int> que;
|
||||
for(int i=1;i<=m;i++){
|
||||
int p,k;
|
||||
cin >>p>>k;
|
||||
if(vis[p]==0){
|
||||
que.push(p);
|
||||
vis[p]=1;
|
||||
}
|
||||
for(int j=1;j<=k;j++){
|
||||
int t;
|
||||
cin >>t;
|
||||
if(vis[t]==0){
|
||||
que.push(t);
|
||||
vis[t]=1;
|
||||
}
|
||||
}
|
||||
}
|
||||
while(que.empty()==0){
|
||||
cout <<que.front()<<" ";
|
||||
que.pop();
|
||||
}
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user