OJ Board

Code: Select all

FILE *in = stdin;


vector<string> tokenize(string s, string ch) { 
  vector<string> ret; 
  for( int i = 0, j; i < s.size(); i = j+1 ) { 
    j = s.find_first_of(ch, i); 
    if( j == -1 ) j = s.size(); 
    if( j-i > 0 ) ret.push_back( s.substr(i, j-i) ); 
  } 
  return ret; 
} 

string readline()
{
	char ch;
	string ret;

	while(fscanf(in,"%c",&ch)!=EOF)
	{
		if(ch=='\n') return ret;
		ret+=ch;
	}

	return ret;
}


class node { public:
vi a;
string name;
};


map<string,int> p;
node z[6000];

void solve(int turn)
{
	int i;
	fo(i,z[turn].a.size())
		solve(z[turn].a[i]);

	printf("%s\n",z[turn].name.c_str());
}

void solve2(int turn)
{
	int i;
	for(i=z[turn].a.size()-1 ; i>=0 ; i--)
		solve(z[turn].a[i]);

	printf("%s\n",z[turn].name.c_str());
}

int main()
{
	int i,n,k=0,flag=0;	
	string s;
	vs v;
	char ch;

	fo(i,6000)
		z[i].a.clear();
	
	while(1)
	{
		s=readline();
		if(s.size()==0) break;

		v=tokenize(s,",");
		
		fo(i,v.size())
			if(p.find(v[i])==p.end())
			{
				z[k].name=v[i];
				p[v[i]]=k++;
			}

		for(i=1 ; i<v.size() ; i++)
			z[p[v[0]]].a.push_back(p[v[i]]);			
	}

	fo(i,6000)
		if(z[i].a.size()>1)
			flag=1;

	if(flag)
	{
		printf("2\n\n");
		solve(0);
		printf("\n");
		solve2(0);
	}

	else
	{
		printf("1\n\n");
		solve(0);
	}

	return 0;
}