Submission #9700

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
9700	2014-09-28 08:10:28	hodduc	Solve another chuck (kriii2_S)	C++98	0 / 4	0 ms	1128 KiB

S

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
int R, C;
int map[101][101];
int main()
{
  int sum = 0;
  int count_zero = 0;
  int count_neg = 0;
  int max_neg = -1999999999;
  int min_pos = 1999999999;
  scanf("%d %d", &R, &C);
  for(int i = 1; i <= R; i++) for(int j = 1; j <= C; j++){
    scanf("%d", &map[i][j]);
    if(map[i][j] > 0) sum += map[i][j];
    else sum -= map[i][j];
    if(map[i][j] == 0) count_zero ++;
    if(map[i][j] < 0){
      count_neg ++;
      if(max_neg < map[i][j]) max_neg = map[i][j];
    }
    if(map[i][j] > 0){
      if(min_pos > map[i][j]) min_pos = map[i][j];
    }
  }
  if(count_zero != 0 || count_neg % 2 == 0 || R == 1 || C == 1)
    printf("%d 2\nrotC 1 1\nnegR 1\n", sum);
  else {
    if((max_neg * -1) > min_pos){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4