计蒜客 ACM-ICPC 2018 徐州赛区网络预赛 F. Features Track(unordered_map+模拟)

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Tony5t4rk/article/details/82596508

文章地址:http://henuly.top/?p=869

Description:

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 <x, y>. If xi = xj and yi = yj, then <xi, yi> <xj, yj> are same features.

So if cat features are moving, we can think the cat is moving. If feature <a, b> is appeared in continuous frames, it will form features movement. For example, feature <a , b > is appeared in frame 2,3,4,7,8, then it forms two features movement 234 and 78 .

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(1T10) , giving the test cases.

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

In The next n lines, each line contains one integer ki ( the number of features) and 2ki intergers describe ki features in ith frame.(The first two integers describe the first feature, the 3rd and 4th integer describe the second feature, and so on).

In each test case the sum number of features N will satisfy N100000 .

Output:

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

Sample Input:

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

Sample Output:

3

题目链接

每一帧有k个动作,每个动作有两个属性,当且仅当两个属性都相同时动作相同,求动作最大连续帧数。

使用两个unordered_map(不需要有序),key为动作,value为连续帧数,两个map循环更新每一帧所有动作的连续帧数,维护最大值。

AC代码:

#include <bits/stdc++.h>
using namespace std;

struct Vector {
    long long X, Y;
    bool operator == (const Vector &A) const {
        return A.X == X && A.Y == Y;
    }
};

struct Hash {
    size_t operator() (const Vector &A) const {
        return hash<long long>()(A.X) + hash<long long>()(A.Y);
    }
};

unordered_map<Vector, long long, Hash> mp[3];

int main(int argc, char *argv[]) {
    int T;
    scanf("%d", &T);
    for (int Case = 1, N; Case <= T; ++Case) {
        scanf("%d", &N);
        long long Ans = -1;
        for (long long i = 0, K; i < N; ++i) {
            scanf("%lld", &K);
            if (i == 0) {
                mp[1].clear();
                for (long long j = 0, X, Y; j < K; ++j) {
                    scanf("%lld%lld", &X, &Y);
                    mp[1].emplace(Vector{X, Y}, 1);
                }
                Ans = 1;
            }
            else if (i & 1) {
                mp[2].clear();
                for (long long j = 0, X, Y; j < K; ++j) {
                    scanf("%lld%lld", &X, &Y);
                    if (mp[1].find(Vector{X, Y}) != mp[1].end()) {
                        long long Temp = mp[1][Vector{X, Y}] + 1;
                        mp[2].emplace(Vector{X, Y}, Temp);
                        Ans = max(Ans, Temp);
                    }
                    else {
                        mp[2].emplace(Vector{X, Y}, 1);
                    }
                }
            }
            else {
                mp[1].clear();
                for (long long j = 0, X, Y; j < K; ++j) {
                    scanf("%lld%lld", &X, &Y);
                    if (mp[2].find(Vector{X, Y}) != mp[2].end()) {
                        long long Temp = mp[2][Vector{X, Y}] + 1;
                        mp[1].emplace(Vector{X, Y}, Temp);
                        Ans = max(Ans, Temp);
                    }
                    else {
                        mp[1].emplace(Vector{X, Y}, 1);
                    }
                }
            }
        }
        printf("%lld\n", Ans);
    }
    return 0;
}
阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页