제출 #104936

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104936		eriksuenderhauf	Art Class (IOI13_artclass)	C++11	100 / 100	113 ms	3704 KiB

artclass

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "artclass.h"
//#include "grader.h"
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long int ll;
const double pi = acos(-1);
const int MOD = 1e9 + 9;
const int INF = 1e9 + 7;
const int MAXN = 3e5 + 5;
const double eps = 1e-9;

int style(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
	int cnt = h * (w - 1);
	int sm = 0;
	for (int i = 0; i < h; i++)
		for (int j = 0; j + 1 < w; j++)
			sm += abs(r[i][j] - r[i][j + 1]) + abs(g[i][j] - g[i][j + 1]) + abs(b[i][j] - b[i][j + 1]);
	if (sm / cnt < 9) return 4;
	if (sm / cnt < 23) return 1;
	if (sm / cnt < 54) return 2;
	return 3;
}

• Subtask 1: 100 / 100