답안 #9700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
9700 2014-09-28T08:10:28 Z hodduc Solve another chuck (kriii2_S) C++
0 / 4
0 ms 1128 KB
#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){
//			sum -= min_pos * 2;
		} else {
//			sum += max_neg * 2;
		}
		printf("%d 2\nrotC 1 1\nnegR 1\n", sum);
	}

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 1128 KB Output is partially correct
2 Partially correct 0 ms 1128 KB Output is partially correct
3 Partially correct 0 ms 1128 KB Output is partially correct
4 Incorrect 0 ms 1128 KB Output isn't correct
5 Halted 0 ms 0 KB -