Codeforces Round #140 (Div. 1)D The table 贪心
来源:互联网 发布:算法第四版pdf 86mb 编辑:程序博客网 时间:2024/06/05 03:40
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std ;
const int maxn = 110 ;
int sum_r[maxn] ;
int sum_c[maxn] ;
int vis_c[maxn] ;int vis_r[maxn] ;
int ans_c[maxn] ;int ans_r[maxn] ;
int table[maxn][maxn] ;
void init()
{
memset(sum_r , 0 , sizeof(sum_r)) ;
memset(sum_c , 0 , sizeof(sum_c)) ;
memset(ans_r , 0 , sizeof(ans_r)) ;
memset(ans_c , 0 , sizeof(ans_c)) ;
}
int main()
{
int n , m ;
while(~scanf("%d %d" ,&n , &m))
{
init() ;
int flag = 1;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m ;j++)
{
scanf("%d" ,&table[i][j]) ;
sum_r[i] += table[i][j] ;
sum_c[j] +=table[i][j] ;
}
while(1)
{
int flag = 0;
for(int i = 1; i <= n;i++)
if(sum_r[i] < 0)
{
ans_r[i] ++ ;
flag = 1;
sum_r[i] = -sum_r[i];
for(int j = 1; j <= m;j++)
sum_c[j] -= 2*table[i][j] , table[i][j] = -table[i][j];
}
for(int j = 1; j <= m;j++)
if(sum_c[j] < 0)
{
ans_c[j]++ ;
flag = 1;
sum_c[j] = -sum_c[j] ;
for(int i = 1;i <= n;i++)
sum_r[i] -= 2*table[i][j] ,table[i][j] = -table[i][j] ;
}
if(!flag) break ;
}
int sumr = 0 ,sumc = 0;
for(int i = 1;i <= max(n, m);i++)
{
ans_c[i]%=2;ans_r[i]%=2;
if(ans_c[i])sumc++;
if(ans_r[i])sumr++;
}
printf("%d",sumr);
for(int i = 1;i <= n;i++)
if(ans_r[i])printf(" %d", i) ;
printf("\n%d",sumc);
for(int j = 1;j <= m;j++)
if(ans_c[j])printf(" %d",j) ;
puts("") ;
}
return 0;
}
#include<cstdio>
#include<cstring>
using namespace std ;
const int maxn = 110 ;
int sum_r[maxn] ;
int sum_c[maxn] ;
int vis_c[maxn] ;int vis_r[maxn] ;
int ans_c[maxn] ;int ans_r[maxn] ;
int table[maxn][maxn] ;
void init()
{
memset(sum_r , 0 , sizeof(sum_r)) ;
memset(sum_c , 0 , sizeof(sum_c)) ;
memset(ans_r , 0 , sizeof(ans_r)) ;
memset(ans_c , 0 , sizeof(ans_c)) ;
}
int main()
{
int n , m ;
while(~scanf("%d %d" ,&n , &m))
{
init() ;
int flag = 1;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m ;j++)
{
scanf("%d" ,&table[i][j]) ;
sum_r[i] += table[i][j] ;
sum_c[j] +=table[i][j] ;
}
while(1)
{
int flag = 0;
for(int i = 1; i <= n;i++)
if(sum_r[i] < 0)
{
ans_r[i] ++ ;
flag = 1;
sum_r[i] = -sum_r[i];
for(int j = 1; j <= m;j++)
sum_c[j] -= 2*table[i][j] , table[i][j] = -table[i][j];
}
for(int j = 1; j <= m;j++)
if(sum_c[j] < 0)
{
ans_c[j]++ ;
flag = 1;
sum_c[j] = -sum_c[j] ;
for(int i = 1;i <= n;i++)
sum_r[i] -= 2*table[i][j] ,table[i][j] = -table[i][j] ;
}
if(!flag) break ;
}
int sumr = 0 ,sumc = 0;
for(int i = 1;i <= max(n, m);i++)
{
ans_c[i]%=2;ans_r[i]%=2;
if(ans_c[i])sumc++;
if(ans_r[i])sumr++;
}
printf("%d",sumr);
for(int i = 1;i <= n;i++)
if(ans_r[i])printf(" %d", i) ;
printf("\n%d",sumc);
for(int j = 1;j <= m;j++)
if(ans_c[j])printf(" %d",j) ;
puts("") ;
}
return 0;
}
0 0
- Codeforces Round #140 (Div. 1)D The table 贪心
- [构造] Codeforces 226D #140 (Div. 1) D. The table
- Codeforces Round #378 (Div. 2) D. Kostya the Sculptor【贪心】
- 【Codeforces Round #196 (Div. 1)】Codeforces 338D GCD Table
- Codeforces Round #276 (Div. 1)D(贪心+dp)
- Codeforces Round #309 (Div. 1) D. Nudist Beach 二分 贪心
- 【贪心】Codeforces Round #339 (Div. 2) D
- Codeforces Round #351 Div. 2 D 贪心
- Codeforces Round #303 (Div. 2) D 贪心
- Codeforces Round #378 (Div. 2) D 贪心
- Codeforces 226D The table 贪心
- Codeforces Round #250 (Div. 1) D. The Child and Sequence
- Codeforces Round #250 (Div. 1) D. The Child and Sequence
- Codeforces Round #124 (Div. 1) D. The Next Good String
- Codeforces Round #397(Div. 1 + Div. 2 combined)C. Table Tennis Game 2【贪心】
- Codeforces Round #273 (Div. 2) C.Table Decorations 贪心
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- 杭电ACM 2010: 水仙花数
- Android SDK开发包国内下载地址
- node.js框架StrongLoop学习笔记(一)
- 2013计算机视觉代码合集
- 递归的一点思考
- Codeforces Round #140 (Div. 1)D The table 贪心
- Java异常及异常块执行次序(try、catch、finally、return)
- poj2991
- Python基础
- 端口占用
- NSScanner
- ecllipse make all 命令语法不正确。
- oc的kvc和kvo
- Project Euler Problem 9