My Code is working fine in offline and online compilers… But it shows segmentation fault when submitted on SPOJ… PLEASE PLEASE PLEASE Help me coder friends…!!!
My CODE For QUERY ON A TREE…!!
#include
#include<string.h>
using namespace std;
#define l 100
int findEdge(int m1[l], int m2[l], int j, int a[l][3], int n)
{
int i, m, h, sum = 0;
for(i=0;i<n-1;i++)
{
if(m1[j] == a[i][0])
m = i;
if(m2[j] == a[i][1])
h = i;
}
for(i=m;i<h+1;i++)
sum = sum + a[i][2];
return sum;
}
int main()
{
int t,n,a[l][3],i,j,k,edge[l];
char s[l][7];
int m1[l], m2[l];
cin>>t;
while(t--)
{
cin>>n;
for(i=0;i<n-1;i++)
cin>>a[i][0]>>a[i][1]>>a[i][2];
j=0;
k=0;
while(true)
{
cin>>s[j];
if(!strcmp(s[j],"DONE"))
break;
cin>>m1[j]>>m2[j];
if(!strcmp(s[j],"CHANGE"))
{
a[m1[j]-1][2] = m2[j];
}
if(!strcmp(s[j],"QUERY"))
{
edge[k] = findEdge(m1,m2,j,a,n);
k++;
}
j++;
}
for(i=0;i<k;i++)
cout<<edge[i]<<endl;
}
return 0;
}