oj.uz

Submission #518522

# Submission time Handle Problem Language Result Execution time Memory
518522 2022-01-24T03:23:22 Z tabr Art Class (IOI13_artclass) C++17
45 / 100
 91 ms 5168 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]) {
    double rs = 0;
    double gs = 0;
    double bs = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            rs += r[i][j];
            gs += g[i][j];
            bs += b[i][j];
        }
    }
    int x = h * w;
    dsu uf(x);
    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}) < 30) {
                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}) < 30) {
                uf.unite(i * w + j, i * w + j + w);
            }
        }
    }
    rs /= x;
    gs /= x;
    bs /= x;
    int cnt = 0;
    for (int i = 0; i < x; i++) {
        if (uf.get(i) == i) {
            cnt++;
        }
    }
    double ratio = 1.0 * cnt / x;
    debug(ratio);
    if (ratio < 0.0001) {
        return 4;
    }
    if (ratio > 0.02) {
        return 3;
    }
    if (gs > max(rs, bs) + 30) {
        return 2;
    } else {
        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
45.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 5144 KB Output is correct
2 Correct 49 ms 4832 KB Output is correct
3 Incorrect 46 ms 4828 KB Output isn't correct
4 Correct 36 ms 3408 KB Output is correct
5 Incorrect 45 ms 4636 KB Output isn't correct
6 Correct 49 ms 4588 KB Output is correct
7 Correct 31 ms 2784 KB Output is correct
8 Incorrect 37 ms 4544 KB Output isn't correct
9 Correct 31 ms 2780 KB Output is correct
10 Incorrect 43 ms 3908 KB Output isn't correct
11 Incorrect 49 ms 4960 KB Output isn't correct
12 Incorrect 43 ms 4796 KB Output isn't correct
13 Correct 46 ms 4772 KB Output is correct
14 Incorrect 42 ms 4036 KB Output isn't correct
15 Incorrect 43 ms 4300 KB Output isn't correct
16 Correct 25 ms 2192 KB Output is correct
17 Correct 52 ms 5072 KB Output is correct
18 Incorrect 53 ms 4480 KB Output isn't correct
19 Correct 71 ms 5040 KB Output is correct
20 Incorrect 58 ms 5020 KB Output isn't correct
21 Correct 46 ms 4636 KB Output is correct
22 Correct 40 ms 3768 KB Output is correct
23 Incorrect 41 ms 3932 KB Output isn't correct
24 Correct 55 ms 5064 KB Output is correct
25 Correct 46 ms 4868 KB Output is correct
26 Correct 24 ms 2376 KB Output is correct
27 Incorrect 44 ms 4896 KB Output isn't correct
28 Correct 50 ms 5168 KB Output is correct
29 Correct 44 ms 4164 KB Output is correct
30 Correct 54 ms 5052 KB Output is correct
31 Correct 47 ms 4292 KB Output is correct
32 Correct 46 ms 4804 KB Output is correct
33 Incorrect 44 ms 4272 KB Output isn't correct
34 Correct 77 ms 5092 KB Output is correct
35 Incorrect 40 ms 4036 KB Output isn't correct
36 Correct 31 ms 2756 KB Output is correct
37 Correct 49 ms 4824 KB Output is correct
38 Correct 41 ms 4820 KB Output is correct
39 Correct 47 ms 4388 KB Output is correct
40 Incorrect 34 ms 4424 KB Output isn't correct
41 Incorrect 91 ms 5164 KB Output isn't correct
42 Correct 44 ms 4752 KB Output is correct
43 Correct 34 ms 3196 KB Output is correct
44 Correct 46 ms 4804 KB Output is correct
45 Incorrect 42 ms 4140 KB Output isn't correct
46 Correct 41 ms 4216 KB Output is correct
47 Correct 43 ms 4004 KB Output is correct
48 Incorrect 52 ms 4368 KB Output isn't correct
49 Incorrect 44 ms 4344 KB Output isn't correct
50 Incorrect 42 ms 4808 KB Output isn't correct
51 Incorrect 34 ms 4164 KB Output isn't correct
52 Correct 44 ms 4644 KB Output is correct
53 Incorrect 46 ms 4124 KB Output isn't correct
54 Incorrect 43 ms 4268 KB Output isn't correct
55 Incorrect 40 ms 3972 KB Output isn't correct
56 Correct 53 ms 4804 KB Output is correct
57 Correct 41 ms 4712 KB Output is correct
58 Correct 41 ms 3824 KB Output is correct
59 Correct 33 ms 4328 KB Output is correct
60 Incorrect 41 ms 4464 KB Output isn't correct
61 Correct 38 ms 4556 KB Output is correct
62 Correct 39 ms 4700 KB Output is correct
63 Incorrect 39 ms 3908 KB Output isn't correct
64 Correct 40 ms 3524 KB Output is correct
65 Correct 30 ms 4300 KB Output is correct
66 Correct 31 ms 2876 KB Output is correct
67 Correct 33 ms 4420 KB Output is correct
68 Correct 47 ms 4748 KB Output is correct
69 Correct 53 ms 4960 KB Output is correct
70 Correct 54 ms 4828 KB Output is correct
71 Incorrect 53 ms 4748 KB Output isn't correct
72 Correct 47 ms 4848 KB Output is correct
73 Correct 26 ms 4156 KB Output is correct
74 Incorrect 55 ms 5124 KB Output isn't correct
75 Correct 35 ms 4448 KB Output is correct
76 Incorrect 43 ms 4268 KB Output isn't correct
77 Correct 48 ms 4924 KB Output is correct
78 Correct 48 ms 4848 KB Output is correct
79 Incorrect 44 ms 4748 KB Output isn't correct
80 Correct 56 ms 5092 KB Output is correct
81 Correct 32 ms 4448 KB Output is correct
82 Correct 12 ms 1288 KB Output is correct
83 Incorrect 36 ms 3360 KB Output isn't correct
84 Incorrect 46 ms 4244 KB Output isn't correct
85 Correct 28 ms 2796 KB Output is correct
86 Correct 48 ms 4900 KB Output is correct
87 Correct 35 ms 3264 KB Output is correct
88 Correct 38 ms 4460 KB Output is correct
89 Incorrect 52 ms 4520 KB Output isn't correct
90 Correct 35 ms 4464 KB Output is correct
91 Correct 61 ms 3948 KB Output is correct
92 Correct 36 ms 4548 KB Output is correct
93 Incorrect 41 ms 4064 KB Output isn't correct
94 Correct 24 ms 2268 KB Output is correct
95 Correct 65 ms 5064 KB Output is correct
96 Incorrect 43 ms 4164 KB Output isn't correct
97 Correct 31 ms 4312 KB Output is correct
98 Correct 53 ms 5064 KB Output is correct
99 Correct 39 ms 4488 KB Output is correct
100 Correct 55 ms 5024 KB Output is correct
101 Correct 15 ms 3660 KB Output is correct
102 Correct 45 ms 4624 KB Output is correct