Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

求模几步就搞掂了，为何TLE?入来看看如何？

Posted by Algor at 2010-03-03 20:33:50 on Problem 1026

//cipher
//Time Limit Exceeded
//20100125
#include<iostream>
using namespace std;
int arr[205],block;
char c[205],coded[205],msg[205];
bool isSame()
{
	for(int i=0;i<block;i++){
		if(msg[i]!=coded[i])
			return false;
	}
	return true;
}
int main()
{
	int k,i,j,cnt;
	while(scanf("%d",&block)&&block){
		for(i=0;i<block;i++)
			scanf("%d",arr+i);
		while(scanf("%d",&k)&&k)
		{
			scanf(" ");
			gets(c);
			int len=strlen(c);
			for(i=0;i<block;i++)
				coded[i]=' ';
			for(i=len;i<block;i++)
				c[i]=' ';
			strcpy(msg,c);
			cnt=0;
			if(k>0){
				for(j=0;j<k;j++)
				{
					cnt++;
					for(i=0;i<block;i++)
						coded[arr[i]-1]=c[i];
					if(isSame()){
						k%=cnt;
						break;
					}
					else{
						for(i=0;i<block;i++)
							c[i]=coded[i];
					}
				}
			}
			if(cnt)
				strcpy(c,msg);
			//cout<<k<<" "<<cnt<<endl;
			for(j=0;j<k;j++)
			{
				for(i=0;i<block;i++)
					coded[arr[i]-1]=c[i];
				for(i=0;i<block;i++)
					c[i]=coded[i];
			}
			for(i=0;i<block;i++)
				printf("%c",coded[i]);
			printf("\n");
		}
	}
	return 0;
}

Followed by:

Re:求模几步就搞掂了，为何TLE?入来看看如何？ (28) xuhaoran510 2010-04-05 17:15:37
White Bunk Beds (0) sawcealayLews 2012-04-10 20:35:37
Belief of cosmos (0) Cerlenepledge 2012-07-26 22:23:26
hi (0) suzysnowonline 2012-08-24 15:40:31
philips electric shaver reviews india (0) Goaneouroni 2012-08-25 01:28:22
howdie (0) MenSwentumn 2012-09-03 13:45:44
Bodily Exercise Is Much Much More Than Typical Doing The Job Out (0) Emaidssaw 2012-09-03 17:49:37
last post (0) MenSwentumn 2012-09-08 21:42:39
Tampa (0) Gownabraw 2012-09-11 09:23:04
Does Consuming Numerous Drinking Water Lessen Blood Pressure (0) Axongeinose 2012-09-23 10:38:43
Sound Advice For Developing A Much More Muscular Corporel (0) whisparsese 2012-09-28 11:44:59
kredyt samochodowy euro # (0) MATAENUNC 2012-10-01 13:50:59
- Re:kredyt samochodowy euro # (0) 20152430211 2017-07-29 20:31:13
Tampa (0) Gownabraw 2012-10-24 01:32:58
Chelsea massage (0) Trelviliego 2012-11-02 10:37:29
شات صوتي (0) immelazex 2012-11-22 01:46:50
الجوف - الخبر - الدمام - الرياض - الطائف (0) Grelicherry 2012-11-30 04:22:16
nice site (0) JepBeappY 2012-12-29 13:24:52
tantra london (0) baiguepabappy 2013-01-11 22:47:24
Removal Of Skin Tags (1238) Evadypapjat 2013-05-18 03:20:08
Creation of harmony and peace thus Satwik Massage refers to himself (0) DeawnVaxFeala 2013-06-15 06:31:38

Post your reply here:

User ID:
Password:
Title:

Content:

> //cipher
> //Time Limit Exceeded
> //20100125
> #include<iostream>
> using namespace std;
> int arr[205],block;
> char c[205],coded[205],msg[205];
> bool isSame()
> {
> 	for(int i=0;i<block;i++){
> 		if(msg[i]!=coded[i])
> 			return false;
> 	}
> 	return true;
> }
> int main()
> {
> 	int k,i,j,cnt;
> 	while(scanf("%d",&block)&&block){
> 		for(i=0;i<block;i++)
> 			scanf("%d",arr+i);
> 		while(scanf("%d",&k)&&k)
> 		{
> 			scanf(" ");
> 			gets(c);
> 			int len=strlen(c);
> 			for(i=0;i<block;i++)
> 				coded[i]=' ';
> 			for(i=len;i<block;i++)
> 				c[i]=' ';
> 			strcpy(msg,c);
> 			cnt=0;
> 			if(k>0){
> 				for(j=0;j<k;j++)
> 				{
> 					cnt++;
> 					for(i=0;i<block;i++)
> 						coded[arr[i]-1]=c[i];
> 					if(isSame()){
> 						k%=cnt;
> 						break;
> 					}
> 					else{
> 						for(i=0;i<block;i++)
> 							c[i]=coded[i];
> 					}
> 				}
> 			}
> 			if(cnt)
> 				strcpy(c,msg);
> 			//cout<<k<<" "<<cnt<<endl;
> 			for(j=0;j<k;j++)
> 			{
> 				for(i=0;i<block;i++)
> 					coded[arr[i]-1]=c[i];
> 				for(i=0;i<block;i++)
> 					c[i]=coded[i];
> 			}
> 			for(i=0;i<block;i++)
> 				printf("%c",coded[i]);
> 			printf("\n");
> 		}
> 	}
> 	return 0;
> }

Home Page Go Back To top