zoukankan      html  css  js  c++  java
  • ACM-ICPC 2018 徐州赛区网络预赛 F. Features Track

    Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extracts cat features in each frame. A cat feature is a two-dimension vector <xx, yy>. If x_ixi​= x_jxj​ and y_iyi​ = y_jyj​, then <x_ixi​, y_iyi​> <x_jxj​, y_jyj​> are same features.

    So if cat features are moving, we can think the cat is moving. If feature <aa, bb> is appeared in continuous frames, it will form features movement. For example, feature <aa , bb > is appeared in frame 2,3,4,7,82,3,4,7,8, then it forms two features movement 2-3-42−3−4 and 7-87−8 .

    Now given the features in each frames, the number of features may be different, Morgana wants to find the longest features movement.

    Input

    First line contains one integer T(1 le T le 10)T(1≤T≤10) , giving the test cases.

    Then the first line of each cases contains one integer nn (number of frames),

    In The next nn lines, each line contains one integer k_iki​ ( the number of features) and 2k_i2ki​ intergers describe k_iki​features in ith frame.(The first two integers describe the first feature, the 33rd and 44th integer describe the second feature, and so on).

    In each test case the sum number of features NN will satisfy N le 100000N≤100000 .

    Output

    For each cases, output one line with one integers represents the longest length of features movement.

    样例输入复制

    1
    8
    2 1 1 2 2
    2 1 1 1 4
    2 1 1 2 2
    2 2 2 1 4
    0
    0
    1 1 1
    1 1 1

    样例输出复制

    3

    题目来源

    ACM-ICPC 2018 徐州赛区网络预赛

    #include<iostream>
    #include<map>
    #include<queue>
    #include<stack>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    
    pair<int,int>a;
    map< pair<int,int> , pair<int,int> >mp;
    
    int main()
    {
    	int n,m,j,k,i,T,a,b;
    	cin>>T;
    	while (T--)
    	{
    		cin>>n;
    		int ans=-1;
    		for (i=1;i<=n;i++)
    		{
    			cin>>k;
    			for (j=1;j<=k;j++)
    			{
    				cin>>a>>b;
    				if (mp[pair<int,int>(a,b)].second ==i-1 )
    				mp[pair<int,int>(a,b)].first++;
    				else if (mp[pair<int,int>(a,b)].second ==i)
    				continue;
    				else
    				mp[pair<int,int>(a,b)].first = 1;
    				
    				ans = max(ans,mp[pair<int,int>(a,b)].first);
    				mp[pair<int,int>(a,b)].second = i;
    			}
    		}
    		cout<<ans<<endl;
    	}
    	return 0;	
    }
    
    
    
  • 相关阅读:
    论工作动力的来源是什么?答案是来自于实现自己的梦想
    向梦想者致敬
    内置函数,递归函数,模块与包,开发目录规范
    迭代器,生成器
    闭包函数,装饰器,语法糖
    函数对象,名称空间及查找,作用域
    函数调用与参数
    字符编码
    文件处理
    python 11.5数据类型及常用方法
  • 原文地址:https://www.cnblogs.com/Romantic-Chopin/p/12451425.html
Copyright © 2011-2022 走看看