锘??xml version="1.0" encoding="utf-8" standalone="yes"?>
#include <stdio.h>
#include <stdlib.h>
#define MAX 1001
#define OK 1
int tag[MAX]; //灝嗗嚭鐜頒簡(jiǎn)絳夊彿鐨?鍗崇湡甯?鎺掗櫎 鏍囪涓? 閬嶅巻鏃惰煩榪?nbsp;
int num[MAX]; //璁板綍涓嬫爣涓篿鐨勭‖甯佸湪涓嶇瓑寮忕殑涓よ竟鍑虹幇鐨勬鏁?nbsp;
int main ()
{
int coin[MAX]; //璁塊棶鏃朵笅鏍囩殑涓粙
int N, k, pi, count ;
char c;
while ( scanf ("%d%d", &N, &k) != EOF )
{
count = 0; //璁板綍鎺ヤ笅鏉ョ殑 k 嬈$О閲忎腑鏈夊灝戞鍑虹幇浜?jiǎn)涓嵔{夊彿
for ( int i = 0; i < k; i ++) // k 嬈$殑縐伴噺璁板綍
{
scanf ("%d", &pi);
for (int j = 0; j < 2 * pi; j ++)
{
scanf ("%d", &coin[j]);
}
getchar ();
c = getchar ();
for (int i = 0; i < 2 * pi; i ++)
{
if (c == '=')
tag[coin[i]] = 1;
else if (c == '<')
{
count ++;
for (int j = 0; j < pi; j ++)
{
num[coin[j]]--;
}
for (int j = pi; j < 2 * pi; j++)
{
num[coin[j]]++;
}
}
else
{
count ++;
for (int j = 0; j < pi; j ++)
{
num[coin[j]]++;
}
for (int j = pi; j < 2 * pi; j++)
{
num[coin[j]]--;
}
}
}
}
int mark = 0;
int temp ;
for (int i = 1; i <= N; i ++)
{
if (tag[i] == 1) //琛ㄧず涓虹湡甯侊紝涓嶅彲鑳?nbsp;
continue;
if (num[i] == count || num[i] == -count) //濡傛灉紜竵鍦ㄤ笉絳夊紡鐨勪袱杈瑰嚭鐜扮殑嬈℃暟絳変簬涓嶇瓑鍙鋒暟涓哄亣甯?nbsp;
{
mark ++;
temp = i;
}
}
if (mark == 1) // 鍋囧竵鍙湁涓涓?nbsp;
{
printf ("%d\n", temp);
}
else
printf ("%d\n",0);
}
return 0;
}
]]>