h= input()
a= input()
ad, hd = dict(), dict()
sa, sh = set(), set()
for _ in range(int(input())):
t, n, p, f = input().split()
if f == 'y' and n =='h':
if p in hd and p not in sh:
hd[p] += 1
if hd[p] == 2:
sh.add(p)
print(h, p, t)
else:
hd[p] = 1
if f == 'y' and n =='a':
if p in ad and p not in sa:
ad[p] += 1
if ad[p] == 2:
sa.add(p)
print(a, p, t)
else:
ad[p] = 1
if f=='r' and n == 'a' and p not in sa:
sa.add(p)
print(a, p, t)
if f=='r' and n=='h' and p not in sh:
sh.add(p)
print(h, p, t)
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string homeTeam, awayTeam;
cin >> homeTeam >> awayTeam;
int n;
cin >> n;
map<int , int > yellowCardsHOME;
map<int , int > yellowCardsAWAY;
set <int> firedHOME;
set <int> firedAWAY;
for (int i = 0; i < n; i++) {
int time, player ;
char team;
char card;
cin >> time >> team >> player >>card;
if (team == 'h') {
if ( (card == 'r' || (card == 'y' && yellowCardsHOME[player] == 1 )) && firedHOME.find(player) == firedHOME.end()){
cout << homeTeam << " " << player << " " << time << endl;
firedHOME.insert(player);
} else {
yellowCardsHOME[player]++;
}
} else {
if ( (card == 'r' || (card == 'y' && yellowCardsAWAY[player] == 1 )) && firedAWAY.find(player) == firedAWAY.end()) {
cout << awayTeam << " " << player << " " << time << endl;
firedAWAY.insert(player);
} else {
yellowCardsAWAY[player]++;
}
}
}
}
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |
1542B - Plus and Multiply | 306A - Candies |
1651C - Fault-tolerant Network | 870A - Search for Pretty Integers |
1174A - Ehab Fails to Be Thanos | 1169A - Circle Metro |
780C - Andryusha and Colored Balloons | 1153A - Serval and Bus |
1487C - Minimum Ties | 1136A - Nastya Is Reading a Book |
1353B - Two Arrays And Swaps | 1490E - Accidental Victory |