OJ Board

Code: Select all

How could i speed up my program!?
Please give me a hint!
I always got TLE!

Code: Select all

#include <iostream>
#include <cstdio>
#include <string>

using namespace std;

typedef struct _node
{
	char s1[101];
	int ex;
}NODE;

NODE data[1000];
NODE temp;

int main()
{
	int num,len,row;
	int i,j,m,n,count;
	string s2;
	char te;
	while( cin>>num )
	{
		for(j=0;j<num;j++)
		{
			cin>>len>>row;
			for(i=0;i<row;i++)
			{
			 cin>>data[i].s1;
			 s2=data[i].s1;
			 count=0;
		     for(m=0;m<len-1;m++)
				 for(n=0;n<len-m-1;n++)
					 if(s2[n]>s2[n+1])
					 {
						te=s2[n];
						s2[n]=s2[n+1];
						s2[n+1]=te;
						count++;
					 }
			 data[i].ex=count;
			}

		     for(m=0;m<row-1;m++)
				 for(n=0;n<row-m-1;n++)
					 if(data[n].ex>data[n+1].ex)
					 {
						temp=data[n];
						data[n]=data[n+1];
						data[n+1]=temp;
					 }

			for(i=0;i<row;i++)
				cout<<data[i].s1<<endl;
			    cout<<endl;

		}
	}





	return 0;
}

Code: Select all

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>

using namespace std;

typedef struct _node
{
	int ex;
	char s1[101];
}NODE;

NODE data[1000];
NODE temp;

bool cmp(struct _node a,struct _node b)
{
	return a.ex<b.ex;
}


int main()
{
	int num,len,row;
	int i,j,m,n,count;
	string s2;
	char te;
    cin>>num;
	
		for(j=0;j<num;j++)
		{
			cin>>len>>row;
			for(i=0;i<row;i++)
			{
			 cin>>data[i].s1;
			 s2=data[i].s1;
			 count=0;
		     for(m=0;m<len-1;m++)
				 for(n=0;n<len-m-1;n++)
					 if(s2[n]>s2[n+1])
					 {
						te=s2[n];
						s2[n]=s2[n+1];
						s2[n+1]=te;
						count++;
					 }
			 data[i].ex=count;
			}

			sort(data,data+row,cmp);
		     //for(m=0;m<row-1;m++)
			//	 for(n=0;n<row-m-1;n++)
			//		 if(data[n].ex>data[n+1].ex)
			//		 {
			///			temp=data[n];
			//			data[n]=data[n+1];
			//			data[n+1]=temp;
			//		 }

			for(i=0;i<row;i++)
				cout<<data[i].s1<<endl;
			    cout<<endl;

		}
	





	return 0;
}

Code: Select all

           for(m=0;m<len-1;m++) 
             for(n=0;n<len-m-1;n++) 
                if(s2[n]>s2[n+1]) 
                { 
                  te=s2[n]; 
                  s2[n]=s2[n+1]; 
                  s2[n+1]=te; 
                  count++; 
                } 

Code: Select all

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
bool f(pair<int,string> a , pair<int,string> b)
{
  return a.first < b.first;
}
int main(){
  int N,n,l,c;
  vector< pair<int,string> > m;
  string s;
  cin >> N;
  while(N--){
    m.clear();
    cin>>l>>n;
    for(int k=0; k<n; k++){
      cin>>s;
      c = 0;
      for(int i=0; i<l-1; i++){
        for(int j=i+1; j<l; j++){
          if(s.at(i)>s.at(j))
            c++;
        }
      }
      m.push_back(make_pair(c,s));
    }
    stable_sort(m.begin(), m.end(), f);
    for(int i=0;i<n; i++)
      {
        cout<<m[i].second<<endl;
      }
    cout<<endl;
  }
  return 0;
}

Code: Select all

#include<cstdio> 
 #include<algorithm> 
 #define MAXAMOUNT 105 
 #define MAXLENGHT 55 
 using namespace std; 
 char array[MAXAMOUNT][MAXLENGHT]; 
 int lenght,amount; 
 struct DNA 
 { 
         int Which; 
         int HowMany; 
 }; 
 DNA unsortednesses[MAXAMOUNT]; 
 void unsortedness(int level) 
 { 
         int counter=0; 
         for(int i=0; i<lenght; i++) 
         { 
                 char letter=array[level][i]; 
                 for(int j=i+1;j<lenght; j++) 
                         if(array[level][j]<letter) 
                                 counter++; 
         } 
         unsortednesses[level].HowMany=counter; 
         unsortednesses[level].Which=level; 
 } 
 bool cmp(DNA a, DNA b) 
 { 
         return a.HowMany<b.HowMany; 
 } 
 void input() 
 { 
         int cases; 
         scanf("%d\n",&cases); 
         for(int i=1; i<=cases; i++) 
         { 
                 scanf("%d%d\n",&lenght,&amount); 
                 for(int k=0; k<amount; k++) 
                 { 
                         scanf("%s",array[k]); 
                         unsortedness(k); 
                 } 
                 sort(unsortednesses,unsortednesses+amount,cmp); 
                 for(int k=0; k<amount; k++) 
                 { 
                         int level=unsortednesses[k].Which; 
                         for(int j=0; j<lenght; j++) 
                                 printf("%c",array[level][j]); 
                         printf("\n"); 
                 } 
                 scanf("\n"); 
                 if(i<cases) 
                         printf("\n"); 
         } 
 } 
 main() 
 { 
         input(); 
         return 0; 
 } 

Code: Select all

CUT AFTER ACC

Code: Select all

for (i = 0; i < size; i++)
	cout << array[i].str << endl;

Code: Select all

for (i = 0; i < size; i++)
	cout << array[i].str << endl;
cout << endl;

Code: Select all

a.erase(a.begin() ,a.end())