450 - Little Black Book

[Mahmud776]

Hello Everybody,
What will be the highest size for the every input line and what will
be the highest number for the total persons.

Please tell me.I am in confusions.

[UFP2161]

I used 8192 for line input, 8192 for max number of people, and 128 for each individual field. Way more than enough I bet.

[Bug!]

I try to solve this prob but i still get TLE , anyone can help me pls??
here's my code:
*code deleted*
Thanx,
Andre

[Bug!]

I change my code, and it save me from TLE. But now i got WA with this problem.... Is my algorithm wrong???
Here's my code
*got AC now*
Cheers,
Andre

[_.B._]

Greetings!.
I used 4100 for maximun number of people.
Ah!, and since I used BubbleSort, and got TLE, I used 2 books, one for 'A' to 'L', and one for 'M' to 'Z', and got ACed . You may try QuickSort if you want, but I didn't want to change the sorting
Keep posting!.

[shamim]

I increased the size of arrays in the struct to 300, and the code got AC.

[Bug!]

Argh.... Finally I got AC with this prob.... Thx a lot Shamim....
Cheers..
Andre

[wolf]

Hi !
What's wrong with my code, I have "Invalid memory reference", but it works on my machine !

[cpp]
#include <iostream>
#include <string>
#include <stdio.h>
//#include <conio.h>

using namespace std;

int n,m,k,i,j;
char dep[60],os[309];

struct person
{
char title[20],name[50],lastname[50],adress[70],hphone[20],wphone[20],campusbox[10],department[60];
} dane[250],temp;

void save()
{
strcpy(dane[j].department,dep);
k=0;
for (m=0;;k++,m++)
{
if (os[k]==',') break;
dane[j].title[m]=os[k];
}
for (m=0,k++;;k++,m++)
{
if (os[k]==',') break;
dane[j].name[m]=os[k];
}
for (m=0,k++;;k++,m++)
{
if (os[k]==',') break;
dane[j].lastname[m]=os[k];
}
for (m=0,k++;;k++,m++)
{
if (os[k]==',') break;
dane[j].adress[m]=os[k];
}
for (m=0,k++;;k++,m++)
{
if (os[k]==',') break;
dane[j].hphone[m]=os[k];
}
for (m=0,k++;;k++,m++)
{
if (os[k]==',') break;
dane[j].wphone[m]=os[k];
}
for (m=0,k++;;k++,m++)
{
if (os[k]==0) break;
dane[j].campusbox[m]=os[k];
}
}

void sort_me()
{
j--;
for (k=0;k<=j;k++)
for (m=0;m<j;m++)
{
if (strcmp(dane[m].lastname,dane[m+1].lastname)>0)
{
temp=dane[m];
dane[m]=dane[m+1];
dane[m+1]=temp;
}
}
}

void display()
{
for (k=0;k<=j;k++)
{
cout << "----------------------------------------\n";
cout << dane[k].title << " " << dane[k].name << " " << dane[k].lastname << endl;
cout << dane[k].adress << endl;
cout << "Department: " << dane[k].department << endl;
cout << "Home Phone: " << dane[k].hphone << endl;
cout << "Work Phone: " << dane[k].wphone << endl;
cout << "Campus Box: " << dane[k].campusbox << endl;
}
}

int main()
{
scanf("%d\n",&n);
j=0;
for (i=0;i<n;i++)
{
gets(dep);
for (;;j++)
{
if (gets(os)==NULL) break;
if (os[0]==0) break;
save();
}
}
sort_me();
display();
//getch();
return 0;
}
[/cpp]

