Swapping letters

input/code.cpp: In function 'int main()':
input/code.cpp:41:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < x.size(); i++) {
                     ~~^~~~~~~~~~
input/code.cpp:65:9: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
         for(int p; p < m; p++){
         ^~~
input/code.cpp:72:20: warning: 'i4' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 i4 += 1;
                 ~~~^~~~
input/code.cpp:70:76: warning: 'i3' may be used uninitialized in this function [-Wmaybe-uninitialized]
             else if(x_letters[a][i1] > x_letters[b][i2] and y_letters[a][i3] > y_letters[b][i4]){
                                                                            ^
input/code.cpp:71:20: warning: 'i2' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 i2 += 1;
                 ~~~^~~~
input/code.cpp:66:31: warning: 'i1' may...

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;


void merge(vector<int>& nums1, vector<int>& nums2) {
    int m = nums1.size();
    int n = nums2.size();

    int last = m + n - 1;
    while (n) {
        if (m == 0) {
            nums1[last--] = nums2[--n];
        } else if (nums2[n-1] > nums1[m-1]) {
            nums1[last--] = nums2[--n];
        } else {
            nums1[last--] = nums1[--m];
        }
    }
}


int main() {
    int n;
    cin >> n;
    char forbids[n][2];
    for (int i = 0; i < n; i++)
        cin >> forbids[i][0] >> forbids[i][1];
    string x, y;
    cin >> x >> y;
    if(x.length() != y.length()){
        cout << "NO";
        return 0;
    }
    map<char, vector<int> > x_letters;
    map<char, vector<int> > y_letters;

    for (int i = 0; i < x.size(); i++) {
        x_letters[x[i]].push_back(i);
        y_letters[y[i]].push_back(i);
    }

    for (int i = 0; i < n; i++) {
        char a, b;
        a = forbids[i][0];
        b = forbids[i][1];
//        vector<int> x_ind_a, x_ind_b, y_ind_a, y_ind_b;
        int m = 0;
        m += x_letters[a].size();
        if(x_letters[a][-1] != 1000001){
            x_letters[a].push_back(1000001);
            y_letters[a].push_back(1000001);
        }

        m += x_letters[b].size();
        if(x_letters[b][-1] != 1000001){
            x_letters[b].push_back(1000001);
            y_letters[b].push_back(1000001);
        }

        int i1, i2, i3, i4;
        for(int p; p < m; p++){
            if(x_letters[a][i1] < x_letters[b][i2] and y_letters[a][i3] < y_letters[b][i4]){
                i1 += 1;
                i3 += 1;
            }
            else if(x_letters[a][i1] > x_letters[b][i2] and y_letters[a][i3] > y_letters[b][i4]){
                i2 += 1;
                i4 += 1;
            }
            else{
                cout<<"NO";
                return 0;
            }
        }
    }
    cout << "YES";
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED