답안 #758753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
758753	2023-06-15T08:51:40 Z	coloboxx	미술 수업 (IOI13_artclass)	C++17	51 / 100	70 ms	7028 KB

artclass

#include "artclass.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define point pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define show(x) cerr << (#x) << " = " << x << '\n'
#define print(x) if (1) {cerr << (#x) << " = "; for (auto it : x) \
      cerr << it << ' '; cerr << '\n';}
#define fast_io ios_base::sync_with_stdio(0), cin.tie(0)

const int N = 512;
//const int S = 2e7 + 64;
const int INF = 2e9 + 64;
const ll MAX = 2e18 + 64;
const int LOG = 30;
const int MOD = 998244353;
const int P = 79;

using namespace std;
using namespace __gnu_pbds;

struct RGB {
      unsigned char r, g, b;
      RGB() {}
      RGB(unsigned char r, unsigned char g, unsigned char b) : r(r), g(g), b(b) {}

      unsigned char mx() {
            return max({r, g, b});
      }

      unsigned char mn() {
            return min({r, g, b});
      }
};

double dist(RGB e1, RGB e2) {
    long rmean = ( (long)e1.r + (long)e2.r ) / 2;
    long r = (long)e1.r - (long)e2.r;
    long g = (long)e1.g - (long)e2.g;
    long b = (long)e1.b - (long)e2.b;
    return sqrt((((512+rmean)*r*r)>>8) + 4*g*g + (((767-rmean)*b*b)>>8));
}

int sq(ll x) {
      return x * x;
}

// double dist(RGB e1, RGB e2) {
//       return sqrt(sq((int)e1.r - (int)e2.r) + sq((int)e1.g - (int)e2.g) + sq((int)e1.b - (int)e2.b));
// }

int a[N][N], used[N][N];

void clear() {
      for (int i = 0; i < N; ++i)
            for (int j = 0; j < N; ++j)
                  a[i][j] = used[i][j] = 0;
}

int n, m, R[500][500], G[500][500], B[500][500];
RGB c[500][500];

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

void select_by_diff(RGB color, double w, double f = 1e9) {
      clear();
      for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                  a[i][j] = dist(color, c[i][j]) <= w && c[i][j].mx() - c[i][j].mn() <= f;
}

RGB average(int x1, int y1, int x2, int y2) {
      ll sr = 0, sg = 0, sb = 0;
      for (int i = x1; i <= x2; ++i)
            for (int j = x1; j <= x2; ++j)
                  sr += c[i][j].r, sg += c[i][j].g, sb += c[i][j].b;

      int l = (y2 - y1 + 1) * (x2 - x1 + 1);
      return RGB(sr / l, sg / l, sb / l);
}

RGB average(vector<RGB> &v) {
      ll sr = 0, sg = 0, sb = 0;
      for (RGB color : v)
            sr += color.r, sg += color.g, sb += color.b;

      int l = v.size();
      return RGB(sr / l, sg / l, sb / l);
}

int cnt = 0;

// int dfs(int x, int y) {
//       ++cnt;
//       if (cnt % 33700 == 0)
//             show(x), show(y), show(cnt);

//       //show(used[0][0]);
//       assert(!used[x][y]);
//       assert(min(x, y) >= 0 && x < n && y < m);
//       used[x][y] = true;
//       int res = 1;
//       for (int k = 0; k < 4; ++k) {
//             int nx = x + dx[k];
//             int ny = y + dy[k];
//             if (min(nx, ny) >= 0 && nx < n && ny < m && !used[nx][ny] && a[nx][ny] == a[x][y])
//                   res += dfs(nx, ny);
//       }
//       return res;
// }

int bfs(int sx, int sy) {
      used[sx][sy] = true;
      queue<point> q;

      q.push({sx, sy});
      int res = 0;

      while (!q.empty()) {
            auto [x, y] = q.front();
            q.pop();

            ++res;
            used[x][y] = true;

            for (int dir = 0; dir < 4; ++dir) {
                  int nx = x + dx[dir];
                  int ny = y + dy[dir];

                  if (nx >= 0 && nx < n && ny >= 0 && ny < m && !used[nx][ny] && a[nx][ny] == a[x][y])
                        used[nx][ny] = true, q.push({nx, ny});
            } 
      }

      return res;
}

bool check_green(RGB color) {
      int r = color.r, g = color.g, b = color.b;

      return g - 16 >= max(r, b) || (g + 12 >= r && b <= min(r, g) * 2 / 3);
}

int bfs_green(int sx, int sy) {
      used[sx][sy] = true;
      queue<point> q;

      q.push({sx, sy});
      int res = 0;

      while (!q.empty()) {
            auto [x, y] = q.front();
            q.pop();

            ++res;
            used[x][y] = true;

            for (int dir = 0; dir < 4; ++dir) {
                  int nx = x + dx[dir];
                  int ny = y + dy[dir];

                  if (nx >= 0 && nx < n && ny >= 0 && ny < m && !used[nx][ny] && check_green(c[nx][ny]))
                        used[nx][ny] = true, q.push({nx, ny});
            } 
      }

      return res;
}


