oj.uz

Submission #518545

# Submission time Handle Problem Language Result Execution time Memory
518545 2022-01-24T04:22:39 Z tabr Art Class (IOI13_artclass) C++17
96 / 100
 63 ms 5184 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

#ifndef tabr
#include "artclass.h"
#endif

struct dsu {
    vector<int> p;
    vector<int> sz;
    int n;

    dsu(int _n) : n(_n) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
        sz.assign(n, 1);
    }

    inline int get(int x) {
        if (p[x] == x) {
            return x;
        } else {
            return p[x] = get(p[x]);
        }
    }

    inline bool unite(int x, int y) {
        x = get(x);
        y = get(y);
        if (x == y) {
            return false;
        }
        if (sz[x] > sz[y]) {
            swap(x, y);
        }
        p[x] = y;
        sz[y] += sz[x];
        return true;
    }

    inline bool same(int x, int y) {
        return (get(x) == get(y));
    }
};

int style(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
    dsu uf(h * w);
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w - 1; j++) {
            int dr = abs(r[i][j] - r[i][j + 1]);
            int dg = abs(g[i][j] - g[i][j + 1]);
            int db = abs(b[i][j] - b[i][j + 1]);
            if (min({dr, dg, db}) < 20) {
                uf.unite(i * w + j, i * w + j + 1);
            }
        }
    }
    for (int i = 0; i < h - 1; i++) {
        for (int j = 0; j < w; j++) {
            int dr = abs(r[i][j] - r[i + 1][j]);
            int dg = abs(g[i][j] - g[i + 1][j]);
            int db = abs(b[i][j] - b[i + 1][j]);
            if (min({dr, dg, db}) < 20) {
                uf.unite(i * w + j, i * w + j + w);
            }
        }
    }
    int cnt = 0;
    for (int i = 0; i < h * w; i++) {
        if (uf.get(i) == i) {
            cnt++;
        }
    }
    double ratio1 = 1.0 * cnt / (h * w);
    cnt = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            int dr = abs(r[i][j] - 130);
            int dg = abs(g[i][j] - 100);
            int db = abs(b[i][j] - 50);
            if (max({dr, dg, db}) < 20) {
                cnt++;
            }
        }
    }
    double ratio2 = 1.0 * cnt / (h * w);
    debug(ratio1);
    debug(ratio2);
    if (ratio1 < 0.00005) {
        return 4;
    }
    if (ratio1 > 0.05) {
        return 3;
    }
    if (ratio2 > 0.01) {
        return 2;
    }
    return 1;
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h, w;
    cin >> h >> w;
    int r[500][500];
    int g[500][500];
    int b[500][500];
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            cin >> r[i][j] >> g[i][j] >> b[i][j];
        }
    }
    cout << style(h, w, r, g, b) << '\n';
    return 0;
}
#endif

