zoukankan      html  css  js  c++  java
  • Codeforces Round #194 (Div. 2) D. Chips

    D. Chips
    time limit per test:1 second
    memory limit per test:256 megabytes
    input:standard input
    output:standard output

    Gerald plays the following game. He has a checkered field of size n × n cells, where m various cells are banned. Before the game, he has to put a few chips on some border (but not corner) board cells. Then forn - 1 minutes, Gerald every minute moves each chip into an adjacent cell. He moves each chip from its original edge to the opposite edge. Gerald loses in this game in each of the three cases:

    • At least one of the chips at least once fell to the banned cell.
    • At least once two chips were on the same cell.
    • At least once two chips swapped in a minute (for example, if you stand two chips on two opposite border cells of a row with even length, this situation happens in the middle of the row).

    In that case he loses and earns 0 points. When nothing like that happened, he wins and earns the number of points equal to the number of chips he managed to put on the board. Help Gerald earn the most points.

    Input

    The first line contains two space-separated integers n andm (2 ≤ n ≤ 1000,0 ≤ m ≤ 105) — the size of the field and the number of banned cells. Nextm lines each contain two space-separated integers. Specifically, thei-th of these lines contains numbersxi andyi (1 ≤ xi, yin) — the coordinates of thei-th banned cell. All given cells are distinct.

    Consider the field rows numbered from top to bottom from 1 to n, and the columns — from left to right from 1 to n.

    Output

    Print a single integer — the maximum points Gerald can earn in this game.

    Sample test(s)
    Input
    3 1
    2 2
    
    Output
    0
    
    Input
    3 0
    
    Output
    1
    
    Input
    4 3
    3 1
    3 2
    3 3
    
    Output
    1
    
    Note

    In the first test the answer equals zero as we can't put chips into the corner cells.

    In the second sample we can place one chip into either cell (1, 2), or cell (3, 2), or cell (2, 1), or cell (2, 3). We cannot place two chips.

    In the third sample we can only place one chip into either cell (2, 1), or cell (2, 4).

      先按照没有阻挡的时候找到规律,然后去掉那些带阻挡的行或列

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #define N 1100
    using namespace std;
    bool row[N],col[N];
    int main()
    {
        int n,m;
        while(scanf("%d %d",&n,&m)!=EOF)
        {
            memset(row,true,sizeof(row));
            memset(col,true,sizeof(col));
            while(m--)
            {
                int x,y;
                scanf("%d %d",&x,&y);
                row[x] = false;
                col[y] = false;
            }
            int res = 0;
            for(int i=2;i<=n-1;i++)
            {
                if(n%2&&i==n/2+1)
                {
                    continue;
                }
                if(col[i])
                {
                    res++;
                }
                if(row[i])
                {
                    res++;
                }
            }
            if(n%2&&(col[n/2+1]||row[n/2+1]))
            {
                res++;
            }
            printf("%d
    ",res);
        }
        return 0;
    }
    


  • 相关阅读:
    报错:require_once cannot allocate memory----php,以前自己弄的稍微有点特殊的开发环境
    wget下载整个网站---比较实用--比如抓取Smarty的document
    Linux必须会的命令---也是以前记录的,ctrl+z fg 啥的 jobs 比较实用
    最全的ORACLE-SQL笔记
    UML十四图打油诗记忆法
    Spring整合Hibernate总结
    MyEclipse6.5优化
    windows XP 各个文件夹详细介绍
    hibernate所需jar包
    struts2所需的jar包
  • 原文地址:https://www.cnblogs.com/aukle/p/3223801.html
Copyright © 2011-2022 走看看