int count_components(int lim = 1) {
      for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                  used[i][j] = 0;

      int res = 0;
      for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                  if (!used[i][j])
                        res += (bfs(i, j) >= lim);

      return res;
}

const RGB GRAY = {20, 20, 20};
const RGB LGRAY = {235, 235, 235};

mt19937 rnd(time(0));

int count_bits() {
      int res = 0;
      for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                  res += a[i][j];
      return res;
}

int style(int R, int C, int r[500][500], int g[500][500], int b[500][500]) {
      // show(N), show(M);
      n = R, m = C;
      for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                  c[i][j] = RGB(r[i][j], g[i][j], b[i][j]);

      int cnt = 0, total = 0;
      for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j) {
                  for (int k = 0; k < 4; ++k) {
                        int ni = i + dx[k], nj = j + dy[k];
                        if (ni >= 0 && nj >= 0 && ni < n && nj < m) {
                              ++total;
                              cnt += dist(c[i][j], c[ni][nj]) <= 35.0;
                        }
                  }
            }

      assert(total != 0);

      double coeff = (double)cnt / (double)total;
      // show(coeff);

      if (coeff >= 0.5) {
            select_by_diff(GRAY, 120.0, 16.0);
            int c1 = count_components(1000);
            int b1 = count_bits();

            select_by_diff(LGRAY, 72.0, 16.0);
            int c2 = count_components(1000);
            int b2 = count_bits();

            // show(c1), show(c2);
            // show(b1), show(b2);

            if (max(c1, c2) >= 7)
                  return 1;
            else
                  return 4;
      }
      else {
            vector<point> v;

            for (int i = 0; i < n; ++i)
                  for (int j = 0; j < m; ++j)
                        if (check_green(c[i][j]))
                              v.pb({i, j});

            int cnt_green = 0;
            clear();

            // show(v.size());

            if (v.size() < 2500)
                  return 3;

            for (int t = 0; t < 100; ++t) {
                  auto [x, y] = v[rnd() % v.size()];

                  if (used[x][y]) {
                        --t; continue;
                  }

                  double coeff_green = (double)bfs_green(x, y) / (double)(n * m);
                  if (coeff_green >= 0.16)
                        return 2;

                  cnt_green += coeff_green >= 0.03;
            }

            // show(cnt_green);     

            return (cnt_green >= 4 ? 2 : 3);
      }
}

// signed main() {
//       string folder = "C:\\Users\\nazar\\Desktop\\Sublime\\ArtClass\\files\\";

//       for (int type = 1; type <= 4; ++type) {
//             cerr << "------- TYPE #" << type << ": -------\n";
//             for (int sample = 1; sample <= 9; ++sample) {
//                   cerr << "\n\n";
//                   cerr << "sample #" << sample << ": \n";
//                   string path = folder + "sample" + to_string(type) + "-0" + to_string(sample);
//                   //show(path);
//                   ifstream file(path.c_str());

//                   int n, m;
//                   file >> n >> m;

//                   for (int i = 0; i < n; ++i)
//                         for (int j = 0; j < m; ++j)
//                               file >> R[i][j] >> G[i][j] >> B[i][j];

//                   cout << style(n, m, R, G, B) << '\n' << '\n';
//                   file.close();
//             }
//       }
// }

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:232:17: warning: unused variable 'b1' [-Wunused-variable]
  232 |             int b1 = count_bits();
      |                 ^~
artclass.cpp:236:17: warning: unused variable 'b2' [-Wunused-variable]
  236 |             int b2 = count_bits();
      |                 ^~

Subtask #1

