제출 #301124

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301124		BlancaHM	미술 수업 (IOI13_artclass)	C++14	8 / 100	77 ms	6136 KiB

artclass

#include <cmath>
#include "artclass.h"
using namespace std;
 
int diffValue(int H, int W, int red[500][500], int green[500][500], int blue[500][500]) {
	int ans = 0;
	for (int i = 1; i < 500; i++) {
		ans += abs(red[0][i] - red[0][i-1]);
		ans += abs(red[i][0] - red[i-1][0]);
		ans += abs(green[0][i] - green[0][i-1]);
		ans += abs(green[i][0] - green[i-1][0]);
		ans += abs(blue[0][i] - blue[0][i-1]);
		ans += abs(blue[i][0] - blue[i-1][0]);
	}
	for (int i = 1; i < 500; i++) {
		for (int j = 1; j < 500; j++) {
			ans += abs(red[i][j] - red[i][j-1]);
			ans += abs(red[i][j] - red[i-1][j]);
			ans += abs(green[i][j] - green[i][j-1]);
			ans += abs(green[i][j] - green[i-1][j]);
			ans += abs(blue[i][j] - blue[i][j-1]);
			ans += abs(blue[i][j] - blue[i-1][j]);
		}
	}
	return ans;
}
 
int vertValue(int H, int W, int red[500][500], int green[500][500], int blue[500][500]) {
	int ans = 0;
	for (int i = 1; i < 500; i++) {
		ans += abs(red[i][0] - red[i-1][0]);
		ans += abs(green[i][0] - green[i-1][0]);
		ans += abs(blue[i][0] - blue[i-1][0]);
	}
	for (int i = 1; i < 500; i++) {
		for (int j = 1; j < 500; j++) {
			ans += abs(red[i][j] - red[i-1][j]);
			ans += abs(green[i][j] - green[i-1][j]);
			ans += abs(blue[i][j] - blue[i-1][j]);
		}
	}
	return ans;
}
 
int horiValue(int H, int W, int red[500][500], int green[500][500], int blue[500][500]) {
	int ans = 0;
	for (int i = 1; i < 500; i++) {
		ans += abs(red[0][i] - red[0][i-1]);
		ans += abs(green[0][i] - green[0][i-1]);
		ans += abs(blue[0][i] - blue[0][i-1]);
	}
	for (int i = 1; i < 500; i++) {
		for (int j = 1; j < 500; j++) {
			ans += abs(red[i][j] - red[i][j-1]);
			ans += abs(green[i][j] - green[i][j-1]);
			ans += abs(blue[i][j] - blue[i][j-1]);
		}
	}
	return ans;
}
 
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
	int val = diffValue(H, W, R, G, B);
	if (val >= 25000000) return 3;
	val = horiValue(H, W, R, G, B);
	if (val >= 6500000) return 2;
	val = vertValue(H, W, R, G, B);
	if (val <= 2500000) return 1;
	else return 4;
}

• Subtask 1: 8 / 100