oj.uz

Submission #413599

# Submission time Handle Problem Language Result Execution time Memory
413599 2021-05-29T03:54:49 Z KoD Art Class (IOI13_artclass) C++17
91 / 100
 94 ms 10604 KB 
#include <bits/stdc++.h>
#include "artclass.h"

template <class T> using Vec = std::vector<T>;

struct UnionFind {
    Vec<int> par;
    int comp;
    UnionFind(const int n): par(n, -1), comp(n) {}
    int find(const int u) {
        return par[u] < 0 ? u : par[u] = find(par[u]);
    }    
    void merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return;
        }
        if (par[x] > par[y]) {
            std::swap(x, y);
        }
        par[x] += par[y];
        par[y] = x;
        comp -= 1;
    }
};

int solve(const int N, const Vec<int> R, const Vec<int> G, const Vec<int> B, const std::array<int, 4> D) {
    UnionFind dsu(N);
    for (int i = 0; i < N; ++i) {
        for (int k = 0; k < 4; ++k) {
            const auto j = i + D[k];
            if (0 <= j and j < N) {
                if (std::abs(R[i] - R[j]) <= 20 and std::abs(G[i] - G[j]) <= 20 and std::abs(B[i] - B[j]) <= 20) {
                    dsu.merge(i, j);
                }
            }
        }
    }
    int white = 0;
    for (int i = 0; i < N; ++i) {
        if (R[i] >= 200 and G[i] >= 200 and B[i] >= 200) {
            white += 1;
        }
    }
    if ((double) white / N >= 0.3) {
        return 1;
    }
    if ((double) dsu.comp / N >= 0.19) {
        return 3;
    }
    if ((double) dsu.comp / N <= 0.0003) {
        return 4;
    }
    if ((double) white / N >= 0.1 and (double) dsu.comp / N >= 0.1) {
        return 3;
    }
    if ((double) dsu.comp / N <= 0.006) {
        return 4;
    }
    // std::cerr << std::fixed << std::setprecision(10);
    // std::cerr << (double) dsu.comp / N << ' ' << (double) white / N << std::endl;
    return 2;
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    const int N = H * W;
    Vec<int> r(N), g(N), b(N);
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            r[i * W + j] = R[i][j];
            g[i * W + j] = G[i][j];
            b[i * W + j] = B[i][j];
        }
    }
    return solve(N, r, g, b, std::array<int, 4>{W, 1, -W, -1});
}

