Submission #758750

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
758750	2023-06-15T08:46:19 Z	coloboxx	Art Class (IOI13_artclass)	C++17	9 / 100	65 ms	6888 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) {
            return 1;

            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 {
            return 3;
            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:234:17: warning: unused variable 'b1' [-Wunused-variable]
  234 |             int b1 = count_bits();
      |                 ^~
artclass.cpp:238:17: warning: unused variable 'b2' [-Wunused-variable]
  238 |             int b2 = count_bits();
      |                 ^~

Subtask #1

9.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	51 ms	6360 KB	Output is correct
2	Correct	21 ms	2772 KB	Output is correct
3	Incorrect	42 ms	5164 KB	Output isn't correct
4	Correct	51 ms	6468 KB	Output is correct
5	Correct	42 ms	5964 KB	Output is correct
6	Correct	51 ms	6432 KB	Output is correct
7	Incorrect	44 ms	5788 KB	Output isn't correct
8	Incorrect	39 ms	4932 KB	Output isn't correct
9	Correct	52 ms	6668 KB	Output is correct
10	Correct	51 ms	6792 KB	Output is correct
11	Correct	52 ms	5572 KB	Output is correct
12	Incorrect	48 ms	6384 KB	Output isn't correct
13	Incorrect	39 ms	4372 KB	Output isn't correct
14	Correct	43 ms	6144 KB	Output is correct
15	Correct	35 ms	4564 KB	Output is correct
16	Correct	22 ms	2876 KB	Output is correct
17	Correct	44 ms	5964 KB	Output is correct
18	Correct	41 ms	6092 KB	Output is correct
19	Incorrect	40 ms	4844 KB	Output isn't correct
20	Correct	41 ms	5204 KB	Output is correct
21	Correct	46 ms	6004 KB	Output is correct
22	Correct	57 ms	6780 KB	Output is correct
23	Incorrect	44 ms	5448 KB	Output isn't correct
24	Incorrect	43 ms	4756 KB	Output isn't correct
25	Correct	40 ms	4932 KB	Output is correct
26	Incorrect	26 ms	5084 KB	Output isn't correct
27	Incorrect	42 ms	5896 KB	Output isn't correct
28	Incorrect	42 ms	4944 KB	Output isn't correct
29	Incorrect	48 ms	6228 KB	Output isn't correct
30	Incorrect	40 ms	5640 KB	Output isn't correct
31	Incorrect	46 ms	5256 KB	Output isn't correct
32	Incorrect	43 ms	6184 KB	Output isn't correct
33	Incorrect	30 ms	5404 KB	Output isn't correct
34	Incorrect	41 ms	5792 KB	Output isn't correct
35	Incorrect	40 ms	4940 KB	Output isn't correct
36	Incorrect	41 ms	6016 KB	Output isn't correct
37	Correct	33 ms	4268 KB	Output is correct
38	Incorrect	53 ms	5800 KB	Output isn't correct
39	Incorrect	42 ms	5184 KB	Output isn't correct
40	Incorrect	27 ms	3408 KB	Output isn't correct
41	Incorrect	46 ms	6032 KB	Output isn't correct
42	Incorrect	41 ms	5672 KB	Output isn't correct
43	Correct	43 ms	5972 KB	Output is correct
44	Correct	42 ms	5980 KB	Output is correct
45	Correct	33 ms	5488 KB	Output is correct
46	Correct	58 ms	6432 KB	Output is correct
47	Incorrect	42 ms	5920 KB	Output isn't correct
48	Correct	52 ms	6532 KB	Output is correct
49	Incorrect	41 ms	6020 KB	Output isn't correct
50	Correct	52 ms	6604 KB	Output is correct
51	Correct	44 ms	5104 KB	Output is correct
52	Correct	33 ms	4220 KB	Output is correct
53	Incorrect	45 ms	5856 KB	Output isn't correct
54	Incorrect	31 ms	5332 KB	Output isn't correct
55	Incorrect	43 ms	6192 KB	Output isn't correct
56	Correct	56 ms	6584 KB	Output is correct
57	Incorrect	42 ms	5356 KB	Output isn't correct
58	Correct	45 ms	5836 KB	Output is correct
59	Correct	37 ms	5760 KB	Output is correct
60	Correct	30 ms	3412 KB	Output is correct
61	Incorrect	48 ms	6328 KB	Output isn't correct
62	Correct	28 ms	2772 KB	Output is correct
63	Incorrect	44 ms	5440 KB	Output isn't correct
64	Correct	65 ms	6692 KB	Output is correct
65	Correct	30 ms	5368 KB	Output is correct
66	Correct	27 ms	3508 KB	Output is correct
67	Incorrect	40 ms	4872 KB	Output isn't correct
68	Correct	53 ms	6604 KB	Output is correct
69	Incorrect	39 ms	4772 KB	Output isn't correct
70	Incorrect	43 ms	4832 KB	Output isn't correct
71	Correct	14 ms	1540 KB	Output is correct
72	Incorrect	46 ms	5888 KB	Output isn't correct
73	Incorrect	36 ms	5520 KB	Output isn't correct
74	Correct	27 ms	3412 KB	Output is correct
75	Correct	43 ms	5356 KB	Output is correct
76	Incorrect	13 ms	4432 KB	Output isn't correct
77	Correct	52 ms	6272 KB	Output is correct
78	Incorrect	53 ms	6564 KB	Output isn't correct
79	Correct	36 ms	5452 KB	Output is correct
80	Incorrect	45 ms	5552 KB	Output isn't correct
81	Correct	40 ms	4948 KB	Output is correct
82	Incorrect	35 ms	5716 KB	Output isn't correct
83	Incorrect	44 ms	6052 KB	Output isn't correct
84	Correct	39 ms	4932 KB	Output is correct
85	Incorrect	43 ms	6060 KB	Output isn't correct
86	Correct	29 ms	3768 KB	Output is correct
87	Correct	43 ms	6020 KB	Output is correct
88	Incorrect	60 ms	6092 KB	Output isn't correct
89	Incorrect	40 ms	5588 KB	Output isn't correct
90	Correct	33 ms	5624 KB	Output is correct
91	Incorrect	52 ms	6888 KB	Output isn't correct
92	Correct	32 ms	4024 KB	Output is correct
93	Incorrect	32 ms	5452 KB	Output isn't correct
94	Incorrect	42 ms	5328 KB	Output isn't correct
95	Incorrect	41 ms	5024 KB	Output isn't correct
96	Correct	38 ms	5824 KB	Output is correct
97	Correct	32 ms	5348 KB	Output is correct
98	Incorrect	44 ms	5256 KB	Output isn't correct
99	Incorrect	45 ms	5568 KB	Output isn't correct
100	Incorrect	43 ms	5912 KB	Output isn't correct
101	Correct	58 ms	6756 KB	Output is correct
102	Correct	63 ms	6604 KB	Output is correct