Submission #758775

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
758775	2023-06-15T09:35:45 Z	coloboxx	Art Class (IOI13_artclass)	C++17	89 / 100	66 ms	7484 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 - 8 >= max(r, b) || (g + 16 >= r && b <= min(r, g) * 4 / 5);
}

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]) <= 16.0;
                        }
                  }
            }

      assert(total != 0);

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

      if (coeff >= 0.45) {
            select_by_diff(GRAY, 128.0, 24.0);
            int c1 = count_components(750);
            int b1 = count_bits();

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

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

            if (max(c1, c2) >= 8)
                  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 < 200; ++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.12)
                        return 2;

                  cnt_green += coeff_green >= 0.02;
                  // show(coeff_green);
            }

            // 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

89.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	5928 KB	Output is correct
2	Correct	58 ms	6012 KB	Output is correct
3	Incorrect	42 ms	5664 KB	Output isn't correct
4	Correct	61 ms	5972 KB	Output is correct
5	Incorrect	52 ms	5452 KB	Output isn't correct
6	Correct	59 ms	5964 KB	Output is correct
7	Correct	60 ms	5936 KB	Output is correct
8	Correct	56 ms	7100 KB	Output is correct
9	Correct	43 ms	6332 KB	Output is correct
10	Incorrect	43 ms	6852 KB	Output isn't correct
11	Correct	48 ms	6516 KB	Output is correct
12	Correct	53 ms	5912 KB	Output is correct
13	Correct	58 ms	5920 KB	Output is correct
14	Incorrect	49 ms	5984 KB	Output isn't correct
15	Correct	49 ms	6016 KB	Output is correct
16	Correct	43 ms	5828 KB	Output is correct
17	Correct	12 ms	3132 KB	Output is correct
18	Correct	39 ms	7028 KB	Output is correct
19	Incorrect	46 ms	6772 KB	Output isn't correct
20	Correct	48 ms	6696 KB	Output is correct
21	Correct	60 ms	5996 KB	Output is correct
22	Incorrect	56 ms	6000 KB	Output isn't correct
23	Correct	46 ms	7156 KB	Output is correct
24	Correct	43 ms	5668 KB	Output is correct
25	Correct	51 ms	6020 KB	Output is correct
26	Correct	51 ms	5928 KB	Output is correct
27	Correct	28 ms	4432 KB	Output is correct
28	Correct	28 ms	4432 KB	Output is correct
29	Correct	59 ms	5896 KB	Output is correct
30	Correct	44 ms	5880 KB	Output is correct
31	Correct	23 ms	4176 KB	Output is correct
32	Correct	30 ms	5264 KB	Output is correct
33	Correct	25 ms	4220 KB	Output is correct
34	Incorrect	61 ms	5908 KB	Output isn't correct
35	Correct	16 ms	5972 KB	Output is correct
36	Incorrect	39 ms	4748 KB	Output isn't correct
37	Incorrect	60 ms	5964 KB	Output isn't correct
38	Correct	36 ms	5920 KB	Output is correct
39	Correct	57 ms	5808 KB	Output is correct
40	Correct	53 ms	5936 KB	Output is correct
41	Correct	47 ms	5204 KB	Output is correct
42	Correct	45 ms	6484 KB	Output is correct
43	Correct	55 ms	5480 KB	Output is correct
44	Correct	34 ms	6344 KB	Output is correct
45	Correct	35 ms	4352 KB	Output is correct
46	Correct	48 ms	6920 KB	Output is correct
47	Correct	54 ms	7224 KB	Output is correct
48	Correct	49 ms	6292 KB	Output is correct
49	Correct	63 ms	5852 KB	Output is correct
50	Correct	42 ms	5972 KB	Output is correct
51	Correct	52 ms	6940 KB	Output is correct
52	Correct	66 ms	6016 KB	Output is correct
53	Correct	46 ms	6428 KB	Output is correct
54	Correct	42 ms	6264 KB	Output is correct
55	Correct	52 ms	6012 KB	Output is correct
56	Correct	45 ms	6268 KB	Output is correct
57	Correct	34 ms	4900 KB	Output is correct
58	Correct	37 ms	5964 KB	Output is correct
59	Correct	55 ms	6688 KB	Output is correct
60	Correct	39 ms	6004 KB	Output is correct
61	Correct	63 ms	5964 KB	Output is correct
62	Correct	37 ms	5948 KB	Output is correct
63	Correct	37 ms	6196 KB	Output is correct
64	Correct	60 ms	5936 KB	Output is correct
65	Correct	44 ms	6460 KB	Output is correct
66	Correct	23 ms	4288 KB	Output is correct
67	Incorrect	46 ms	5068 KB	Output isn't correct
68	Correct	28 ms	4508 KB	Output is correct
69	Correct	49 ms	6184 KB	Output is correct
70	Incorrect	47 ms	6008 KB	Output isn't correct
71	Correct	46 ms	6052 KB	Output is correct
72	Correct	55 ms	5960 KB	Output is correct
73	Correct	40 ms	5432 KB	Output is correct
74	Correct	47 ms	5896 KB	Output is correct
75	Correct	58 ms	6036 KB	Output is correct
76	Correct	54 ms	5960 KB	Output is correct
77	Incorrect	53 ms	6060 KB	Output isn't correct
78	Correct	47 ms	5940 KB	Output is correct
79	Correct	46 ms	6492 KB	Output is correct
80	Correct	46 ms	5612 KB	Output is correct
81	Correct	48 ms	6016 KB	Output is correct
82	Correct	49 ms	7100 KB	Output is correct
83	Correct	53 ms	5956 KB	Output is correct
84	Correct	45 ms	6352 KB	Output is correct
85	Correct	54 ms	6012 KB	Output is correct
86	Correct	45 ms	6220 KB	Output is correct
87	Incorrect	48 ms	6020 KB	Output isn't correct
88	Correct	33 ms	4832 KB	Output is correct
89	Correct	48 ms	7108 KB	Output is correct
90	Correct	42 ms	6148 KB	Output is correct
91	Correct	34 ms	4828 KB	Output is correct
92	Correct	35 ms	5976 KB	Output is correct
93	Correct	59 ms	5964 KB	Output is correct
94	Incorrect	38 ms	5916 KB	Output isn't correct
95	Correct	47 ms	5852 KB	Output is correct
96	Correct	45 ms	6256 KB	Output is correct
97	Correct	40 ms	5236 KB	Output is correct
98	Correct	46 ms	6624 KB	Output is correct
99	Correct	38 ms	5280 KB	Output is correct
100	Incorrect	53 ms	6100 KB	Output isn't correct
101	Correct	48 ms	7484 KB	Output is correct
102	Correct	60 ms	5960 KB	Output is correct