oj.uz

Submission #518527

# Submission time Handle Problem Language Result Execution time Memory
518527 2022-01-24T03:37:44 Z tabr Art Class (IOI13_artclass) C++17
87 / 100
 78 ms 5132 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}) < 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);
            }
        }
    }
    int cnt = 0;
    for (int i = 0; i < h * w; i++) {
        if (uf.get(i) == i) {
            cnt++;
        }
    }
    double ratio = 1.0 * cnt / (h * w);
    debug(ratio);
    if (ratio < 0.0001) {
        return 4;
    }
    if (ratio > 0.02) {
        return 3;
    }
    cnt = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (min({r[i][j], g[i][j], b[i][j]}) > 220) {
                cnt++;
            }
        }
    }
    ratio = 1.0 * cnt / (h * w);
    debug(ratio);
    if (ratio > 0.1) {
        return 1;
    } else {
        return 2;
    }
}

#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
87.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 4672 KB Output is correct
2 Correct 36 ms 4472 KB Output is correct
3 Incorrect 47 ms 4996 KB Output isn't correct
4 Incorrect 55 ms 5100 KB Output isn't correct
5 Correct 57 ms 5132 KB Output is correct
6 Correct 29 ms 2764 KB Output is correct
7 Correct 39 ms 3896 KB Output is correct
8 Incorrect 53 ms 5028 KB Output isn't correct
9 Correct 31 ms 4344 KB Output is correct
10 Incorrect 35 ms 4424 KB Output isn't correct
11 Correct 51 ms 5096 KB Output is correct
12 Correct 51 ms 4956 KB Output is correct
13 Incorrect 48 ms 4588 KB Output isn't correct
14 Correct 36 ms 3156 KB Output is correct
15 Correct 30 ms 4396 KB Output is correct
16 Correct 46 ms 3836 KB Output is correct
17 Incorrect 52 ms 5120 KB Output isn't correct
18 Correct 43 ms 4712 KB Output is correct
19 Correct 44 ms 4364 KB Output is correct
20 Correct 39 ms 4040 KB Output is correct
21 Correct 36 ms 4556 KB Output is correct
22 Correct 43 ms 4028 KB Output is correct
23 Correct 49 ms 4476 KB Output is correct
24 Correct 40 ms 4432 KB Output is correct
25 Correct 37 ms 4292 KB Output is correct
26 Correct 40 ms 3468 KB Output is correct
27 Incorrect 51 ms 5064 KB Output isn't correct
28 Correct 43 ms 4052 KB Output is correct
29 Correct 42 ms 4164 KB Output is correct
30 Correct 40 ms 3780 KB Output is correct
31 Correct 42 ms 4804 KB Output is correct
32 Correct 47 ms 4800 KB Output is correct
33 Correct 42 ms 4164 KB Output is correct
34 Correct 44 ms 4236 KB Output is correct
35 Correct 43 ms 4824 KB Output is correct
36 Correct 47 ms 4744 KB Output is correct
37 Correct 44 ms 4804 KB Output is correct
38 Correct 26 ms 2164 KB Output is correct
39 Correct 47 ms 4932 KB Output is correct
40 Correct 34 ms 4516 KB Output is correct
41 Correct 43 ms 4188 KB Output is correct
42 Correct 50 ms 5020 KB Output is correct
43 Correct 43 ms 4812 KB Output is correct
44 Correct 42 ms 4844 KB Output is correct
45 Correct 28 ms 2664 KB Output is correct
46 Correct 44 ms 4800 KB Output is correct
47 Incorrect 43 ms 4856 KB Output isn't correct
48 Correct 42 ms 4824 KB Output is correct
49 Correct 23 ms 2184 KB Output is correct
50 Correct 34 ms 4428 KB Output is correct
51 Correct 45 ms 4736 KB Output is correct
52 Correct 33 ms 4428 KB Output is correct
53 Correct 33 ms 3404 KB Output is correct
54 Correct 45 ms 4420 KB Output is correct
55 Correct 14 ms 3660 KB Output is correct
56 Correct 41 ms 3960 KB Output is correct
57 Correct 44 ms 4168 KB Output is correct
58 Incorrect 54 ms 5072 KB Output isn't correct
59 Correct 40 ms 4596 KB Output is correct
60 Correct 51 ms 5092 KB Output is correct
61 Incorrect 47 ms 4676 KB Output isn't correct
62 Correct 50 ms 4292 KB Output is correct
63 Incorrect 28 ms 4248 KB Output isn't correct
64 Correct 60 ms 4064 KB Output is correct
65 Correct 47 ms 4404 KB Output is correct
66 Correct 24 ms 2360 KB Output is correct
67 Correct 45 ms 4376 KB Output is correct
68 Incorrect 45 ms 4548 KB Output isn't correct
69 Correct 14 ms 1284 KB Output is correct
70 Correct 36 ms 3408 KB Output is correct
71 Correct 73 ms 5116 KB Output is correct
72 Correct 48 ms 4928 KB Output is correct
73 Correct 62 ms 4256 KB Output is correct
74 Correct 42 ms 3952 KB Output is correct
75 Correct 26 ms 4184 KB Output is correct
76 Correct 41 ms 2756 KB Output is correct
77 Incorrect 36 ms 4408 KB Output isn't correct
78 Correct 47 ms 3984 KB Output is correct
79 Correct 48 ms 4900 KB Output is correct
80 Incorrect 32 ms 2884 KB Output isn't correct
81 Correct 59 ms 5084 KB Output is correct
82 Correct 68 ms 4692 KB Output is correct
83 Correct 48 ms 4716 KB Output is correct
84 Correct 29 ms 2764 KB Output is correct
85 Correct 41 ms 4804 KB Output is correct
86 Correct 42 ms 3820 KB Output is correct
87 Correct 42 ms 4168 KB Output is correct
88 Correct 46 ms 4740 KB Output is correct
89 Correct 61 ms 4788 KB Output is correct
90 Correct 61 ms 4728 KB Output is correct
91 Correct 56 ms 4932 KB Output is correct
92 Incorrect 53 ms 5056 KB Output isn't correct
93 Correct 43 ms 4272 KB Output is correct
94 Correct 36 ms 4304 KB Output is correct
95 Correct 46 ms 4784 KB Output is correct
96 Correct 52 ms 4832 KB Output is correct
97 Correct 48 ms 4676 KB Output is correct
98 Correct 36 ms 4544 KB Output is correct
99 Correct 35 ms 3368 KB Output is correct
100 Incorrect 78 ms 5092 KB Output isn't correct
101 Correct 45 ms 4680 KB Output is correct
102 Correct 41 ms 4160 KB Output is correct