0
Your rating: None
CodeChef submission 270509 (C) 

CodeChef submission 270509 (C) plaintext list. Status: WA, problem WORDS1, contest . By prajata (prajata), 2010-06-18 20:43:31.
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. int main()
  4. {
  5.  int source[26],dest[26],same[26],i,j,no_of_tests,no_of_words,count,count1,count2;
  6.  char str[5],start,end;
  7.  scanf("%d",&no_of_tests);
  8.  for(i=1;i<=no_of_tests;i++)
  9.  {
  10. 	 count=0;
  11. 	 count1=0;
  12. 	 count2=0;
  13. 	 scanf("%d",&no_of_words);
  14. 	 fread(str,1,1,stdin);   // done 2 eat up the line feed
  15. 	 for(j=0;j<26;j++)
  16. 	 {
  17. 		source[j]=0;
  18. 		dest[j]=0;
  19. 		same[j]=0;
  20. 	 }
  21. 	 for(j=1;j<=no_of_words;j++)
  22. 	 {
  23. 		fread(str,1,1,stdin);
  24. 		start=str[0];
  25. 		while(str[0]>='a'&& str[0]<='z')
  26. 		{
  27. 		  end=str[0];
  28. 		  fread(str,1,1,stdin);
  29. 		}
  30. 		if(start==end)
  31. 		 same[start-'a']=1;
  32. 		else
  33. 		{
  34. 		  source[start-'a']++;
  35. 		  dest[end-'a']++;
  36. 		}
  37. 	 }
  38. 	 for(j=0;j<26;j++)
  39. 	 {
  40. 		if(same[j])
  41. 		{
  42. 			if(source[j])
  43. 			{
  44. 			  same[j]--;
  45. 			  source[j]--;
  46. 			}
  47. 			else if(dest[j])
  48. 			{
  49. 			  dest[j]--;
  50. 			  same[j]--;
  51. 			}
  52. 		}
  53. 		if(source[j]>dest[j])
  54. 		{
  55. 		  source[j]-=dest[j];
  56. 		  dest[j]=0;
  57. 		}
  58. 		else
  59. 		{
  60. 		  dest[j]-=source[j];
  61. 		  source[j]=0;
  62. 		}
  63. 	 }
  64. 	 for(j=0;j<26;j++)
  65. 	 {
  66. 		 if(same[j])
  67. 			 count++;
  68. 	 }
  69. 	 if(count>1)
  70. 	 {
  71. 		 printf("The door cannot be opened.\n");
  72. 		 continue;
  73. 	 }
  74. 	 if(count)
  75. 	 {
  76. 		for(j=0;j<26;j++)
  77. 		{
  78. 			if(source[j]!=0||dest[j]!=0)
  79. 			  break;
  80. 		}
  81. 		if(j==26)
  82. 		{
  83. 			printf("Ordering is possible.\n");
  84. 			continue;
  85. 		}
  86. 		printf("The door cannot be opened.\n");                      ////
  87. 		continue;
  88. 	 }
  89. 	 for(j=0;j<26;j++)
  90. 	 {
  91. 		  count1+=source[j];
  92. 		  count2+=dest[j];
  93. 	 }
  94. 	 if((count1==1&&count2==1)||(count1==0&&count2==0))
  95. 	 {
  96. 			printf("Ordering is possible.\n");
  97. 			continue;
  98. 	 }
  99. 	 printf("The door cannot be opened.\n");
  100.  }
  101.  return 0;
  102. }

Comments