oj.uz

Submission #597407

# Submission time Handle Problem Language Result Execution time Memory
597407 2022-07-16T00:52:48 Z skittles1412 Art Class (IOI13_artclass) C++17
78 / 100
 103 ms 26752 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),
           d5 = double(n * m) / f2(50);
    cerr << d1 << " " << d2 << " " << d3 << " " << d4 << " " << d5 << endl;
    if (d1 > 0.9) {
        if (d2 < 1e-4 || d4 >= 2e4) {
            return 4;
        } else {
            return 1;
        }
    } 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 Incorrect 85 ms 15036 KB Output isn't correct
2 Correct 20 ms 5808 KB Output is correct
3 Correct 73 ms 23164 KB Output is correct
4 Correct 38 ms 6800 KB Output is correct
5 Correct 98 ms 18524 KB Output is correct
6 Correct 70 ms 19872 KB Output is correct
7 Correct 64 ms 17656 KB Output is correct
8 Correct 53 ms 11260 KB Output is correct
9 Correct 63 ms 10868 KB Output is correct
10 Correct 83 ms 13732 KB Output is correct
11 Correct 70 ms 9128 KB Output is correct
12 Correct 67 ms 14412 KB Output is correct
13 Correct 62 ms 14956 KB Output is correct
14 Correct 87 ms 22952 KB Output is correct
15 Correct 71 ms 11796 KB Output is correct
16 Incorrect 79 ms 15000 KB Output isn't correct
17 Correct 69 ms 18388 KB Output is correct
18 Correct 88 ms 16696 KB Output is correct
19 Correct 55 ms 12900 KB Output is correct
20 Incorrect 67 ms 13104 KB Output isn't correct
21 Incorrect 83 ms 14056 KB Output isn't correct
22 Incorrect 44 ms 7080 KB Output isn't correct
23 Correct 70 ms 15520 KB Output is correct
24 Incorrect 71 ms 13948 KB Output isn't correct
25 Correct 66 ms 12380 KB Output is correct
26 Correct 69 ms 17352 KB Output is correct
27 Correct 66 ms 16488 KB Output is correct
28 Correct 69 ms 9440 KB Output is correct
29 Correct 54 ms 15564 KB Output is correct
30 Incorrect 72 ms 15268 KB Output isn't correct
31 Correct 80 ms 11220 KB Output is correct
32 Correct 53 ms 11160 KB Output is correct
33 Correct 76 ms 22756 KB Output is correct
34 Correct 52 ms 11116 KB Output is correct
35 Correct 59 ms 18364 KB Output is correct
36 Correct 51 ms 11384 KB Output is correct
37 Correct 60 ms 16420 KB Output is correct
38 Incorrect 75 ms 15384 KB Output isn't correct
39 Correct 73 ms 22484 KB Output is correct
40 Correct 75 ms 11248 KB Output is correct
41 Correct 48 ms 6044 KB Output is correct
42 Incorrect 62 ms 19712 KB Output isn't correct
43 Correct 82 ms 21240 KB Output is correct
44 Correct 92 ms 20708 KB Output is correct
45 Correct 50 ms 13664 KB Output is correct
46 Correct 76 ms 22972 KB Output is correct
47 Correct 78 ms 12724 KB Output is correct
48 Correct 74 ms 16396 KB Output is correct
49 Correct 77 ms 9532 KB Output is correct
50 Correct 73 ms 11144 KB Output is correct
51 Correct 44 ms 7752 KB Output is correct
52 Correct 68 ms 15212 KB Output is correct
53 Correct 75 ms 23332 KB Output is correct
54 Incorrect 65 ms 13272 KB Output isn't correct
55 Correct 70 ms 16348 KB Output is correct
56 Correct 80 ms 11796 KB Output is correct
57 Incorrect 62 ms 13584 KB Output isn't correct
58 Correct 58 ms 11596 KB Output is correct
59 Correct 76 ms 16100 KB Output is correct
60 Correct 53 ms 17740 KB Output is correct
61 Correct 58 ms 9312 KB Output is correct
62 Incorrect 103 ms 14252 KB Output isn't correct
63 Incorrect 78 ms 14284 KB Output isn't correct
64 Incorrect 65 ms 14988 KB Output isn't correct
65 Correct 64 ms 15312 KB Output is correct
66 Correct 76 ms 12588 KB Output is correct
67 Correct 76 ms 16216 KB Output is correct
68 Correct 77 ms 14996 KB Output is correct
69 Correct 62 ms 11060 KB Output is correct
70 Correct 78 ms 16956 KB Output is correct
71 Correct 71 ms 16004 KB Output is correct
72 Correct 69 ms 15776 KB Output is correct
73 Correct 70 ms 15800 KB Output is correct
74 Correct 82 ms 11800 KB Output is correct
75 Correct 60 ms 19712 KB Output is correct
76 Incorrect 65 ms 14268 KB Output isn't correct
77 Correct 68 ms 6816 KB Output is correct
78 Correct 68 ms 15044 KB Output is correct
79 Correct 74 ms 22336 KB Output is correct
80 Incorrect 80 ms 11972 KB Output isn't correct
81 Correct 73 ms 9584 KB Output is correct
82 Correct 64 ms 12640 KB Output is correct
83 Incorrect 75 ms 20580 KB Output isn't correct
84 Correct 71 ms 13392 KB Output is correct
85 Correct 75 ms 23936 KB Output is correct
86 Incorrect 70 ms 12452 KB Output isn't correct
87 Correct 53 ms 5992 KB Output is correct
88 Correct 72 ms 16444 KB Output is correct
89 Correct 67 ms 10328 KB Output is correct
90 Correct 44 ms 8780 KB Output is correct
91 Correct 23 ms 9108 KB Output is correct
92 Correct 65 ms 12428 KB Output is correct
93 Correct 44 ms 11044 KB Output is correct
94 Incorrect 77 ms 12732 KB Output isn't correct
95 Correct 73 ms 21804 KB Output is correct
96 Correct 58 ms 10616 KB Output is correct
97 Correct 88 ms 26752 KB Output is correct
98 Correct 63 ms 12868 KB Output is correct
99 Correct 39 ms 7752 KB Output is correct
100 Incorrect 81 ms 17368 KB Output isn't correct
101 Correct 52 ms 6888 KB Output is correct
102 Correct 83 ms 25096 KB Output is correct