oj.uz

Submission #597462

# Submission time Handle Problem Language Result Execution time Memory
597462 2022-07-16T04:39:21 Z skittles1412 Art Class (IOI13_artclass) C++17
96 / 100
 58 ms 6184 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));
    cerr << fixed << setprecision(5);
    {
        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);
        cerr << d << endl;
        if (d < 17) {
            return 4;
        } else if (d < 43) {
            return 1;
        } else if (d < 90) {
            return 2;
        } else {
            return 3;
        }
    }
    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
96.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 5668 KB Output is correct
2 Correct 52 ms 6088 KB Output is correct
3 Correct 42 ms 6116 KB Output is correct
4 Correct 44 ms 6036 KB Output is correct
5 Correct 47 ms 5652 KB Output is correct
6 Correct 28 ms 4644 KB Output is correct
7 Incorrect 44 ms 5656 KB Output isn't correct
8 Correct 23 ms 4332 KB Output is correct
9 Correct 34 ms 5076 KB Output is correct
10 Correct 36 ms 6080 KB Output is correct
11 Correct 44 ms 6096 KB Output is correct
12 Correct 45 ms 5656 KB Output is correct
13 Correct 42 ms 6096 KB Output is correct
14 Correct 41 ms 6144 KB Output is correct
15 Correct 34 ms 6160 KB Output is correct
16 Correct 33 ms 6124 KB Output is correct
17 Correct 34 ms 6112 KB Output is correct
18 Incorrect 43 ms 5416 KB Output isn't correct
19 Incorrect 40 ms 5452 KB Output isn't correct
20 Correct 33 ms 6128 KB Output is correct
21 Correct 35 ms 5008 KB Output is correct
22 Correct 48 ms 6124 KB Output is correct
23 Correct 37 ms 6124 KB Output is correct
24 Correct 44 ms 5412 KB Output is correct
25 Incorrect 50 ms 6144 KB Output isn't correct
26 Correct 33 ms 6096 KB Output is correct
27 Correct 52 ms 6084 KB Output is correct
28 Correct 39 ms 5320 KB Output is correct
29 Correct 43 ms 5596 KB Output is correct
30 Correct 42 ms 6092 KB Output is correct
31 Correct 45 ms 6080 KB Output is correct
32 Correct 42 ms 6100 KB Output is correct
33 Correct 39 ms 5372 KB Output is correct
34 Correct 45 ms 5720 KB Output is correct
35 Correct 44 ms 5732 KB Output is correct
36 Incorrect 45 ms 6076 KB Output isn't correct
37 Incorrect 43 ms 6072 KB Output isn't correct
38 Correct 42 ms 6128 KB Output is correct
39 Correct 45 ms 6036 KB Output is correct
40 Correct 29 ms 6076 KB Output is correct
41 Correct 42 ms 6092 KB Output is correct
42 Correct 43 ms 6076 KB Output is correct
43 Correct 43 ms 5524 KB Output is correct
44 Correct 22 ms 4340 KB Output is correct
45 Correct 30 ms 4692 KB Output is correct
46 Correct 48 ms 5988 KB Output is correct
47 Correct 45 ms 6092 KB Output is correct
48 Correct 53 ms 6132 KB Output is correct
49 Correct 45 ms 5312 KB Output is correct
50 Correct 40 ms 5460 KB Output is correct
51 Correct 45 ms 6092 KB Output is correct
52 Correct 48 ms 6108 KB Output is correct
53 Correct 44 ms 6112 KB Output is correct
54 Correct 35 ms 6152 KB Output is correct
55 Correct 41 ms 6108 KB Output is correct
56 Correct 28 ms 4724 KB Output is correct
57 Correct 36 ms 6136 KB Output is correct
58 Correct 51 ms 6100 KB Output is correct
59 Correct 42 ms 5560 KB Output is correct
60 Correct 41 ms 6080 KB Output is correct
61 Correct 42 ms 6108 KB Output is correct
62 Correct 43 ms 5672 KB Output is correct
63 Correct 31 ms 6148 KB Output is correct
64 Correct 35 ms 5052 KB Output is correct
65 Correct 32 ms 4724 KB Output is correct
66 Correct 45 ms 6160 KB Output is correct
67 Correct 51 ms 6024 KB Output is correct
68 Correct 25 ms 4364 KB Output is correct
69 Incorrect 51 ms 6132 KB Output isn't correct
70 Correct 28 ms 4812 KB Output is correct
71 Correct 37 ms 6064 KB Output is correct
72 Correct 42 ms 6064 KB Output is correct
73 Correct 33 ms 4908 KB Output is correct
74 Incorrect 45 ms 5708 KB Output isn't correct
75 Correct 53 ms 5480 KB Output is correct
76 Correct 33 ms 6076 KB Output is correct
77 Correct 42 ms 6088 KB Output is correct
78 Correct 12 ms 3828 KB Output is correct
79 Correct 56 ms 6080 KB Output is correct
80 Correct 58 ms 6136 KB Output is correct
81 Correct 43 ms 5596 KB Output is correct
82 Incorrect 43 ms 5332 KB Output isn't correct
83 Correct 50 ms 6124 KB Output is correct
84 Correct 46 ms 5708 KB Output is correct
85 Correct 34 ms 5148 KB Output is correct
86 Incorrect 44 ms 5612 KB Output isn't correct
87 Correct 38 ms 6064 KB Output is correct
88 Correct 27 ms 6144 KB Output is correct
89 Correct 41 ms 5516 KB Output is correct
90 Incorrect 51 ms 6104 KB Output isn't correct
91 Correct 51 ms 6028 KB Output is correct
92 Correct 42 ms 6112 KB Output is correct
93 Correct 54 ms 6080 KB Output is correct
94 Incorrect 41 ms 5356 KB Output isn't correct
95 Correct 43 ms 5604 KB Output is correct
96 Correct 15 ms 6088 KB Output is correct
97 Correct 42 ms 5576 KB Output is correct
98 Correct 51 ms 6184 KB Output is correct
99 Correct 52 ms 6136 KB Output is correct
100 Correct 43 ms 6140 KB Output is correct
101 Correct 41 ms 5428 KB Output is correct
102 Correct 32 ms 6116 KB Output is correct