0
Your rating: None

CodeChef submission 678694 (C++ 4.0.0-8)

CodeChef submission 678694 (C++ 4.0.0-8) plaintext list. Status: TLE, problem TSORT, contest . By rokon1cuet_51 (rokon1cuet_51), 2011-10-01 10:48:23.
  1. #include<stdio.h>
  2. long a[1000000];
  3. void quicksort(long a[],long p,long r);
  4. long partition(long a[],long p,long r);
  5. int main()
  6. {
  7. 	long t,i;
  8. 	scanf("%ld",&t);
  9. 	for(i=0;i<t;i++)
  10. 	scanf("%ld",&a[i]);
  11. 	quicksort(a,0,t-1);
  12. 	
  13. 		for(i=0;i<t;i++)
  14. 			printf("%ld\n",a[i]);
  15. 		return 0; 
  16. }
  17. void quicksort(long a[],long p,long r)
  18. {
  19. 	
  20. 	if(p<r)
  21. 	{
  22. 	long q=partition(a,p,r);
  23. 		quicksort(a,p,q-1);
  24. 		quicksort(a,q+1,r);
  25. 	
  26. 	}
  27. }
  28. long partition(long a[],long p,long r)
  29. {
  30.  
  31. 	long x=a[r];
  32. 	long i=p-1;
  33. 	for(long j=p;j<r;j++)
  34. 	{
  35. 	if(a[j]<=x)
  36. 	{
  37. 	
  38. 	i++;
  39. 	long tmp=a[i];
  40. 	a[i]=a[j];
  41. 	a[j]=tmp;
  42. 	
  43. 	}
  44. 	}
  45. 	long t=a[i+1];
  46. 	a[i+1]=a[r];
  47. 	a[r]=t;
  48. 	return(i+1);
  49.  
  50. }
  51.  
  52.

Comments