UVALive 7512November 11th
来源:互联网 发布:东德知乎 编辑:程序博客网 时间:2024/06/05 15:51
题意:
给出一个矩阵,已知若干点是坏的, 安排座位,两两不能相邻。询问座位可以容纳最多或者最少的人。
思路:
最多的话就从边上开始占 X.X 最少的话就.X.
#include <iostream>#include <stdio.h>#include <algorithm>#include <cstring>using namespace std;int mp[1005][1005];int main(){ int t; scanf("%d",&t); int n,m; for(int cs=1; cs<=t; cs++) { scanf("%d%d",&n,&m); memset(mp,0,sizeof mp); int k; scanf("%d",&k); while(k--) { int x,y; scanf("%d%d",&x,&y); x++, y++; mp[x][y]=1; } int num=0; int maxx=0,minn=0; for(int i=1;i<=n;i++) { num=0; for(int j=1;j<=m;j++) { if(mp[i][j]==1) { maxx+=num/3+(!(num%3==0)); num=0; } else num++; } maxx+=num/3+(num%3!=0); } for(int i=1;i<=n;i++) { num=0; for(int j=1;j<=m;j++) { if(mp[i][j]==1) { minn+=num/2+(num%2!=0); num = 0; } else num++; } minn+=num/2+(num%2!=0); } printf("Case #%d: ",cs); printf("%d %d\n",minn,maxx); } return 0;}
阅读全文
0 0
- UVALive 7512 November 11th
- UVALive 7512 November 11th
- UVALive 7512November 11th
- UVALive-7512-November 11th
- November 11th UVALive
- UVALive 7512 November 11th(脑洞)
- ECfinal UVALive 7512 November 11th (公式)
- UVALive 7512 November 11th(模拟, 思维)
- November 11th Wednesday
- UVA7512 November 11th (思路)
- November 3th Tuesday
- November 5th Thursday
- November 9th Monday
- November 12th Thursday
- November 13th Friday
- November 14th Saturday
- November 15th Sunday
- November 16th Monday
- 图像工程的三个层次
- 文章标题 商品列表 angularJs实现
- 初学者---Android 常用依赖,权限
- DrawerLayout
- xlistView
- UVALive 7512November 11th
- 欢迎使用CSDN-markdown编辑器
- pyspark-DataFrame API
- OkHttp
- RabbitMQ基础概念介绍
- UVALive 7511Multiplication Table
- 手机触摸事件
- C语言实验——Hello World!(printf练习)
- python爬取自己博客访问量