Subtask #1
91.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 9284 KB Output is correct
2 Correct 61 ms 9252 KB Output is correct
3 Correct 60 ms 9484 KB Output is correct
4 Correct 72 ms 10396 KB Output is correct
5 Correct 60 ms 9208 KB Output is correct
6 Correct 60 ms 9340 KB Output is correct
7 Correct 45 ms 7700 KB Output is correct
8 Correct 70 ms 9140 KB Output is correct
9 Correct 42 ms 5532 KB Output is correct
10 Correct 42 ms 5452 KB Output is correct
11 Incorrect 64 ms 9404 KB Output isn't correct
12 Correct 58 ms 8648 KB Output is correct
13 Correct 64 ms 8536 KB Output is correct
14 Correct 42 ms 5468 KB Output is correct
15 Correct 63 ms 9284 KB Output is correct
16 Correct 73 ms 10448 KB Output is correct
17 Incorrect 76 ms 10436 KB Output isn't correct
18 Correct 71 ms 10528 KB Output is correct
19 Correct 43 ms 7620 KB Output is correct
20 Correct 36 ms 6712 KB Output is correct
21 Correct 73 ms 10088 KB Output is correct
22 Incorrect 50 ms 7976 KB Output isn't correct
23 Incorrect 41 ms 6008 KB Output isn't correct
24 Correct 72 ms 10404 KB Output is correct
25 Correct 34 ms 4676 KB Output is correct
26 Correct 59 ms 9272 KB Output is correct
27 Correct 69 ms 9412 KB Output is correct
28 Correct 68 ms 8928 KB Output is correct
29 Correct 59 ms 8260 KB Output is correct
30 Correct 75 ms 10452 KB Output is correct
31 Correct 63 ms 9220 KB Output is correct
32 Correct 65 ms 8664 KB Output is correct
33 Correct 65 ms 9972 KB Output is correct
34 Correct 53 ms 8388 KB Output is correct
35 Correct 67 ms 9972 KB Output is correct
36 Incorrect 66 ms 9312 KB Output isn't correct
37 Correct 50 ms 8388 KB Output is correct
38 Correct 62 ms 8316 KB Output is correct
39 Correct 56 ms 8008 KB Output is correct
40 Correct 54 ms 8448 KB Output is correct
41 Correct 63 ms 6728 KB Output is correct
42 Correct 58 ms 9172 KB Output is correct
43 Correct 76 ms 10488 KB Output is correct
44 Correct 66 ms 9128 KB Output is correct
45 Correct 61 ms 9268 KB Output is correct
46 Correct 66 ms 9456 KB Output is correct
47 Incorrect 62 ms 8884 KB Output isn't correct
48 Correct 59 ms 7836 KB Output is correct
49 Correct 52 ms 8452 KB Output is correct
50 Correct 46 ms 8040 KB Output is correct
51 Correct 62 ms 8552 KB Output is correct
52 Correct 82 ms 9528 KB Output is correct
53 Correct 57 ms 8260 KB Output is correct
54 Correct 66 ms 9128 KB Output is correct
55 Correct 68 ms 8988 KB Output is correct
56 Correct 63 ms 9668 KB Output is correct
57 Correct 57 ms 9196 KB Output is correct
58 Correct 76 ms 8772 KB Output is correct
59 Correct 53 ms 8204 KB Output is correct
60 Correct 60 ms 8260 KB Output is correct
61 Incorrect 64 ms 9756 KB Output isn't correct
62 Correct 50 ms 7032 KB Output is correct
63 Correct 32 ms 4444 KB Output is correct
64 Incorrect 62 ms 7956 KB Output isn't correct
65 Correct 56 ms 9028 KB Output is correct
66 Correct 64 ms 9172 KB Output is correct
67 Correct 73 ms 10564 KB Output is correct
68 Incorrect 72 ms 10512 KB Output isn't correct
69 Correct 42 ms 7364 KB Output is correct
70 Correct 59 ms 8060 KB Output is correct
71 Correct 59 ms 8292 KB Output is correct
72 Correct 47 ms 7052 KB Output is correct
73 Correct 63 ms 8728 KB Output is correct
74 Correct 55 ms 8608 KB Output is correct
75 Correct 59 ms 9288 KB Output is correct
76 Correct 71 ms 10180 KB Output is correct
77 Correct 32 ms 4376 KB Output is correct
78 Correct 62 ms 8952 KB Output is correct
79 Correct 63 ms 8504 KB Output is correct
80 Incorrect 78 ms 10604 KB Output isn't correct
81 Correct 52 ms 7188 KB Output is correct
82 Correct 42 ms 5488 KB Output is correct
83 Correct 63 ms 9416 KB Output is correct
84 Incorrect 63 ms 9412 KB Output isn't correct
85 Correct 49 ms 7596 KB Output is correct
86 Correct 58 ms 8124 KB Output is correct
87 Correct 46 ms 7876 KB Output is correct
88 Correct 48 ms 7844 KB Output is correct
89 Incorrect 72 ms 10596 KB Output isn't correct
90 Correct 65 ms 8848 KB Output is correct
91 Correct 94 ms 10540 KB Output is correct
92 Correct 64 ms 8944 KB Output is correct
93 Incorrect 71 ms 9972 KB Output isn't correct
94 Correct 57 ms 8420 KB Output is correct
95 Correct 17 ms 2540 KB Output is correct
96 Incorrect 78 ms 10440 KB Output isn't correct
97 Correct 53 ms 6764 KB Output is correct
98 Correct 21 ms 5084 KB Output is correct
99 Correct 63 ms 9432 KB Output is correct
100 Correct 60 ms 8132 KB Output is correct
101 Correct 63 ms 9092 KB Output is correct
102 Correct 66 ms 9292 KB Output is correct