oj.uz

Submission #518533

# Submission time Handle Problem Language Result Execution time Memory
518533 2022-01-24T03:56:07 Z tabr Art Class (IOI13_artclass) C++17
71 / 100
 71 ms 5216 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 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.0001) {
        return 4;
    }
    if (ratio1 > 0.01) {
        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
71.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4804 KB Output is correct
2 Correct 34 ms 4312 KB Output is correct
3 Correct 27 ms 4184 KB Output is correct
4 Correct 39 ms 4464 KB Output is correct
5 Correct 47 ms 4188 KB Output is correct
6 Correct 34 ms 3368 KB Output is correct
7 Correct 42 ms 3908 KB Output is correct
8 Correct 51 ms 4996 KB Output is correct
9 Correct 29 ms 2720 KB Output is correct
10 Correct 43 ms 4804 KB Output is correct
11 Correct 37 ms 3404 KB Output is correct
12 Correct 46 ms 4712 KB Output is correct
13 Correct 47 ms 4764 KB Output is correct
14 Incorrect 29 ms 3012 KB Output isn't correct
15 Correct 50 ms 5060 KB Output is correct
16 Correct 43 ms 3916 KB Output is correct
17 Incorrect 43 ms 3992 KB Output isn't correct
18 Correct 60 ms 5056 KB Output is correct
19 Incorrect 29 ms 4272 KB Output isn't correct
20 Correct 50 ms 4272 KB Output is correct
21 Incorrect 49 ms 3988 KB Output isn't correct
22 Incorrect 47 ms 4424 KB Output isn't correct
23 Correct 44 ms 3140 KB Output is correct
24 Correct 71 ms 5000 KB Output is correct
25 Correct 20 ms 3656 KB Output is correct
26 Incorrect 34 ms 4304 KB Output isn't correct
27 Incorrect 54 ms 5156 KB Output isn't correct
28 Correct 39 ms 4400 KB Output is correct
29 Correct 47 ms 4828 KB Output is correct
30 Correct 12 ms 1228 KB Output is correct
31 Correct 41 ms 4164 KB Output is correct
32 Correct 41 ms 4628 KB Output is correct
33 Incorrect 43 ms 3864 KB Output isn't correct
34 Incorrect 43 ms 3872 KB Output isn't correct
35 Correct 51 ms 4904 KB Output is correct
36 Correct 46 ms 4284 KB Output is correct
37 Correct 43 ms 4816 KB Output is correct
38 Correct 34 ms 4428 KB Output is correct
39 Correct 43 ms 4820 KB Output is correct
40 Correct 45 ms 4468 KB Output is correct
41 Correct 33 ms 4396 KB Output is correct
42 Correct 45 ms 4620 KB Output is correct
43 Correct 45 ms 4776 KB Output is correct
44 Correct 44 ms 4780 KB Output is correct
45 Correct 49 ms 4796 KB Output is correct
46 Incorrect 52 ms 5072 KB Output isn't correct
47 Incorrect 49 ms 4996 KB Output isn't correct
48 Correct 61 ms 4692 KB Output is correct
49 Correct 35 ms 3304 KB Output is correct
50 Correct 52 ms 5052 KB Output is correct
51 Incorrect 49 ms 4804 KB Output isn't correct
52 Incorrect 59 ms 4352 KB Output isn't correct
53 Correct 45 ms 4120 KB Output is correct
54 Correct 46 ms 4300 KB Output is correct
55 Incorrect 42 ms 4032 KB Output isn't correct
56 Correct 38 ms 4704 KB Output is correct
57 Incorrect 52 ms 5104 KB Output isn't correct
58 Incorrect 45 ms 4544 KB Output isn't correct
59 Correct 49 ms 5008 KB Output is correct
60 Correct 55 ms 3804 KB Output is correct
61 Correct 30 ms 2784 KB Output is correct
62 Correct 43 ms 4624 KB Output is correct
63 Correct 39 ms 4484 KB Output is correct
64 Correct 37 ms 4524 KB Output is correct
65 Correct 43 ms 4800 KB Output is correct
66 Correct 36 ms 3220 KB Output is correct
67 Correct 46 ms 4060 KB Output is correct
68 Incorrect 51 ms 5152 KB Output isn't correct
69 Correct 32 ms 4352 KB Output is correct
70 Correct 56 ms 4420 KB Output is correct
71 Correct 43 ms 3808 KB Output is correct
72 Correct 54 ms 5140 KB Output is correct
73 Incorrect 43 ms 4716 KB Output isn't correct
74 Correct 64 ms 4008 KB Output is correct
75 Correct 50 ms 4368 KB Output is correct
76 Correct 24 ms 2272 KB Output is correct
77 Correct 46 ms 4804 KB Output is correct
78 Correct 46 ms 4932 KB Output is correct
79 Correct 52 ms 5040 KB Output is correct
80 Correct 34 ms 2328 KB Output is correct
81 Correct 45 ms 4776 KB Output is correct
82 Correct 44 ms 4300 KB Output is correct
83 Correct 41 ms 4668 KB Output is correct
84 Incorrect 56 ms 5168 KB Output isn't correct
85 Correct 46 ms 4796 KB Output is correct
86 Correct 43 ms 4128 KB Output is correct
87 Correct 47 ms 4352 KB Output is correct
88 Correct 53 ms 4900 KB Output is correct
89 Correct 48 ms 4796 KB Output is correct
90 Correct 40 ms 4092 KB Output is correct
91 Incorrect 27 ms 2756 KB Output isn't correct
92 Correct 36 ms 4308 KB Output is correct
93 Correct 36 ms 4292 KB Output is correct
94 Incorrect 52 ms 5096 KB Output isn't correct
95 Correct 49 ms 4848 KB Output is correct
96 Incorrect 33 ms 4396 KB Output isn't correct
97 Correct 29 ms 2768 KB Output is correct
98 Correct 54 ms 4324 KB Output is correct
99 Correct 26 ms 2200 KB Output is correct
100 Correct 44 ms 4884 KB Output is correct
101 Correct 63 ms 5128 KB Output is correct
102 Incorrect 54 ms 5216 KB Output isn't correct