What is wrong with map.clear() in my program

[funprogrammer]

I am trying to write a program for snake and ladder game. I am having an issue with the map.clear in the main function. Can someone help me with why map.clear does not work here? Any help is greatly appreciated.

My code is:
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

void adjacencyList(vector<vector<int> > &adjList, map<int,int> &snake, map<int,int> &ladder){
    for(int i=1; i<=100;i++){
        for(int j=1;j<=6;j++){
            int val = i+j;
            if(ladder.find(val) != ladder.end()){
                val = ladder.find(val)->second;
            }
            if(snake.find(val)!= snake.end()){
                val = snake.find(val)->second;
            }
            if(val<=100){
                adjList[i][j]= val;           
            }
            else{
                adjList[i][j]=0;
            }
        }
    }
}

void breadthFirstSearch(vector<vector<int> > &adjList, int &level){
    vector<int> levels;
    vector<int> parent;
    //cout <<"Inside breadthFirstSearch"<<endl;
    levels.resize(101);
    parent.resize(101);
    for(int i=1;i<=100;i++){
        levels[i] = -1;
        parent[i] = 0;
    }
    int lev = 0;
    levels[1]=0;
    bool flag=1;
    //cout <<"Before for loop"<<endl;
    while(flag){
        flag=0;
        for(int i=1;i<=100;i++){
            if(levels[i]==lev){
                flag = 1;
                //cout <<"adjList size is"<<adjList[i].size()<<endl;
                for(int j=1;j<=adjList[i].size();j++){
                    if(parent[adjList[i][j]]== 0){
                        levels[adjList[i][j]] = lev+1;
                        parent[adjList[i][j]] = i;
                    }
                }
            }
        }
        lev++;        
    }
    /*cout <<"After for loop"<<endl;
    for(int i=1;i<=100;i++){
        cout <<"i is "<<i<<", level is "<<levels[i]<<endl;
    }
   */cout <<levels[100]<<endl;
}

void printAdjList(vector<vector<int> > &adjList){
    cout <<"Inside printAdjList"<<endl;
    for(int i=1; i<=100;i++){
        cout<<"List "<<i<<" is:";
        for(int j=1;j<=6;j++){
            cout<<adjList[i][j]<<" -> ";
        }
        cout<<endl;
    }
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int T,N,M,A,B,ans; // T testcase, N ladders, M snakes
    map<int,int> ladder;
    map<int,int> snake;
    vector<vector<int> > adjList;
    adjList.resize(101);
    for(int i=0;i<=100;i++){
        adjList[i].resize(6);
    }
    cin >>T;
    while(T){
        cout << "T is "<<T<<endl;
        cin >>N;
        for(int i=0; i<=100;i++){
           adjList[i].clear();
        }
        cout << "After vector clear "<<endl;
        ladder.clear();
        snake.clear();
        cout << "After map clear "<<endl;
        adjList.resize(101);
        for(int i=0;i<=100;i++){
           adjList[i].resize(6);
        }
        cout << "N is "<<N<<endl;
        while(N){
            cin>>A>>B;
            ladder[A]=B;
            N--;
        }
        cin >>M;
        while(M){
            cin >> A >> B;
            snake[A]=B;
            M--;
        }
        adjacencyList(adjList,snake,ladder);
        //printAdjList(adjList);
        breadthFirstSearch(adjList,ans);
        T--;
        //cout << ans<<endl;
    }
    return 0;
}

My input is:
2
3
32 62
42 68
12 98
7
95 13
97 25
93 37
79 27
75 19
49 47
67 17
4
8 52
6 80
26 42
2 72
9
51 19
39 11
37 29
81 3
59 5
79 23
53 7
43 33
77 21


My output is 
T is 2
After vector clear 
After map clear 
N is 3
3
T is 1
After vector clear 

[helios]

What do you mean by "not work"?

[funprogrammer]

The expected output is

T is 2
After vector clear 
After map clear 
N is 3
3
T is 1
After vector clear
After map clear 
N is 5
5

My code is get stuck after 2nd "After vector clear". Something is wrong with these commands

 ladder.clear();
 snake.clear();

[helios]

Lines 21 and 24 cause buffer overflows. Should be

if(val<=100){
    adjList[i][j - 1]= val;
}
else{
    adjList[i][j - 1]=0;
}

Line 48 is also incorrect. Never iterate to <= the size() of a vector. Always up to <.

for(int j=1;j<adjList[i].size();j++)

That allows the program to terminate. I don't know if the results are correct or not.

As a rule of thumb, avoid for loops like for (int i = 1; i <= n; i++). Prefer the canonical for loop: for (int i = 0; i < n; i++).

[funprogrammer]

Thanks, those inputs were very helpful. My issue is fixed