Pagini recente » Cod sursa (job #2738480) | Cod sursa (job #1395172) | Cod sursa (job #358172) | Cod sursa (job #1349258) | Cod sursa (job #2356015)
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <thread>
#define pb push_back
#define mp make_pair
#define MAXN 100001
#define DIM 8192
using namespace std;
class Reader
{
public:
Reader(const char* filename)
{
f.open(filename);
pos = 0;
f.read(buffer,DIM);
}
inline Reader& operator >>(int& x)
{
x=0;
sgn=1;
while((buffer[pos]<'0'||buffer[pos]>'9')&&buffer[pos]!='-')
if(++pos==DIM)
f.read(buffer,DIM),pos=0;
if(buffer[pos]=='-')sgn=-1,pos++;
while(buffer[pos]>='0'&&buffer[pos]<='9')
{
x=x*10+buffer[pos]-'0';
if(++pos==DIM)f.read(buffer,DIM),pos=0;
}
x*=sgn;
return (*this);
}
inline Reader& operator >>(char* c)
{
aux = 0;
while(isspace(buffer[pos]))
if(++pos==DIM)
f.read(buffer,DIM),pos=0;
while(!isspace(buffer[pos]))
{
c[aux++]=buffer[pos];
if(++pos==DIM)f.read(buffer,DIM),pos=0;
}
return (*this);
}
~Reader()
{
f.close();
}
private:
ifstream f;
int pos,aux,sgn;
char buffer[DIM];
};
class Writer
{
public:
Writer(const char* filename)
{
g.open(filename);
pos = 0;
}
inline Writer& operator <<(int xx)
{
aux = 0;
x = xx;
if(xx<0)x=-x;
if(x==0)
nr[aux++]='0';
while(x)
{
nr[aux++]=x%10+'0';
x/=10;
}
if(xx<0)nr[aux++]='-';
while(aux>0)
{
buffer[pos++]=nr[--aux];
if(pos==DIM)g.write(buffer,DIM),pos=0;
}
return (*this);
}
inline Writer& operator <<(const char* c)
{
aux = 0;
while(c[aux])
{
buffer[pos++]=c[aux++];
if(pos==DIM)g.write(buffer,DIM),pos=0;
}
return (*this);
}
~Writer()
{
g.write(buffer,pos);
g.close();
}
private:
ofstream g;
int pos,aux,x;
char buffer[DIM],nr[21];
};
Reader f("exp.in");
Writer g("exp.out");
#define Nmax 100002
int N,M,X,x,y,k,v,node;
vector <int>Neighbour[Nmax];
queue <int>c;
vector <int>used(Nmax,-1);
void bfs()
{
c.push(X);used[X]=0;
while(!c.empty())
{
v=c.front();c.pop();
for(k=0;k<Neighbour[v].size();k++)
{
node=Neighbour[v][k];
if(used[node]==-1)
used[node]=used[v]+1,c.push(node);
}
}
}
int main()
{
f>>N>>M>>X;
for(int i=1;i<=M;i++)
{
f>>x>>y;
Neighbour[x].push_back(y);
}
bfs();
for(k=1;k<=N;k++)g<<used[k]<<" ";
return 0;
}