zoukankan      html  css  js  c++  java
  • 8VC Venture Cup 2016

    A. Orchestra
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Paul is at the orchestra. The string section is arranged in an r × c rectangular grid and is filled with violinists with the exception of n violists. Paul really likes violas, so he would like to take a picture including at least k of them. Paul can take a picture of any axis-parallel rectangle in the orchestra. Count the number of possible pictures that Paul can take.

    Two pictures are considered to be different if the coordinates of corresponding rectangles are different.

    Input

    The first line of input contains four space-separated integers r, c, n, k (1 ≤ r, c, n ≤ 10, 1 ≤ k ≤ n) — the number of rows and columns of the string section, the total number of violas, and the minimum number of violas Paul would like in his photograph, respectively.

    The next n lines each contain two integers xi and yi (1 ≤ xi ≤ r, 1 ≤ yi ≤ c): the position of the i-th viola. It is guaranteed that no location appears more than once in the input.

    Output

    Print a single integer — the number of photographs Paul can take which include at least k violas.

    Examples
    Input
    2 2 1 1
    1 2
    Output
    4
    Input
    3 2 3 3
    1 1
    3 1
    2 2
    Output
    1
    Input
    3 2 3 2
    1 1
    3 1
    2 2
    Output
    4
    Note

    We will use '*' to denote violinists and '#' to denote violists.

    In the first sample, the orchestra looks as follows


    *#
    **
    Paul can take a photograph of just the viola, the 1 × 2 column containing the viola, the 2 × 1 row containing the viola, or the entire string section, for 4 pictures total.

    In the second sample, the orchestra looks as follows


    #*
    *#
    #*
    Paul must take a photograph of the entire section.

    In the third sample, the orchestra looks the same as in the second sample.

     题意: r*c的矩阵  n个位置特殊 并给出坐标  问能取多少个子矩阵使得其中特殊位置的个数最小为k

     题解: 暴力 矩阵最多10*10  子矩阵 数量很小   (水)

     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 #include<map>
     5 using namespace std;
     6 int r,c,n,k;
     7 int mp[15][5];
     8 int main()
     9 {
    10     scanf("%d %d %d %d",&r,&c,&n,&k);
    11     for(int i=1; i<=n; i++)
    12         scanf("%d %d",&mp[i][0],&mp[i][1]);
    13     int re=0;
    14     for(int i=1; i<=r; i++)
    15     {
    16         for(int j=1; j<=c; j++)
    17         {
    18             for(int kk=i; kk<=r; kk++)
    19             {
    20                 for(int g=j; g<=c; g++)
    21                 {
    22                     int jishu=0;
    23                     for(int m=1; m<=n; m++)
    24                     {
    25                         if(mp[m][0]<=kk&&mp[m][0]>=i&&mp[m][1]<=g&&mp[m][1]>=j)
    26                             jishu++;
    27                     }
    28                     if(jishu>=k)
    29                         re++;
    30                 }
    31             }
    32         }
    33     }
    34     printf("%d
    ",re);
    35     return 0;
    36 }
    View Code
  • 相关阅读:
    快速搭建一个本地的FTP服务器
    Node.js安装及环境配置之Windows篇
    在win10上安装oracle10g
    win10安装oracle11g客户端
    解决:Java source1.6不支持diamond运算符,请使用source 7或更高版本以启用diamond运算符
    idea 右侧 无 meven 菜单
    idea导入maven项目不能识别pom.xml文件解决办法
    PostgresSQL客户端pgAdmin4使用
    PostgreSQL 创建数据库
    PostgreSQL 数据类型
  • 原文地址:https://www.cnblogs.com/hsd-/p/5264058.html
Copyright © 2011-2022 走看看