oj.uz

Submission #597402

# Submission time Handle Problem Language Result Execution time Memory
597402 2022-07-16T00:45:04 Z skittles1412 Art Class (IOI13_artclass) C++17
78 / 100
 109 ms 25888 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);
}

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);
    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 += r[i][j] + b[i][j] + g[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);
    cerr << d1 << " " << d2 << " " << d3 << " " << d4 << endl;
    if (d1 > 0.9) {
        if (d2 > 0.05) {
            return 1;
        } else {
            return 4;
        }
    } else if (d1 > 0.5 && d2 > 0.05) {
        return 1;
    } else if (d1 < 0.5 && d4 < 50) {
        return 3;
    } else {
        return 2;
    }
}

Subtask #1
78.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12908 KB Output is correct
2 Correct 66 ms 6212 KB Output is correct
3 Correct 88 ms 23684 KB Output is correct
4 Incorrect 41 ms 5908 KB Output isn't correct
5 Correct 17 ms 4292 KB Output is correct
6 Correct 61 ms 6724 KB Output is correct
7 Incorrect 81 ms 9208 KB Output isn't correct
8 Incorrect 78 ms 10128 KB Output isn't correct
9 Correct 84 ms 14788 KB Output is correct
10 Correct 78 ms 22584 KB Output is correct
11 Correct 41 ms 5096 KB Output is correct
12 Incorrect 109 ms 10564 KB Output isn't correct
13 Correct 45 ms 5088 KB Output is correct
14 Correct 59 ms 16268 KB Output is correct
15 Correct 69 ms 9892 KB Output is correct
16 Incorrect 61 ms 11248 KB Output isn't correct
17 Correct 59 ms 12592 KB Output is correct
18 Incorrect 69 ms 7596 KB Output isn't correct
19 Correct 46 ms 6384 KB Output is correct
20 Correct 83 ms 22336 KB Output is correct
21 Correct 75 ms 13248 KB Output is correct
22 Incorrect 66 ms 9528 KB Output isn't correct
23 Correct 66 ms 8876 KB Output is correct
24 Correct 84 ms 10940 KB Output is correct
25 Correct 71 ms 7216 KB Output is correct
26 Correct 47 ms 14788 KB Output is correct
27 Correct 62 ms 14856 KB Output is correct
28 Correct 70 ms 12084 KB Output is correct
29 Correct 83 ms 10320 KB Output is correct
30 Correct 105 ms 22904 KB Output is correct
31 Correct 51 ms 6392 KB Output is correct
32 Correct 62 ms 17324 KB Output is correct
33 Correct 73 ms 7292 KB Output is correct
34 Incorrect 79 ms 8420 KB Output isn't correct
35 Correct 89 ms 10256 KB Output is correct
36 Correct 47 ms 5328 KB Output is correct
37 Correct 65 ms 13784 KB Output is correct
38 Correct 83 ms 14116 KB Output is correct
39 Correct 29 ms 4788 KB Output is correct
40 Correct 71 ms 13744 KB Output is correct
41 Incorrect 60 ms 9204 KB Output isn't correct
42 Correct 53 ms 9468 KB Output is correct
43 Correct 58 ms 14720 KB Output is correct
44 Incorrect 88 ms 17208 KB Output isn't correct
45 Correct 63 ms 13348 KB Output is correct
46 Correct 86 ms 6168 KB Output is correct
47 Correct 78 ms 9480 KB Output is correct
48 Correct 54 ms 6488 KB Output is correct
49 Correct 66 ms 11056 KB Output is correct
50 Correct 67 ms 5932 KB Output is correct
51 Correct 42 ms 5048 KB Output is correct
52 Incorrect 79 ms 10344 KB Output isn't correct
53 Correct 74 ms 17120 KB Output is correct
54 Correct 53 ms 13120 KB Output is correct
55 Incorrect 79 ms 9332 KB Output isn't correct
56 Correct 50 ms 5580 KB Output is correct
57 Correct 47 ms 6624 KB Output is correct
58 Correct 72 ms 7204 KB Output is correct
59 Correct 73 ms 12724 KB Output is correct
60 Correct 42 ms 9092 KB Output is correct
61 Incorrect 68 ms 8960 KB Output isn't correct
62 Correct 40 ms 13184 KB Output is correct
63 Correct 52 ms 5756 KB Output is correct
64 Correct 95 ms 11120 KB Output is correct
65 Correct 59 ms 6332 KB Output is correct
66 Correct 70 ms 6656 KB Output is correct
67 Correct 67 ms 12168 KB Output is correct
68 Correct 84 ms 25888 KB Output is correct
69 Correct 90 ms 11640 KB Output is correct
70 Correct 47 ms 4704 KB Output is correct
71 Correct 75 ms 8392 KB Output is correct
72 Correct 69 ms 12700 KB Output is correct
73 Correct 84 ms 24948 KB Output is correct
74 Correct 85 ms 13960 KB Output is correct
75 Correct 66 ms 8608 KB Output is correct
76 Incorrect 69 ms 12916 KB Output isn't correct
77 Incorrect 67 ms 11488 KB Output isn't correct
78 Correct 77 ms 17448 KB Output is correct
79 Correct 73 ms 21708 KB Output is correct
80 Incorrect 65 ms 12512 KB Output isn't correct
81 Incorrect 65 ms 10436 KB Output isn't correct
82 Correct 63 ms 13324 KB Output is correct
83 Correct 85 ms 6956 KB Output is correct
84 Correct 96 ms 19584 KB Output is correct
85 Correct 86 ms 16136 KB Output is correct
86 Correct 62 ms 10340 KB Output is correct
87 Correct 94 ms 8656 KB Output is correct
88 Correct 62 ms 18276 KB Output is correct
89 Correct 83 ms 21636 KB Output is correct
90 Correct 19 ms 8456 KB Output is correct
91 Correct 60 ms 12488 KB Output is correct
92 Incorrect 86 ms 12024 KB Output isn't correct
93 Correct 83 ms 10964 KB Output is correct
94 Correct 65 ms 14244 KB Output is correct
95 Correct 35 ms 4748 KB Output is correct
96 Correct 64 ms 7684 KB Output is correct
97 Incorrect 67 ms 12140 KB Output isn't correct
98 Correct 83 ms 6824 KB Output is correct
99 Correct 74 ms 20576 KB Output is correct
100 Incorrect 52 ms 13024 KB Output isn't correct
101 Correct 66 ms 20108 KB Output is correct
102 Correct 83 ms 13488 KB Output is correct