201903-4 消息传递接口

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
const int maxn = 1e5 + 5;
struct Node {
    int x,z;
    char y;
};
int main() {
    int t,n;
    cin >> t >> n;
    while(t--) {
        queue<Node>q[n+1];
       for(int i = 0; i < n; i++) {
        while(!q[i].empty())
            q[i].pop();
       }
        for(int i = 0; i < n; i++) {
            string s;
            char c;
            while(cin >> s) {
                c = getchar();
                Node temp;
                temp.x = i;
                temp.y = s[0];
                temp.z = 0;
                for(int j = 1; j < s.length(); j++){
                    temp.z = temp.z*10 + s[j] - ‘0‘;
                }
                q[i].push(temp);
                if(c == ‘\n‘) {
                    break;
                }
            }
        }
        int flag = 0;
        int k = 0;
        while(1) {

            k = 0;
            for(int i = 0; i < n; i++){
            if(q[i].empty()) continue;
            Node temp = q[i].front();
            int x = temp.x;
            char y ;
            int z = temp.z;
            if(temp.y == ‘R‘)  y = ‘S‘;
            else y = ‘R‘;
            if(q[z].empty()) {
                flag = 1;
                break;
            }
            Node temp2 = q[z].front();
            if(temp2.z == x && temp2.y == y) {
                q[i].pop();
                q[z].pop();
                i--;
                k++;
            }
            else {
                continue;
            }
        }
        if(k == 0) break;
        }
        k = 0;
        for(int i = 0; i < n; i++) {
                if(!q[i].empty()){
                  flag = 1;
                  break;
                }
            }
        if(flag == 1) cout << 1 << endl;
        else cout << 0 <<endl;
    }
    return 0;
}