제출 #554168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554168		elazarkoren	Art Class (IOI13_artclass)	C++17	100 / 100	67 ms	3292 KiB

artclass

#include "artclass.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int infinity = 1e9;

struct Style{
    int red, green, blue, gray, diff;
    Style() {}
    Style(int r, int g, int b, int gr, int diff): red(r), green(g), blue(b), gray(gr), diff(diff) {}
    double Close(int r, int g, int b, int gr) {
        return sqrt((r - red) * (r - red) + (g - green) * (g - green) + (b - blue) * (b - blue) + (gr - gray) * (gr - gray));
//        return abs(r - red) + abs(g - green) + abs(b - blue) + abs(gr - gray);
    }
    bool Ok2(int r, int g, int b, int gr) {
        return Close(r, g, b, gr) <= diff * 1.4;
    }
    bool Ok(int r, int g, int b, int gr) {
        return Close(r, g, b, gr) <= diff * 1.4;
    }
};

Style s[] = {Style(), Style(146, 166, 146, 167, 61), Style(67, 97, 63, 87, 44), Style(106, 128, 106, 124, 51), Style(54, 89, 54, 100, 132)};

const int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};

int style(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
    double sum_r = 0, sum_g = 0, sum_b = 0, gray_scale = 0, diff = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            sum_r += r[i][j], sum_g += g[i][j], sum_b += b[i][j];
            gray_scale += (r[i][j] + g[i][j] + b[i][j]) / 3;
            for (int d = 0; d < 4; d++) {
                int nx = i + dx[d], ny = j + dy[d];
                if (0 <= nx && nx < h && 0 <= ny && ny < w) {
                    diff += abs(r[i][j] + b[i][j] + g[i][j] - r[nx][ny] - b[nx][ny] - g[nx][ny]);
                }
            }
        }
    }
    sum_r /= (h * w);
    sum_g /= (h * w);
    sum_b /= (h * w);
    gray_scale /= (h * w);
    diff /= 4 * (h * w);
    if (diff >= 50) return 3;
    if (diff <= 8) return 4;
    vi v = {1, 2};
    pair<double, int> ans = {infinity, 0};
    /*int count = 0;
    for (int i = 1; i <= 3; i++) {
        if (s[i].Ok2(sum_r, sum_g, sum_b, gray_scale)) count++;
    }
    if (!count) return 4;*/
    for (int i : v) {
        //if (s[i].Ok(sum_r, sum_g, sum_b, gray_scale)) {
            pair<double, int> q = {s[i].Close(sum_r, sum_g, sum_b, gray_scale), i};
            chkmin(ans, q);
        //}
    }
    return ans.y;
}

• Subtask 1: 100 / 100