oj.uz

Submission #597460

# Submission time Handle Problem Language Result Execution time Memory
597460 2022-07-16T04:33:48 Z skittles1412 Art Class (IOI13_artclass) C++17
89 / 100
 102 ms 20312 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

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

int n, m, r[500][500], g[500][500], b[500][500];
bool vis[500][500];

bool ibs(int x, int y) {
    return 0 <= x && x < n && 0 <= y && y < m;
}

bool eq(int a, int b, int x) {
    return abs(a - b) <= x;
}

bool ceq(int x1, int y1, int x2, int y2, int x) {
    return eq(r[x1][y1], r[x2][y2], x) && eq(g[x1][y1], g[x2][y2], x) &&
           eq(b[x1][y1], b[x2][y2], x);
}

int sum(int x, int y) {
    return r[x][y] + g[x][y] + b[x][y];
}

void dfs(int x, int y, int lim) {
    if (vis[x][y]) {
        return;
    }
    vis[x][y] = true;
    for (int i = 0; i < 4; i++) {
        int cx = x + dx[i], cy = y + dy[i];
        if (ibs(cx, cy) && ceq(x, y, cx, cy, lim)) {
            dfs(cx, cy, lim);
        }
    }
}

extern "C" int style(int _n,
                     int _m,
                     int _r[500][500],
                     int _g[500][500],
                     int _b[500][500]) {
    n = _n;
    m = _m;
    memcpy(r, _r, sizeof(r));
    memcpy(g, _g, sizeof(g));
    memcpy(b, _b, sizeof(b));
    {
        int xa = 0;
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < m - 1; j++) {
                xa += abs(sum(i, j) - sum(i, j + 1)) +
                      abs(sum(i, j) - sum(i + 1, j));
            }
        }
        double d = double(xa) / (n * m);
        if (d < 17) {
            return 4;
        }
        if (d >= 90) {
            return 3;
        }
    }
    cerr << fixed << setprecision(5);
    auto f1 = [&](int x) -> int {
        int ans = 0;
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < m - 1; j++) {
                ans += ceq(i, j, i, j + 1, x) + ceq(i + 1, j, i, j, x);
            }
        }
        return ans;
    };
    auto f2 = [&](int x) -> int {
        memset(vis, 0, sizeof(vis));
        int ans = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (!vis[i][j]) {
                    ans++;
                    dfs(i, j, x);
                }
            }
        }
        return ans;
    };
    int x2 = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            x2 += sum(i, j) >= 700;
        }
    }
    double d1 = double(f1(10)) / (2 * n * m), d2 = double(x2) / (n * m),
           d3 = double(f2(3)) / (n * m), d4 = double(n * m) / f2(30),
           d5 = double(n * m) / f2(50);
    cerr << d1 << " " << d2 << " " << d3 << " " << d4 << " " << d5 << endl;
    if (d1 > 0.9 || (d1 > 0.5 && d2 > 0.05)) {
        return 1;
    } else {
        return 2;
    }
}