The method of sorting is very simple (maybe I'll have a TLE later), but this is only test now.

[tetuya]

hello wolf

why don't you append '\0' at the last of string?

[UFP2161]

You may have to increase the size of your arrays.. there may be more than 250 people [and each string may or may not be longer than your limits].. there's no limits stated in the problem which kind of sucks having to guess at them..

[wolf]

Thx, now time to do the quicksort (TLE)

[Dominik Michniewski]

One useful hint (I got Accepted now this problem):

In input is more than one test case

Best ragards
DM

[Ivo Sluganovic]

Can someone who got AC tell me what limits did he use for
Number of people and Maximum length of their names, adresses...

I keep on getting SIGSEGV no matter what limits I use.

Is it OK if I sort people using the implemented Qsort in C?

[jhonny_yang]

I almost get grazy about this easy problem

[c]
#include <stdio.h>
#include <string.h>

typedef struct{
char name[80];
char country[80];
char department[80];
char homephone[80];
char workphone[80];
char campusbox[80];
}DataStruct;

void Swap(DataStruct *a, DataStruct *b)
{
DataStruct temp;
strcpy(temp.campusbox,a->campusbox);
strcpy(temp.country,a->country);
strcpy(temp.department,a->department);
strcpy(temp.homephone,a->homephone);
strcpy(temp.name,a->name);
strcpy(temp.workphone,a->workphone);

strcpy(a->campusbox,b->campusbox);
strcpy(a->country,b->country);
strcpy(a->department,b->department);
strcpy(a->homephone,b->homephone);
strcpy(a->name,b->name);
strcpy(a->workphone,b->workphone);

strcpy(b->campusbox,temp.campusbox);
strcpy(b->country,temp.country);
strcpy(b->department,temp.department);
strcpy(b->homephone,temp.homephone);
strcpy(b->name,temp.name);
strcpy(b->workphone,temp.workphone);
}

int partition(DataStruct *s, int l, int h)
{
int i;
int p;
int firsthigh;

p = h;
firsthigh = l;
for (i=l; i<h; i++)
if (strcmp(s.name,s[p].name)<0){
Swap(&s,&s[firsthigh]);
firsthigh ++;
}
Swap(&s[p],&s[firsthigh]);

return(firsthigh);
}

void qsort(DataStruct *s, int l, int h)
{
int p;

if ((h-l)>0) {
p = partition(s,l,h);
qsort(s,l,p-1);
qsort(s,p+1,h);
}
}

int main()
{
int n,i,j,k;
DataStruct Buffer[80];
char buff[4200],*temp,department[4000];

scanf("%d\n",&n);

k=0;

while (gets(buff)){
strcpy(department,buff);

while (temp=gets(buff)){
if (strlen(buff)==0)break;
strcpy(Buffer[k].department,department);
i=0;j=0;
while (buff!=','){
Buffer[k].name[j++]=buff[i++];
}
Buffer[k].name[j++]=' ';++i;

while (buff!=','){
Buffer[k].name[j++]=buff[i++];
}
Buffer[k].name[j++]=' ';++i;

while (buff!=','){
Buffer[k].name[j++]=buff[i++];
}
Buffer[k].name[j++]=0;++i;

j=0;
while (buff!=','){
Buffer[k].country[j++]=buff[i++];
}
Buffer[k].country[j++]=0;++i;

j=0;
while (buff!=','){
Buffer[k].homephone[j++]=buff[i++];
}
Buffer[k].homephone[j++]=0;++i;

j=0;
while (buff!=','){
Buffer[k].workphone[j++]=buff[i++];
}
Buffer[k].workphone[j++]=0;++i;

j=0;
while (buff){
Buffer[k].campusbox[j++]=buff[i++];
}
Buffer[k].campusbox[j++]=0;++i;
++k;
}
if (temp==0)break;
}

qsort(Buffer,0,k-1);

for (i=0;i<k;i++){
printf("----------------------------------------\n");
printf("%s\n",Buffer.name);
printf("%s\n",Buffer[i].country);
printf("Department: %s\n",Buffer[i].department);
printf("Home Phone: %s\n",Buffer[i].homephone);
printf("Work Phone: %s\n",Buffer[i].workphone);
printf("Campus Box: %s\n",Buffer[i].campusbox);
}

return 0;
}
[/c]

[Larry]

Why did you write your own qsort?

Not saying it's wrong, but more chances to be wrong..