0
Your rating: None

CodeChef submission 130641 (C++ 4.0.0-8)

CodeChef submission 130641 (C++ 4.0.0-8) plaintext list. Status: RE, problem J2, contest NOV09. By kevindra (kevindra), 2009-11-11 11:04:07.
  1. #include<string>
  2. #include<iostream>
  3. #include<map>
  4. #include<vector>
  5. #include<algorithm>
  6. #include<math.h>
  7. #include<functional>
  8. #include<stdio.h>
  9.  
  10. typedef long long ll;
  11. typedef long double ld;
  12.  
  13. #define ind(n) scanf("%d",&n)
  14. #define outd(n) printf("%d",n)
  15. #define inf(n) scanf("%f",&n)
  16. #define outf(n) printf("%f",n)
  17. #define inl(n) scanf("%ld",&n)
  18. #define outl(n) printf("%ld",n)
  19. #define inll(n) scanf("%lld",&n)
  20. #define outll(n) printf("%lld",n)
  21. #define inc(n) scanf("%c",&n)
  22. #define outc(n) printf("%c",n)
  23. #define ins(n) scanf("%s",n)
  24. #define outs(n) printf("%s",n)
  25. #define MAX(a,b) a<b?b:a;
  26. #define MIN(a,b) a<b?a:b;
  27. #define fori(i,n) for(i=0; i<n; i++)
  28. #define ford(i,n) for(i=n; i>=0; i--)
  29. #define allocate(type,size) (type*)malloc(size*sizeof(type));
  30. template<class T> T MIN3(T a,T b,T c){
  31. 	T t = MIN(a,b);
  32. 	return MIN(c,t);
  33. }
  34. template<class T> T MAX3(T a,T b,T c){
  35. 	T t = MAX(a,b);
  36. 	return MAX(c,t);
  37. }
  38.  
  39. template<class T> T** allocate2D(T **a,int r,int c){
  40. 	a = (T**)malloc(r*sizeof(T));
  41. 	for(size_t i = 0 ; i < r ; i++)
  42. 		a[i] = (T*)malloc(c*sizeof(T));
  43. 	return a;
  44. }
  45.  
  46. using namespace std;
  47. ll *l;
  48. char a[1000],b[1000];
  49. ll maximum=0;
  50. map<string,int> mstr[10];
  51. ll lcs(int i,int j,string s1,int t,ll length){
  52. 	if(*(a+i)=='\0' || *(b+j)=='\0'){
  53. 		//if(length > maximum) maximum = length;
  54. 		if(mstr[t][s1] == 0){
  55. 			l[length] += 1;
  56. 			mstr[t][s1] = 1;
  57. 		}
  58. 		return length;
  59. 	}
  60. 	//if(length >= maximum){
  61. 		if(*(a+i)==*(b+j)){ s1+=*(a+i);return lcs (i+1,j+1,s1,t,length+1); }
  62. 		else{ return MAX( lcs(i,j+1,s1,t,length), lcs(i+1,j,s1,t,length) ); }
  63. 	//}
  64. 	//else return length;
  65. }
  66.  
  67. int main(){
  68. 	int t;
  69. 	ind(t);
  70. 	while(t--){
  71. 		ins(a); ins(b);
  72. 		l = (ll*)calloc(1000,sizeof(ll));
  73. 		maximum=0;
  74. 		ll len = lcs(0,0,"",t,0);
  75. 		cout<<len<<" "<<l[len]%23102009<<"\n";
  76. 	}
  77. 	return 0;
  78. }

Comments