WA:problem TTTABLE

[piyush_neo]

i don't know why m getting WA...although i checked for various test cases from forums too..
don't panic from lenght of code..half of it is used to create heap....

include

int minson(int *,int ,int);
void insert(int*,int,int);
int maxdel(int*,int);
int main(){
int cases,lines,na,nb,trn_a[101],trn_atb[101],trn_b[101],trn_bta[101],frma=0,frmb=0;
trn_a[0]=trn_atb[0]=trn_b[0]=trn_bta[0]=-1;

int a,b,c,d,turnaround,i,tna,tnb,j;
scanf("%d",&cases);
for(j=0;jfrma=0,frmb=0;
scanf("%d",&turnaround);
scanf("%d %d",&na,&nb);
for(i=0;i scanf("%d:%d %d:%d",&a,&b,&c,&d);
insert(trn_a,i+1,a*60+b);//i is present size of heap
insert(trn_atb,i+1,c*60+d+turnaround);
}

for(i=0;i<nb;i++){ scanf("%d:%d %d:%d",&a,&b,&c,&d); insert(trn_b,i+1,a*60+b);//i is present size of heap insert(trn_bta,i+1,c*60+d+turnaround);
}
tna=na;tnb=nb;
while(tna!=0 && tnb !=0){
if(trn_a[1] frma++;
maxdel(trn_a,tna);
tna--;
}
else{
maxdel(trn_a,tna);
maxdel(trn_bta,tnb);
tna--;
tnb--;
}
}
frma+=tna;
printf("Case #%d: %d ",j+1,frma);

tna=na;tnb=nb; while(tna!=0 && tnb !=0){ if(trn_b[1]<trn_atb[1]){ frmb++; maxdel(trn_b,tnb); tnb--; } else{ maxdel(trn_b,tnb); maxdel(trn_atb,tna); tna--; tnb--; } } frmb+=tnb; printf("%d\n",frmb);
}
return 0;
}

void insert(int *arr,int j,int num){
int father=j/2;
while(father!=0 && num < arr[father]){
arr[j]=arr[father];
j=father;
father=j/2;
}
arr[j]=num;
}

int maxdel(int* arr,int k){
int max=arr[1];
int temp=arr[k];
int s=2,f=1;
s=minson(arr,1,k-1);

while(s>=0 && temp>arr[s]){
arr[f]=arr[s];
f=s;
s=minson(arr,f,k-1);

}

arr[f]=temp;
return max;
}

int minson(int *arr,int a,int k){
int s=a*2;
if(s+1<=a && arr[s]>arr[s+1])
s++;
if(s>k)
return -1;
else
return s;
}

[color=#FF0000]plz provide some test cases where the code fails....
thanks in advance...[/color]

[leppyr64]

The first thing to do is to post your code using the code tags and not the quote tags. It's never fun to decipher code when formatting is poor.

[piyush_neo]

sorry i was not knowing....now plz help...

#include<stdio.h>
int minson(int *,int ,int);
void insert(int*,int,int);
int maxdel(int*,int);
int main(){
int cases,lines,na,nb,trn_a[101],trn_atb[101],trn_b[101],trn_bta[101],frma=0,frmb=0;
trn_a[0]=trn_atb[0]=trn_b[0]=trn_bta[0]=-1;
int a,b,c,d,turnaround,i,tna,tnb,j;
scanf("%d",&cases);
for(j=0;j<cases;j++){
frma=0,frmb=0;
scanf("%d",&turnaround);
scanf("%d %d",&na,&nb);
for(i=0;i<na;i++){
scanf("%d:%d %d:%d",&a,&b,&c,&d);
insert(trn_a,i+1,a*60+b);//i is present size of heap
insert(trn_atb,i+1,c*60+d+turnaround);
}
for(i=0;i<nb;i++){
scanf("%d:%d %d:%d",&a,&b,&c,&d);
insert(trn_b,i+1,a*60+b);//i is present size of heap
insert(trn_bta,i+1,c*60+d+turnaround);
}
tna=na;tnb=nb;
while(tna!=0 && tnb !=0){
if(trn_a[1]<trn_bta[1]){
frma++;
maxdel(trn_a,tna);
tna--;
}
else{
maxdel(trn_a,tna);
maxdel(trn_bta,tnb);
tna--;
tnb--;
}
}
frma+=tna;
printf("Case #%d: %d ",j+1,frma);
tna=na;tnb=nb;
while(tna!=0 && tnb !=0){
if(trn_b[1]<trn_atb[1]){
frmb++;
maxdel(trn_b,tnb);
tnb--;
}
else{
maxdel(trn_b,tnb);
maxdel(trn_atb,tna);
tna--;
tnb--;
}
}
frmb+=tnb;
printf("%d\n",frmb);
}
return 0;
}
void insert(int *arr,int j,int num){
int father=j/2;
while(father!=0 && num < arr[father]){
arr[j]=arr[father];
j=father;
father=j/2;
}
arr[j]=num;
}
int maxdel(int* arr,int k){
int max=arr[1];
int temp=arr[k];
int s=2,f=1;
s=minson(arr,1,k-1);
while(s>=0 && temp>arr[s]){
arr[f]=arr[s];
f=s;
s=minson(arr,f,k-1);
}
arr[f]=temp;
return max;
}
int minson(int *arr,int a,int k){
int s=a*2;
if(s+1<=a && arr[s]>arr[s+1])
s++;
if(s>k)
return -1;
else
return s;
}

[hendrik]

Honestly this doesnt look much better, does it? Or is this your standard coding style? I doubt.

[piyush_neo]

ya that look creepy...but jst look at the main algo in main().....rest of the functions i have used to create heap insted of sorting numbers by other sorting methods...u can ignore them....
can u plz simply tell me.. for which test cases the code is failed...
thanks....

[hendrik]

At least functionwise it looks similar to what I did whereas in Python.
I have created a few test cases which I thought should show up the problem. But they produced all the same output.
So I cant help you. Sorry. Perhaps somebody else can.
But still I recommend to tidy up your code a little. Readability counts.

[piyush_neo]

...i removed the heap stuff and made it through simple sorting.....
got accepted.......
and yes, this time i make it more clean and readable... 8)
anyways thanks for help.....