Subtask #1
96.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4008 KB Output is correct
2 Incorrect 28 ms 2888 KB Output isn't correct
3 Correct 44 ms 4188 KB Output is correct
4 Correct 35 ms 3304 KB Output is correct
5 Correct 40 ms 4200 KB Output is correct
6 Correct 33 ms 2220 KB Output is correct
7 Correct 38 ms 4500 KB Output is correct
8 Correct 48 ms 4900 KB Output is correct
9 Correct 52 ms 4864 KB Output is correct
10 Correct 60 ms 4804 KB Output is correct
11 Correct 50 ms 4716 KB Output is correct
12 Correct 34 ms 4392 KB Output is correct
13 Correct 36 ms 4172 KB Output is correct
14 Incorrect 46 ms 4584 KB Output isn't correct
15 Incorrect 47 ms 4768 KB Output isn't correct
16 Correct 43 ms 4696 KB Output is correct
17 Correct 53 ms 5144 KB Output is correct
18 Correct 14 ms 3660 KB Output is correct
19 Incorrect 48 ms 4476 KB Output isn't correct
20 Correct 33 ms 4380 KB Output is correct
21 Correct 40 ms 3420 KB Output is correct
22 Correct 28 ms 2764 KB Output is correct
23 Correct 57 ms 5056 KB Output is correct
24 Correct 49 ms 4936 KB Output is correct
25 Incorrect 41 ms 3976 KB Output isn't correct
26 Correct 44 ms 4804 KB Output is correct
27 Correct 51 ms 5056 KB Output is correct
28 Correct 55 ms 4896 KB Output is correct
29 Correct 45 ms 4344 KB Output is correct
30 Correct 47 ms 4932 KB Output is correct
31 Correct 63 ms 4752 KB Output is correct
32 Correct 45 ms 3956 KB Output is correct
33 Correct 40 ms 3808 KB Output is correct
34 Correct 45 ms 4760 KB Output is correct
35 Correct 43 ms 4060 KB Output is correct
36 Correct 44 ms 4336 KB Output is correct
37 Incorrect 45 ms 4772 KB Output isn't correct
38 Correct 45 ms 4200 KB Output is correct
39 Correct 49 ms 4408 KB Output is correct
40 Correct 45 ms 4488 KB Output is correct
41 Correct 46 ms 4304 KB Output is correct
42 Incorrect 58 ms 5116 KB Output isn't correct
43 Correct 31 ms 4304 KB Output is correct
44 Correct 42 ms 3956 KB Output is correct
45 Correct 60 ms 4728 KB Output is correct
46 Correct 51 ms 5060 KB Output is correct
47 Correct 36 ms 4288 KB Output is correct
48 Correct 48 ms 4344 KB Output is correct
49 Correct 42 ms 4820 KB Output is correct
50 Correct 57 ms 5072 KB Output is correct
51 Incorrect 45 ms 4360 KB Output isn't correct
52 Correct 44 ms 4292 KB Output is correct
53 Correct 50 ms 4952 KB Output is correct
54 Correct 56 ms 4980 KB Output is correct
55 Correct 43 ms 4164 KB Output is correct
56 Correct 41 ms 4072 KB Output is correct
57 Correct 51 ms 5072 KB Output is correct
58 Correct 42 ms 4744 KB Output is correct
59 Correct 30 ms 4232 KB Output is correct
60 Incorrect 48 ms 4784 KB Output isn't correct
61 Correct 48 ms 4932 KB Output is correct
62 Correct 58 ms 5164 KB Output is correct
63 Correct 40 ms 4456 KB Output is correct
64 Correct 44 ms 4884 KB Output is correct
65 Correct 36 ms 4300 KB Output is correct
66 Correct 52 ms 4688 KB Output is correct
67 Correct 49 ms 4732 KB Output is correct
68 Correct 44 ms 4688 KB Output is correct
69 Incorrect 31 ms 2892 KB Output isn't correct
70 Correct 42 ms 4548 KB Output is correct
71 Correct 43 ms 4680 KB Output is correct
72 Correct 32 ms 2248 KB Output is correct
73 Correct 31 ms 4244 KB Output is correct
74 Correct 52 ms 5184 KB Output is correct
75 Correct 44 ms 4320 KB Output is correct
76 Correct 40 ms 4724 KB Output is correct
77 Incorrect 44 ms 4800 KB Output isn't correct
78 Correct 32 ms 2796 KB Output is correct
79 Correct 43 ms 4788 KB Output is correct
80 Incorrect 44 ms 3924 KB Output isn't correct
81 Correct 39 ms 3212 KB Output is correct
82 Correct 47 ms 4828 KB Output is correct
83 Correct 46 ms 4824 KB Output is correct
84 Correct 36 ms 4484 KB Output is correct
85 Correct 45 ms 4036 KB Output is correct
86 Correct 37 ms 3408 KB Output is correct
87 Correct 25 ms 2392 KB Output is correct
88 Correct 35 ms 4468 KB Output is correct
89 Correct 47 ms 3884 KB Output is correct
90 Correct 38 ms 3440 KB Output is correct
91 Correct 47 ms 4336 KB Output is correct
92 Correct 34 ms 4420 KB Output is correct
93 Correct 47 ms 4544 KB Output is correct
94 Correct 55 ms 5140 KB Output is correct
95 Correct 30 ms 2764 KB Output is correct
96 Correct 52 ms 5008 KB Output is correct
97 Correct 59 ms 3780 KB Output is correct
98 Correct 51 ms 5060 KB Output is correct
99 Correct 49 ms 4408 KB Output is correct
100 Correct 55 ms 5164 KB Output is correct
101 Correct 17 ms 1200 KB Output is correct
102 Correct 41 ms 4052 KB Output is correct