oj.uz

Submission #518529

# Submission time Handle Problem Language Result Execution time Memory
518529 2022-01-24T03:46:02 Z tabr Art Class (IOI13_artclass) C++17
78 / 100
 65 ms 5164 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;
    }
    cnt = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (max({r[i][j], g[i][j], b[i][j]}) < 20) {
                cnt++;
            }
        }
    }
    debug(ratio);
    if (ratio > 0.01) {
        return 1;
    }
    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
78.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4892 KB Output is correct
2 Correct 51 ms 5052 KB Output is correct
3 Correct 47 ms 4156 KB Output is correct
4 Correct 37 ms 3456 KB Output is correct
5 Correct 53 ms 5000 KB Output is correct
6 Correct 42 ms 4676 KB Output is correct
7 Incorrect 52 ms 5116 KB Output isn't correct
8 Correct 47 ms 4788 KB Output is correct
9 Correct 45 ms 4416 KB Output is correct
10 Incorrect 47 ms 4800 KB Output isn't correct
11 Correct 46 ms 4772 KB Output is correct
12 Incorrect 48 ms 4552 KB Output isn't correct
13 Correct 52 ms 5044 KB Output is correct
14 Correct 34 ms 4296 KB Output is correct
15 Correct 28 ms 4100 KB Output is correct
16 Correct 59 ms 3980 KB Output is correct
17 Correct 45 ms 4056 KB Output is correct
18 Correct 40 ms 4112 KB Output is correct
19 Correct 43 ms 4704 KB Output is correct
20 Correct 49 ms 4904 KB Output is correct
21 Correct 55 ms 4788 KB Output is correct
22 Correct 39 ms 4292 KB Output is correct
23 Incorrect 51 ms 5164 KB Output isn't correct
24 Correct 12 ms 1228 KB Output is correct
25 Correct 41 ms 4052 KB Output is correct
26 Correct 42 ms 4744 KB Output is correct
27 Correct 42 ms 4676 KB Output is correct
28 Correct 22 ms 2176 KB Output is correct
29 Incorrect 51 ms 5080 KB Output isn't correct
30 Correct 37 ms 4508 KB Output is correct
31 Correct 49 ms 5016 KB Output is correct
32 Correct 26 ms 2372 KB Output is correct
33 Incorrect 34 ms 4368 KB Output isn't correct
34 Incorrect 52 ms 5104 KB Output isn't correct
35 Correct 47 ms 4732 KB Output is correct
36 Correct 33 ms 2756 KB Output is correct
37 Correct 41 ms 4544 KB Output is correct
38 Correct 42 ms 3904 KB Output is correct
39 Correct 28 ms 2800 KB Output is correct
40 Correct 45 ms 4164 KB Output is correct
41 Correct 44 ms 4288 KB Output is correct
42 Incorrect 45 ms 4780 KB Output isn't correct
43 Correct 50 ms 4628 KB Output is correct
44 Correct 50 ms 5060 KB Output is correct
45 Correct 23 ms 2200 KB Output is correct
46 Correct 43 ms 4656 KB Output is correct
47 Correct 42 ms 3828 KB Output is correct
48 Correct 61 ms 5156 KB Output is correct
49 Correct 18 ms 3700 KB Output is correct
50 Incorrect 30 ms 2868 KB Output isn't correct
51 Correct 43 ms 4688 KB Output is correct
52 Incorrect 43 ms 4764 KB Output isn't correct
53 Correct 47 ms 4420 KB Output is correct
54 Incorrect 45 ms 4088 KB Output isn't correct
55 Correct 43 ms 4548 KB Output is correct
56 Correct 54 ms 4804 KB Output is correct
57 Correct 55 ms 4904 KB Output is correct
58 Correct 39 ms 4444 KB Output is correct
59 Incorrect 46 ms 4728 KB Output isn't correct
60 Correct 43 ms 4292 KB Output is correct
61 Correct 50 ms 5060 KB Output is correct
62 Incorrect 29 ms 4284 KB Output isn't correct
63 Correct 45 ms 4676 KB Output is correct
64 Correct 39 ms 4676 KB Output is correct
65 Correct 36 ms 4420 KB Output is correct
66 Correct 65 ms 4804 KB Output is correct
67 Correct 55 ms 4856 KB Output is correct
68 Correct 42 ms 4732 KB Output is correct
69 Correct 52 ms 5148 KB Output is correct
70 Correct 45 ms 2688 KB Output is correct
71 Correct 47 ms 4892 KB Output is correct
72 Incorrect 47 ms 4436 KB Output isn't correct
73 Correct 33 ms 3408 KB Output is correct
74 Incorrect 42 ms 3968 KB Output isn't correct
75 Correct 33 ms 4460 KB Output is correct
76 Correct 30 ms 2736 KB Output is correct
77 Correct 52 ms 5148 KB Output is correct
78 Correct 35 ms 4396 KB Output is correct
79 Correct 35 ms 3204 KB Output is correct
80 Correct 39 ms 4452 KB Output is correct
81 Incorrect 45 ms 4384 KB Output isn't correct
82 Correct 46 ms 4368 KB Output is correct
83 Correct 35 ms 3212 KB Output is correct
84 Incorrect 50 ms 4928 KB Output isn't correct
85 Correct 44 ms 3900 KB Output is correct
86 Correct 44 ms 4288 KB Output is correct
87 Incorrect 35 ms 4456 KB Output isn't correct
88 Correct 41 ms 4008 KB Output is correct
89 Correct 52 ms 5032 KB Output is correct
90 Correct 42 ms 4164 KB Output is correct
91 Correct 42 ms 3788 KB Output is correct
92 Correct 43 ms 4804 KB Output is correct
93 Correct 36 ms 4444 KB Output is correct
94 Correct 42 ms 4076 KB Output is correct
95 Correct 36 ms 3404 KB Output is correct
96 Correct 46 ms 4292 KB Output is correct
97 Correct 34 ms 4340 KB Output is correct
98 Correct 46 ms 4920 KB Output is correct
99 Correct 41 ms 4100 KB Output is correct
100 Incorrect 46 ms 4544 KB Output isn't correct
101 Incorrect 53 ms 5156 KB Output isn't correct
102 Correct 38 ms 3992 KB Output is correct