Information
- ID
- 150
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 1
- Tags
- (None)
- # Submissions
- 32
- Accepted
- 17
- Uploaded By
#include<bits/stdc++.h>
using namespace std;
const int N=100010;
vector<int> g[N];
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b;
cin>>a>>b;
g[a].push_back(b);
}
for(int i=1;i<=n;i++)
{
cout<<g[i].size()<<" ";
sort(g[i].begin(),g[i].end());
for(int j=0;j<g[i].size();j++)
{
cout<<g[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
const int N=100010;
vector<int> g[N];
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b;
cin>>a>>b;
g[a].push_back(b);
}
for(int i=1;i<=n;i++)
{
cout<<g[i].size()<<" ";
sort(g[i].begin(),g[i].end());
for(int j=0;j<g[i].size();j++)
{
cout<<g[i][j]<<" ";
}
cout<<endl;
}
return 0;
}