Subtask #1
89.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 5448 KB Output isn't correct
2 Correct 32 ms 6068 KB Output is correct
3 Correct 22 ms 4480 KB Output is correct
4 Correct 25 ms 4660 KB Output is correct
5 Incorrect 46 ms 6092 KB Output isn't correct
6 Incorrect 102 ms 13440 KB Output isn't correct
7 Correct 42 ms 10084 KB Output is correct
8 Correct 70 ms 14448 KB Output is correct
9 Correct 37 ms 5496 KB Output is correct
10 Correct 25 ms 4640 KB Output is correct
11 Correct 21 ms 4440 KB Output is correct
12 Correct 68 ms 15308 KB Output is correct
13 Correct 38 ms 5452 KB Output is correct
14 Correct 46 ms 6220 KB Output is correct
15 Incorrect 63 ms 13396 KB Output isn't correct
16 Incorrect 97 ms 13364 KB Output isn't correct
17 Incorrect 87 ms 19780 KB Output isn't correct
18 Correct 50 ms 5412 KB Output is correct
19 Correct 65 ms 11972 KB Output is correct
20 Incorrect 39 ms 5544 KB Output isn't correct
21 Correct 41 ms 6048 KB Output is correct
22 Correct 42 ms 5892 KB Output is correct
23 Correct 43 ms 6036 KB Output is correct
24 Correct 79 ms 20312 KB Output is correct
25 Correct 63 ms 15436 KB Output is correct
26 Correct 31 ms 4988 KB Output is correct
27 Correct 80 ms 13120 KB Output is correct
28 Correct 29 ms 6128 KB Output is correct
29 Correct 38 ms 6092 KB Output is correct
30 Correct 32 ms 5004 KB Output is correct
31 Incorrect 74 ms 11576 KB Output isn't correct
32 Incorrect 72 ms 16588 KB Output isn't correct
33 Correct 44 ms 5592 KB Output is correct
34 Correct 38 ms 6172 KB Output is correct
35 Correct 64 ms 15572 KB Output is correct
36 Correct 82 ms 11840 KB Output is correct
37 Correct 41 ms 6128 KB Output is correct
38 Incorrect 76 ms 11084 KB Output isn't correct
39 Correct 30 ms 6044 KB Output is correct
40 Correct 52 ms 6152 KB Output is correct
41 Correct 51 ms 10480 KB Output is correct
42 Correct 67 ms 14968 KB Output is correct
43 Correct 73 ms 8728 KB Output is correct
44 Correct 31 ms 6108 KB Output is correct
45 Correct 69 ms 15312 KB Output is correct
46 Correct 57 ms 14048 KB Output is correct
47 Correct 48 ms 6088 KB Output is correct
48 Correct 67 ms 14396 KB Output is correct
49 Correct 53 ms 10192 KB Output is correct
50 Correct 81 ms 16048 KB Output is correct
51 Correct 37 ms 6160 KB Output is correct
52 Correct 89 ms 16252 KB Output is correct
53 Correct 41 ms 6084 KB Output is correct
54 Correct 80 ms 10792 KB Output is correct
55 Incorrect 60 ms 6036 KB Output isn't correct
56 Correct 58 ms 12780 KB Output is correct
57 Correct 47 ms 6136 KB Output is correct
58 Incorrect 36 ms 5420 KB Output isn't correct
59 Correct 38 ms 6128 KB Output is correct
60 Correct 29 ms 6140 KB Output is correct
61 Correct 38 ms 6144 KB Output is correct
62 Incorrect 50 ms 5428 KB Output isn't correct
63 Incorrect 40 ms 5448 KB Output isn't correct
64 Correct 38 ms 6108 KB Output is correct
65 Correct 41 ms 6092 KB Output is correct
66 Correct 11 ms 3796 KB Output is correct
67 Correct 67 ms 15548 KB Output is correct
68 Correct 55 ms 12108 KB Output is correct
69 Correct 62 ms 14036 KB Output is correct
70 Correct 34 ms 5352 KB Output is correct
71 Correct 87 ms 14272 KB Output is correct
72 Correct 22 ms 4324 KB Output is correct
73 Correct 33 ms 6100 KB Output is correct
74 Correct 46 ms 6072 KB Output is correct
75 Correct 42 ms 6076 KB Output is correct
76 Correct 41 ms 5708 KB Output is correct
77 Correct 40 ms 6152 KB Output is correct
78 Correct 40 ms 5548 KB Output is correct
79 Correct 66 ms 15120 KB Output is correct
80 Correct 75 ms 10872 KB Output is correct
81 Correct 95 ms 14884 KB Output is correct
82 Correct 25 ms 4688 KB Output is correct
83 Correct 38 ms 6136 KB Output is correct
84 Correct 74 ms 8772 KB Output is correct
85 Correct 67 ms 14068 KB Output is correct
86 Incorrect 70 ms 14092 KB Output isn't correct
87 Correct 67 ms 12220 KB Output is correct
88 Correct 40 ms 6080 KB Output is correct
89 Correct 70 ms 15056 KB Output is correct
90 Correct 15 ms 6124 KB Output is correct
91 Correct 68 ms 13472 KB Output is correct
92 Correct 77 ms 10320 KB Output is correct
93 Correct 64 ms 15692 KB Output is correct
94 Correct 32 ms 5060 KB Output is correct
95 Correct 41 ms 6100 KB Output is correct
96 Correct 68 ms 14676 KB Output is correct
97 Correct 44 ms 6244 KB Output is correct
98 Correct 50 ms 5524 KB Output is correct
99 Correct 33 ms 6100 KB Output is correct
100 Correct 50 ms 6120 KB Output is correct
101 Correct 74 ms 12768 KB Output is correct
102 Correct 32 ms 5076 KB Output is correct