zoukankan      html  css  js  c++  java
  • hdu5926Mr. Frog’s Game

    Mr. Frog’s Game

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 1300    Accepted Submission(s): 639


    Problem Description
    One day, Mr. Frog is playing Link Game (Lian Lian Kan in Chinese).



    In this game, if you can draw at most three horizontal or vertical head-and-tail-connected lines over the empty grids(the lines can be out of the whole board) to connect two non-empty grids with the same symbol or the two non-empty grids with the same symbol are adjacent, then you can change these two grids into empty and get several more seconds to continue the game.

    Now, Mr. Frog starts a new game (that means there is no empty grid in the board). If there are no pair of grids that can be removed together,Mr. Frog will say ”I’m angry” and criticize you.

    Mr. Frog is battle-scarred and has seen many things, so he can check the board in a very short time, maybe one second. As a Hong Kong Journalist, what you should do is to check the board more quickly than him, and then you can get out of the room before Mr. Frog being angry.
     

    Input
    The first line contains only one integer T (T500), which indicates the number of test cases.

    For each test case, the first line contains two integers n and m (1n,m30).

    In the next n lines, each line contains m integers,  j-th number in the i-th line means the symbol on the grid(the same number means the same symbol on the grid).
     

    Output
    For each test case, there should be one line in the output.

    You should output “Case #x: y”,where x is the case number(starting from 1), and y is a string representing the answer of the question. If there are at least one pair of grids that can be removed together, the y is “Yes”(without quote), else y is “No”.
     

    Sample Input
    2 3 3 1 2 1 2 1 2 1 2 1 3 3 1 2 3 2 1 2 3 2 1
     

    Sample Output
    Case #1: Yes Case #2: No
    Hint
    first sample can be explained as below.
     

    Source

    思路:暴力模拟,考虑边上跟相邻两种情况。

    #include<iostream>
    #include<map>
    using namespace std;
    
    int a[35][35];
    map<int,int> mp;
    int n,m;
    
    bool check(int i,int j)
    {
        if(i>=1&&i<=n&&j>=1&&j<=m) return true;
        return false;
    }
    
    int main()
    {
        int T;
        cin>>T;
        int flag;
        for(int cas=1;cas<=T;cas++)
        {
            flag=0;
            cin>>n>>m;
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=m;j++)
                {
                    cin>>a[i][j];
                }
            }
            mp.clear();
            for(int j=1;j<=m;j++)
            {
                mp[a[1][j]]++;
                if(mp[a[1][j]]>=2)
                {
                    cout<<"Case #"<<cas<<": Yes"<<endl;
                    flag=1;
                }
                if(flag) break;
            }
            if(flag) continue;
            mp.clear();
            for(int j=1;j<=m;j++)
            {
                mp[a[n][j]]++;
                if(mp[a[n][j]]>=2)
                {
                    cout<<"Case #"<<cas<<": Yes"<<endl;
                    flag=1;
                }
                if(flag) break;
            }
            if(flag) continue;
            mp.clear();
            for(int i=1;i<=n;i++)
            {
                mp[a[i][1]]++;
                if(mp[a[i][1]]>=2)
                {
                    cout<<"Case #"<<cas<<": Yes"<<endl;
                    flag=1;
                }
                if(flag) break;
            }
            if(flag) continue;
            mp.clear();
            for(int i=1;i<=n;i++)
            {
                mp[a[i][m]]++;
                if(mp[a[i][m]]>=2)
                {
                    cout<<"Case #"<<cas<<": Yes"<<endl;
                    flag=1;
                }
                if(flag) break;
            }
            if(flag) continue;
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=m;j++)
                {
                    if(check(i,j+1)&&a[i][j]==a[i][j+1]) flag=1;
                    if(check(i+1,j)&&a[i][j]==a[i+1][j]) flag=1;
                    if(flag) break;
                }
                if(flag) break;
            }
            if(flag) {cout<<"Case #"<<cas<<": Yes"<<endl;continue;}
            cout<<"Case #"<<cas<<": No"<<endl;
        }
        return 0;
    }




  • 相关阅读:
    LeetCoded第21题题解--合并两个有序链表
    入门数据结构与算法,看这一个就够了,知识点+LeetCode实战演练
    LeetCoded第242题题解--java--数组
    映射Map、队列Queue、优先级队列PriorityQueue
    链表LinkedList、堆栈Stack、集合Set
    bzoj1588: [HNOI2002]营业额统计
    bzoj3223: Tyvj 1729 文艺平衡树
    bzoj1503: [NOI2004]郁闷的出纳员
    hdu1700 Points on Cycle
    poj1981 Circle and Points
  • 原文地址:https://www.cnblogs.com/bryce1010/p/9387400.html
Copyright © 2011-2022 走看看