oj.uz

Submission #518547

# Submission time Handle Problem Language Result Execution time Memory
518547 2022-01-24T04:27:56 Z tabr Art Class (IOI13_artclass) C++17
80 / 100
 79 ms 5128 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}) < 15) {
                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}) < 15) {
                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.09) {
        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
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 4804 KB Output is correct
2 Incorrect 44 ms 4036 KB Output isn't correct
3 Correct 34 ms 3140 KB Output is correct
4 Correct 42 ms 4704 KB Output is correct
5 Correct 42 ms 3872 KB Output is correct
6 Correct 64 ms 5036 KB Output is correct
7 Incorrect 34 ms 2896 KB Output isn't correct
8 Correct 39 ms 4608 KB Output is correct
9 Correct 49 ms 4932 KB Output is correct
10 Incorrect 46 ms 4756 KB Output isn't correct
11 Correct 39 ms 4372 KB Output is correct
12 Incorrect 45 ms 4292 KB Output isn't correct
13 Correct 43 ms 4036 KB Output is correct
14 Correct 42 ms 3980 KB Output is correct
15 Correct 33 ms 4484 KB Output is correct
16 Correct 31 ms 2764 KB Output is correct
17 Correct 42 ms 4780 KB Output is correct
18 Incorrect 46 ms 4824 KB Output isn't correct
19 Correct 30 ms 4264 KB Output is correct
20 Correct 44 ms 4164 KB Output is correct
21 Correct 35 ms 4384 KB Output is correct
22 Correct 44 ms 4120 KB Output is correct
23 Correct 46 ms 4292 KB Output is correct
24 Correct 41 ms 4168 KB Output is correct
25 Incorrect 52 ms 5072 KB Output isn't correct
26 Correct 60 ms 4900 KB Output is correct
27 Correct 55 ms 4548 KB Output is correct
28 Correct 37 ms 3524 KB Output is correct
29 Correct 37 ms 3412 KB Output is correct
30 Correct 79 ms 5056 KB Output is correct
31 Correct 48 ms 4344 KB Output is correct
32 Correct 32 ms 4304 KB Output is correct
33 Correct 52 ms 5056 KB Output is correct
34 Correct 53 ms 5060 KB Output is correct
35 Correct 46 ms 4804 KB Output is correct
36 Incorrect 34 ms 4352 KB Output isn't correct
37 Correct 40 ms 4556 KB Output is correct
38 Incorrect 46 ms 4900 KB Output isn't correct
39 Correct 47 ms 4796 KB Output is correct
40 Correct 59 ms 4812 KB Output is correct
41 Correct 52 ms 4908 KB Output is correct
42 Correct 52 ms 5092 KB Output is correct
43 Correct 45 ms 3944 KB Output is correct
44 Correct 27 ms 2344 KB Output is correct
45 Correct 46 ms 4300 KB Output is correct
46 Correct 45 ms 3784 KB Output is correct
47 Correct 51 ms 5060 KB Output is correct
48 Correct 31 ms 4300 KB Output is correct
49 Correct 48 ms 4940 KB Output is correct
50 Incorrect 47 ms 4932 KB Output isn't correct
51 Correct 45 ms 4804 KB Output is correct
52 Correct 45 ms 3924 KB Output is correct
53 Correct 38 ms 4292 KB Output is correct
54 Correct 12 ms 1228 KB Output is correct
55 Incorrect 46 ms 4544 KB Output isn't correct
56 Correct 44 ms 4740 KB Output is correct
57 Incorrect 42 ms 4044 KB Output isn't correct
58 Correct 26 ms 4080 KB Output is correct
59 Correct 57 ms 4332 KB Output is correct
60 Correct 43 ms 4548 KB Output is correct
61 Incorrect 41 ms 2692 KB Output isn't correct
62 Correct 46 ms 4096 KB Output is correct
63 Correct 51 ms 4800 KB Output is correct
64 Correct 52 ms 4968 KB Output is correct
65 Correct 45 ms 4672 KB Output is correct
66 Correct 41 ms 3916 KB Output is correct
67 Correct 17 ms 3588 KB Output is correct
68 Correct 25 ms 2216 KB Output is correct
69 Correct 43 ms 4792 KB Output is correct
70 Correct 45 ms 4164 KB Output is correct
71 Correct 36 ms 4360 KB Output is correct
72 Correct 51 ms 5060 KB Output is correct
73 Correct 29 ms 2756 KB Output is correct
74 Incorrect 41 ms 4784 KB Output isn't correct
75 Correct 45 ms 4676 KB Output is correct
76 Correct 55 ms 5072 KB Output is correct
77 Correct 56 ms 4804 KB Output is correct
78 Correct 45 ms 4444 KB Output is correct
79 Correct 45 ms 4660 KB Output is correct
80 Correct 60 ms 4268 KB Output is correct
81 Correct 51 ms 4748 KB Output is correct
82 Incorrect 43 ms 4768 KB Output isn't correct
83 Correct 45 ms 4292 KB Output is correct
84 Incorrect 47 ms 4364 KB Output isn't correct
85 Correct 45 ms 4884 KB Output is correct
86 Correct 53 ms 4824 KB Output is correct
87 Correct 36 ms 3276 KB Output is correct
88 Correct 54 ms 5072 KB Output is correct
89 Incorrect 55 ms 5128 KB Output isn't correct
90 Correct 55 ms 4848 KB Output is correct
91 Correct 30 ms 2764 KB Output is correct
92 Incorrect 44 ms 4584 KB Output isn't correct
93 Correct 46 ms 4248 KB Output is correct
94 Correct 35 ms 3432 KB Output is correct
95 Incorrect 35 ms 4528 KB Output isn't correct
96 Correct 53 ms 5060 KB Output is correct
97 Correct 47 ms 4484 KB Output is correct
98 Correct 35 ms 2192 KB Output is correct
99 Correct 51 ms 5024 KB Output is correct
100 Correct 50 ms 4800 KB Output is correct
101 Correct 45 ms 4164 KB Output is correct
102 Incorrect 44 ms 4036 KB Output isn't correct