//滚动数组思想
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
struct NODE
{
int x,y;
bool operator < (const NODE &b)const
{
if(x==b.x)return y<b.y;
else return x<b.x;
}
};
using namespace std;
int main()
{
int t;
map<NODE,int> mp1,mp2;
scanf("%d",&t);
while(t--)
{
priority_queue<int> q;
while(!q.empty())q.pop();
mp1.clear(); mp2.clear();
int num;
scanf("%d",&num);
int k;
for(int j=0;j<num;j++)
{
int a,b;
NODE tp;
scanf("%d",&k);
for(int i=0;i<k;i++)
{
scanf("%d%d",&a,&b);
tp.x=a,tp.y=b;
if( j%2==0 )
{
if(mp1[tp]!=0)
mp2[tp]=mp1[tp]+1;
else mp2[tp]=1;
q.push(mp2[tp]);
}else {
if(mp2[tp]!=0)
mp1[tp]=mp2[tp]+1;
else mp1[tp]=1;
q.push(mp1[tp]);
}
}
if( j%2==0 )
mp1.clear();
else mp2.clear();
}
int ans=q.top();
printf("%d\n",ans);
}
return 0;
}
ACM-ICPC 2018 徐州赛区网络预赛F. Features Track
猜你喜欢
转载自blog.csdn.net/qq_41603898/article/details/82559191
今日推荐
周排行