OJ Board

Getting TLE .
This is my first submission on UVA and I am getting TLE. I am using BFS and assuming directed tree.
Please help

#include<stdio.h>
#include<vector>
#include<queue>
#include<string.h>
using namespace std;
int main()
{
int nodes,cases=0;
scanf("%d", &nodes);
while(nodes!=0){
cases ...