0
Your rating: None

CodeChef submission 136752 (C++ 4.3.2)

CodeChef submission 136752 (C++ 4.3.2) plaintext list. Status: WA, problem SNCK01, contest SNACKDWN. By LTUnited (LTUnited), 2009-11-21 23:53:16.
  1. #pragma warning (disable:4786) 
  2. #pragma warning (disable:4996) 
  3. #include <time.h>
  4. #include <algorithm> 
  5. #include <iostream>  
  6. #include <sstream> 
  7. #include <string> 
  8. #include <vector> 
  9. #include <queue> 
  10. #include <stack>
  11. #include <set> 
  12. #include <map> 
  13. #include <cstdio> 
  14. #include <cstdlib> 
  15. #include <cctype> 
  16. #include <cmath> 
  17. #include <cassert>
  18. using namespace std;
  19.  
  20. #define PB push_back
  21. #define MP make_pair
  22. #define SZ(v) ((int)(v).size())
  23. #define FOR(i,a,b) for(int i=(a);i<(b);++i)
  24. #define REP(i,n) FOR(i,0,n)
  25. #define FORE(i,a,b) for(int i=(a);i<=(b);++i)
  26. #define REPE(i,n) FORE(i,0,n)
  27. #define FORSZ(i,a,v) FOR(i,a,SZ(v))
  28. #define REPSZ(i,v) REP(i,SZ(v))
  29. #define FILL(a,b) memset(a, (b), sizeof(a));
  30. typedef long long ll; 
  31. const double EPS = 1e-7;
  32.  
  33. void openfiles() {
  34. 	#ifndef ONLINE_JUDGE
  35. 		freopen("test.in","rt",stdin);
  36. 		//freopen("test.out","wt",stdout);   
  37. 	#endif
  38. }
  39.  
  40. void solve() {
  41.  
  42. 	int M [ 55 ] [ 55 ];
  43. 	int n, m;
  44. 	scanf("%d %d ",&n,&m);
  45. 	for ( int i = 0; i < n; i++ ) {
  46. 		for ( int j = 0; j < m; j++ ) {
  47. 			scanf("%d ",&M[i][j] );
  48. 		}
  49. 	}
  50.  
  51. 	int xr = 0;
  52. 	for ( int i = 0; i < n; i++ ) {
  53. 		int winthis = 0;
  54. 		int last = 0;
  55. 		for ( int j = m - 1; j >= 0; j-- )
  56. 		{
  57. 			if ( M[i][j] )
  58. 			{
  59. 				if ( last == 0 ) {
  60. 					last = M[i][j];
  61. 				}
  62. 				else if ( last > 0 ) {
  63. 					last = M[i][j] - 1;
  64. 				}
  65. 			}
  66. 		}
  67. 		xr ^= last;
  68. 	}
  69.  
  70. 	if ( xr == 0 )
  71. 	{
  72. 		printf("SECOND\n");
  73. 	}
  74. 	else
  75. 	{
  76. 		printf("FIRST\n");
  77. 	}
  78. }
  79.  
  80. int main() {
  81. 	//openfiles();
  82. 	int n;
  83. 	scanf("%d ",&n);
  84. 	REP(i,n) solve();
  85.  
  86. 	return 0;
  87. }

Comments