OJ Board

hello everyone
I am getting TLE but i do not know why?? please could you tell me, what I am doing bad?? I use Segment tree + Lazy Propagation it is my first implementation, thank you everyone, here is my code:
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using ...

#include <cstdio>
#include <map>
#include <vector>
#include <queue>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
struct word
{
string pal;
int step;
};

int main()
{
int n;
scanf("%d",&n);
string dic;
cin.ignore();
getline(cin,dic);
bool primera=true;
while(n ...

#include <cstdio>
#include <map>
#include <vector>
#include <queue>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
struct word
{
string pal;
int step;
};

int main()
{
int n;
scanf("%d",&n);
string dic;
cin.ignore();
getline(cin,dic);
bool primera=true;
while(n ...

//someone help me please pleaseeeeeeee
// i am getting WA and prove all the test cases and the output is correct in this post but UVa gives me a WA
// somebody could tell me pleaseeeee



#include <cstdio>
#include <stack>
#include <vector>
#include <algorithm>
using namespace std;
#define SZ 100 ...