Codeforces Round #281 (Div. 2) - A

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100;
struct node{
int y,r;
node():y(0),r(0){}
};
node cnt[2][maxn];
int vis[2][maxn];
char str[2][maxn];
int main()
{
    gets(str[0]);
    gets(str[1]);
    int n;
    cin>>n;
    char ff,pai;
    int id,t;
    for(int i=1;i<=n;i++){
        cin>>t>>ff>>id>>pai;
        int team = ff=='h' ? 0 : 1;
        pai =='y' ? cnt[team][id].y++:cnt[team][id].r++;
        if(cnt[team][id].y==2){ //最重要的判断条件搞错了
              cnt[team][id].y=0;
              cnt[team][id].r++;
        }
        if(cnt[team][id].r==1 && !vis[team][id]){
                vis[team][id]=1;
              cout<<str[team]<<" "<<id<<" "<<t<<endl;
        }
    }
    return 0;
}