Cod sursa(job #1580750)
Utilizator | Data | 26 ianuarie 2016 08:28:48 | |
---|---|---|---|
Problema | A+B | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f("gears.in");
ofstream g("gears.out");
int n,x,s[105],viz[105];
vector<int> L[105];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<L[nod].size();i++)
{
int j=L[nod][i];
if(!viz[j])
{
if(s[nod]==0) s[j]=1;
else s[j]=0;
dfs(j);
}
}
}
int main()
{
f>>n>>x;
for(int i,j,k=1;k<n;k++)
{
f>>i>>j;
L[i].push_back(j);
L[j].push_back(i);
}
s[x]=0;
dfs(x);
for(int i=1;i<=n;i++)
if(s[i]==0) g<<"D";
else g<<"S";
g.close();
return 0;
}