제출 #38355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
38355		funcsr	Art Class (IOI13_artclass)	C++14	65 / 100	768 ms	6892 KiB

artclass

#include "artclass.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <string>
#include <cassert>
#include <tuple>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define pb push_back
#define INF 1005141919
#define _1 first
#define _2 second

#define s(x, y) (R[y][x]+G[y][x]+B[y][x])
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
  int sum = 0, sum_green = 0;
  const int C = 50;
  vector<tuple<int, int, int>> colors;
  rep(y, H) rep(x, W) {
    sum += R[y][x];
    sum += G[y][x];
    sum += B[y][x];
    sum_green += G[y][x];
    colors.pb(make_tuple(R[y][x]/C, G[y][x]/C, B[y][x]/C));
  }
  sort(all(colors)); uniq(colors);
  if (colors.size() <= 25) return 4;
  sum/=W*H;
  sum/=3;
  sum_green/=W*H;
  /*
  int tate_diff = 0, yoko_diff = 0;
  rep(y, H-1) rep(x, W-1) {
    tate_diff += abs(s(x, y+1)-s(x,y));
    yoko_diff += abs(s(x+1, y)-s(x,y));
  }
  cout<<"tate_diff="<<tate_diff<<", yoko_diff="<<yoko_diff<<"\n";
  */
  //cout<<"sum="<<sum<<", green="<<sum_green<<"\n";

  int w = W/3, h = H/3;
  int mindiff = 255;
  for (int lx=0; lx<W-w; lx+=6) {
    for (int ly=0; ly<H-h; ly+=6) {
      int lr = 255, rr = 0;
      int lg = 255, rg = 0;
      int lb = 255, rb = 0;
      for (int x=lx; x<=lx+w; x++) {
        for (int y=ly; y<=ly+h; y++) {
          lr = min(lr, R[y][x]);
          rr = max(rr, R[y][x]);
          lg = min(lg, G[y][x]);
          rg = max(rg, G[y][x]);
          lb = min(lb, B[y][x]);
          rb = max(rb, B[y][x]);
        }
      }
      int diff = rr-lr + rg-lg + rb-lb;
      diff /= 3;
      mindiff = min(mindiff, diff);
    }
  }
  //cout<<"diff="<<mindiff<<endl;
  if (mindiff <= 40) return 4;
  w = W/20, h = H/20;
  mindiff = 255;
  for (int lx=0; lx<W-w; lx+=3) {
    for (int ly=0; ly<H-h; ly+=3) {
      int lr = 255, rr = 0;
      int lg = 255, rg = 0;
      int lb = 255, rb = 0;
      for (int x=lx; x<=lx+w; x++) {
        for (int y=ly; y<=ly+h; y++) {
          lr = min(lr, R[y][x]);
          rr = max(rr, R[y][x]);
          lg = min(lg, G[y][x]);
          rg = max(rg, G[y][x]);
          lb = min(lb, B[y][x]);
          rb = max(rb, B[y][x]);
        }
      }
      int diff = rr-lr + rg-lg + rb-lb;
      diff /= 3;
      mindiff = min(mindiff, diff);
    }
  }
  if (mindiff > 50) return 3;
  if (mindiff > 20) return 2;
  if (sum_green > sum+20) return 2;
  return 1;
  //if (sum > 140) return 1;
  //else return 3;
}

• Subtask 1: 65 / 100