51.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	62 ms	5964 KB	Output is correct
2	Correct	43 ms	5504 KB	Output is correct
3	Correct	41 ms	5912 KB	Output is correct
4	Incorrect	51 ms	5428 KB	Output isn't correct
5	Incorrect	50 ms	5292 KB	Output isn't correct
6	Correct	57 ms	5908 KB	Output is correct
7	Correct	61 ms	5980 KB	Output is correct
8	Incorrect	53 ms	5908 KB	Output isn't correct
9	Incorrect	56 ms	5288 KB	Output isn't correct
10	Correct	24 ms	4068 KB	Output is correct
11	Correct	33 ms	4644 KB	Output is correct
12	Correct	56 ms	5808 KB	Output is correct
13	Correct	40 ms	5352 KB	Output is correct
14	Correct	16 ms	5972 KB	Output is correct
15	Correct	53 ms	5992 KB	Output is correct
16	Incorrect	58 ms	5964 KB	Output isn't correct
17	Correct	48 ms	5228 KB	Output is correct
18	Incorrect	59 ms	5576 KB	Output isn't correct
19	Incorrect	49 ms	5224 KB	Output isn't correct
20	Correct	40 ms	6012 KB	Output is correct
21	Incorrect	31 ms	4180 KB	Output isn't correct
22	Correct	47 ms	6120 KB	Output is correct
23	Correct	42 ms	6028 KB	Output is correct
24	Incorrect	50 ms	5924 KB	Output isn't correct
25	Incorrect	39 ms	6036 KB	Output isn't correct
26	Correct	40 ms	5196 KB	Output is correct
27	Correct	32 ms	6228 KB	Output is correct
28	Incorrect	51 ms	5280 KB	Output isn't correct
29	Incorrect	70 ms	5944 KB	Output isn't correct
30	Correct	55 ms	5960 KB	Output is correct
31	Correct	23 ms	3988 KB	Output is correct
32	Correct	41 ms	6016 KB	Output is correct
33	Correct	60 ms	5936 KB	Output is correct
34	Incorrect	47 ms	5048 KB	Output isn't correct
35	Correct	36 ms	5964 KB	Output is correct
36	Incorrect	48 ms	5912 KB	Output isn't correct
37	Correct	46 ms	5704 KB	Output is correct
38	Correct	12 ms	3156 KB	Output is correct
39	Incorrect	45 ms	6624 KB	Output isn't correct
40	Correct	52 ms	6012 KB	Output is correct
41	Correct	33 ms	4728 KB	Output is correct
42	Correct	33 ms	6124 KB	Output is correct
43	Correct	48 ms	6016 KB	Output is correct
44	Correct	39 ms	6000 KB	Output is correct
45	Correct	59 ms	5900 KB	Output is correct
46	Incorrect	46 ms	5004 KB	Output isn't correct
47	Incorrect	61 ms	5996 KB	Output isn't correct
48	Correct	52 ms	5908 KB	Output is correct
49	Correct	40 ms	5072 KB	Output is correct
50	Correct	37 ms	6016 KB	Output is correct
51	Incorrect	48 ms	6016 KB	Output isn't correct
52	Incorrect	61 ms	5908 KB	Output isn't correct
53	Correct	33 ms	4428 KB	Output is correct
54	Correct	37 ms	5964 KB	Output is correct
55	Correct	57 ms	6016 KB	Output is correct
56	Incorrect	64 ms	5912 KB	Output isn't correct
57	Incorrect	44 ms	5784 KB	Output isn't correct
58	Correct	39 ms	6012 KB	Output is correct
59	Correct	64 ms	6024 KB	Output is correct
60	Incorrect	50 ms	5284 KB	Output isn't correct
61	Correct	28 ms	4300 KB	Output is correct
62	Correct	36 ms	4968 KB	Output is correct
63	Incorrect	43 ms	5896 KB	Output isn't correct
64	Correct	56 ms	6068 KB	Output is correct
65	Correct	58 ms	5580 KB	Output is correct
66	Correct	49 ms	6016 KB	Output is correct
67	Incorrect	52 ms	5268 KB	Output isn't correct
68	Correct	61 ms	5968 KB	Output is correct
69	Incorrect	50 ms	5952 KB	Output isn't correct
70	Correct	43 ms	5516 KB	Output is correct
71	Incorrect	40 ms	4680 KB	Output isn't correct
72	Correct	30 ms	6028 KB	Output is correct
73	Correct	62 ms	6012 KB	Output is correct
74	Correct	48 ms	6008 KB	Output is correct
75	Correct	31 ms	4268 KB	Output is correct
76	Correct	50 ms	5896 KB	Output is correct
77	Correct	46 ms	6224 KB	Output is correct
78	Correct	46 ms	6224 KB	Output is correct
79	Correct	42 ms	6356 KB	Output is correct
80	Correct	53 ms	5964 KB	Output is correct
81	Incorrect	48 ms	5196 KB	Output isn't correct
82	Correct	68 ms	5980 KB	Output is correct
83	Incorrect	61 ms	5500 KB	Output isn't correct
84	Correct	34 ms	4684 KB	Output is correct
85	Correct	43 ms	6268 KB	Output is correct
86	Correct	37 ms	6004 KB	Output is correct
87	Correct	60 ms	5920 KB	Output is correct
88	Correct	44 ms	5572 KB	Output is correct
89	Incorrect	47 ms	5068 KB	Output isn't correct
90	Incorrect	49 ms	5196 KB	Output isn't correct
91	Correct	57 ms	5964 KB	Output is correct
92	Correct	50 ms	5904 KB	Output is correct
93	Incorrect	52 ms	5500 KB	Output isn't correct
94	Correct	23 ms	3980 KB	Output is correct
95	Correct	39 ms	6012 KB	Output is correct
96	Correct	60 ms	5856 KB	Output is correct
97	Correct	34 ms	4372 KB	Output is correct
98	Incorrect	50 ms	5404 KB	Output isn't correct
99	Correct	46 ms	6244 KB	Output is correct
100	Correct	55 ms	6008 KB	Output is correct
101	Correct	61 ms	5988 KB	Output is correct
102	Correct	60 ms	7028 KB	Output is correct