TLE/RE 求调

#include<bits/stdc++.h>
using namespace std;
int l[110], r[110], f[110], lv[110], n;
queue<int> p, q, s;
void clear(){
    while(!p.empty()) p.pop();
    while(!q.empty()) q.pop();
    while(!s.empty()) s.pop();
}
int bfs1(){
    clear();
    p.push(1); q.push(1); lv[1]++; int ans = 0; 
    while(!p.empty()){
        ans = max(ans, q.front());
        if(l[p.front()]){
            p.push(l[p.front()]), q.push(q.front() + 1);
            lv[q.front() + 1]++;
        }
        if(r[p.front()]){
            p.push(r[p.front()]), q.push(q.front() + 1);
            lv[q.front() + 1]++;
        }
        p.pop(), q.pop();
    }
    cout << ans << endl;
    ans = 0;
    for(int i = 1; i <= n; i++) ans = max(ans, lv[i]);
    cout << ans << endl;
}
int bfs2(int x, int y){
    clear();
    p.push(x); q.push(0); s.push(0);
    while(!p.empty()){
        if(p.front() == y) return q.front();
        if(s.front() != f[p.front()] && f[p.front()]){
            p.push(f[p.front()]);
            q.push(q.front() + 2); 
            s.push(p.front());
        }
        if(s.front() != l[p.front()] && l[p.front()]){
            p.push(l[p.front()]);
            q.push(q.front() + 1); 
            s.push(p.front());
        }
        if(s.front() != r[p.front()] && r[p.front()]){
            p.push(r[p.front()]);
            q.push(q.front() + 1); 
            s.push(p.front());
        }
        p.pop(); q.pop(), s.pop();
    }
}
int main(){
    int u, v;
    cin >> n;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        if(l[u]) r[u] = v;
        else l[u] = v;
        f[v] = u;
    }
    cin >> u >> v;
    bfs1();
    cout << bfs2(u, v);
}