oj.uz

Submission #597458

# Submission time Handle Problem Language Result Execution time Memory
597458 2022-07-16T04:28:00 Z skittles1412 Art Class (IOI13_artclass) C++17
98 / 100
 63 ms 6756 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;
        } else if (d < 45) {
            return 1;
        } else if (d < 90) {
            return 2;
        } else {
            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) {
        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
98.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 6416 KB Output isn't correct
2 Correct 34 ms 6348 KB Output is correct
3 Correct 13 ms 3916 KB Output is correct
4 Correct 34 ms 6304 KB Output is correct
5 Correct 47 ms 6328 KB Output is correct
6 Correct 50 ms 6288 KB Output is correct
7 Correct 48 ms 6364 KB Output is correct
8 Correct 36 ms 5272 KB Output is correct
9 Incorrect 49 ms 6416 KB Output isn't correct
10 Correct 44 ms 6388 KB Output is correct
11 Correct 54 ms 6756 KB Output is correct
12 Correct 43 ms 5952 KB Output is correct
13 Correct 43 ms 5764 KB Output is correct
14 Correct 46 ms 6004 KB Output is correct
15 Correct 59 ms 6288 KB Output is correct
16 Correct 39 ms 6444 KB Output is correct
17 Incorrect 54 ms 6284 KB Output isn't correct
18 Correct 29 ms 4908 KB Output is correct
19 Correct 47 ms 5976 KB Output is correct
20 Correct 50 ms 6420 KB Output is correct
21 Correct 44 ms 6336 KB Output is correct
22 Correct 60 ms 5764 KB Output is correct
23 Correct 37 ms 6308 KB Output is correct
24 Correct 58 ms 6324 KB Output is correct
25 Correct 23 ms 4528 KB Output is correct
26 Correct 44 ms 6368 KB Output is correct
27 Correct 48 ms 6416 KB Output is correct
28 Correct 45 ms 6396 KB Output is correct
29 Correct 24 ms 4728 KB Output is correct
30 Correct 47 ms 6380 KB Output is correct
31 Correct 38 ms 6328 KB Output is correct
32 Correct 42 ms 5696 KB Output is correct
33 Correct 46 ms 6028 KB Output is correct
34 Incorrect 45 ms 5724 KB Output isn't correct
35 Correct 30 ms 4984 KB Output is correct
36 Correct 46 ms 6356 KB Output is correct
37 Correct 47 ms 6436 KB Output is correct
38 Correct 47 ms 6416 KB Output is correct
39 Correct 51 ms 6368 KB Output is correct
40 Correct 44 ms 6348 KB Output is correct
41 Correct 51 ms 6048 KB Output is correct
42 Correct 40 ms 6452 KB Output is correct
43 Correct 63 ms 5892 KB Output is correct
44 Correct 44 ms 6348 KB Output is correct
45 Correct 30 ms 4872 KB Output is correct
46 Correct 47 ms 5868 KB Output is correct
47 Correct 51 ms 5660 KB Output is correct
48 Correct 43 ms 6344 KB Output is correct
49 Correct 43 ms 6368 KB Output is correct
50 Incorrect 46 ms 5844 KB Output isn't correct
51 Correct 39 ms 6384 KB Output is correct
52 Correct 52 ms 6304 KB Output is correct
53 Incorrect 52 ms 5676 KB Output isn't correct
54 Correct 39 ms 5592 KB Output is correct
55 Correct 29 ms 6384 KB Output is correct
56 Correct 34 ms 6348 KB Output is correct
57 Incorrect 40 ms 5560 KB Output isn't correct
58 Correct 54 ms 6280 KB Output is correct
59 Correct 37 ms 5292 KB Output is correct
60 Correct 41 ms 5588 KB Output is correct
61 Correct 45 ms 5748 KB Output is correct
62 Correct 44 ms 6348 KB Output is correct
63 Correct 32 ms 6300 KB Output is correct
64 Incorrect 43 ms 5688 KB Output isn't correct
65 Correct 54 ms 6284 KB Output is correct
66 Correct 55 ms 6404 KB Output is correct
67 Correct 45 ms 5952 KB Output is correct
68 Correct 44 ms 5048 KB Output is correct
69 Correct 43 ms 6372 KB Output is correct
70 Correct 36 ms 5260 KB Output is correct
71 Correct 35 ms 6428 KB Output is correct
72 Correct 29 ms 4940 KB Output is correct
73 Correct 37 ms 6340 KB Output is correct
74 Correct 39 ms 6304 KB Output is correct
75 Correct 54 ms 6396 KB Output is correct
76 Correct 48 ms 5900 KB Output is correct
77 Correct 45 ms 6336 KB Output is correct
78 Correct 53 ms 6348 KB Output is correct
79 Correct 41 ms 5744 KB Output is correct
80 Correct 43 ms 6484 KB Output is correct
81 Correct 49 ms 5964 KB Output is correct
82 Correct 44 ms 5840 KB Output is correct
83 Incorrect 53 ms 6360 KB Output isn't correct
84 Correct 14 ms 6228 KB Output is correct
85 Correct 37 ms 5312 KB Output is correct
86 Incorrect 49 ms 5688 KB Output isn't correct
87 Correct 47 ms 5852 KB Output is correct
88 Correct 55 ms 6324 KB Output is correct
89 Correct 26 ms 4656 KB Output is correct
90 Incorrect 47 ms 5984 KB Output isn't correct
91 Correct 60 ms 6408 KB Output is correct
92 Correct 61 ms 6384 KB Output is correct
93 Correct 53 ms 5888 KB Output is correct
94 Correct 38 ms 6344 KB Output is correct
95 Correct 45 ms 6316 KB Output is correct
96 Correct 54 ms 6344 KB Output is correct
97 Correct 61 ms 6360 KB Output is correct
98 Correct 46 ms 6388 KB Output is correct
99 Correct 44 ms 6376 KB Output is correct
100 Correct 37 ms 5196 KB Output is correct
101 Correct 37 ms 6348 KB Output is correct
102 Correct 53 ms 6316 KB Output is correct