图书借阅问题（栈和队列）

Question

图书借阅问题
问题如下图：为什么ac不了啊，尝试了很多测试用例，都是正确的，但是ac不过

#include <queue>
#include <stack>
#include<iostream>
using namespace std;
int main()
{
    stack<int> s;
    queue<int> q;
    int n, m, r;
    int queue[31], b[31], c[31];
    scanf_s("%d %d", &n, &m);
    //cin >> n >> m;
    while (m--)
    {
        for (int i = 0; i < n; i++)
        {
            scanf_s("%d", &queue[i]);
            //cin >> queue[i];
            q.push(queue[i]);
        }
        scanf_s("%d", &r);
        //cin >> r;
        for (int j = 0; j < r; j++)
        {
            scanf_s("%d", &b[j]);
            //cin >> b[j];
        }
        int bj = 0;
        for (int k = 1; k <= n; k++)
        {
            s.push(k);
            while (!s.empty() && s.top() == q.front())
            {
                s.pop();
                q.pop();
            }
            if (s.empty())
            {
                c[bj] = k + 1;
                bj++;
            }
        }
        int flag = 1;
        if (r != bj - 1)
        {
            flag = 0;
        }
        else if (s.empty())
        {
            for (int l = 0; l < r; l++)
            {
                if (b[l] != c[l])
                {
                    flag = 0;
                    break;
                }
            }
        }
        if (flag == 1)
        {
            cout << "Yes" << endl;
        }
        else
        {
            cout << "No" << endl;
        }
    }
}

Answer 1

已解决，加了清空栈和队列语句就对了