oj.uz

Submission #658013

# Submission time Handle Problem Language Result Execution time Memory
658013 2022-11-11T20:23:06 Z cristi_a Art Class (IOI13_artclass) C++17
76 / 100
 78 ms 4268 KB 
#include <bits/stdc++.h>
#include "artclass.h"
using namespace std;

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    int area = H * W;

    int nonclr = 0;
    int green = 0;
    for(int i=0; i<H; i++)
        for(int j=0; j<W; j++) {
            int r = R[i][j], g = G[i][j], b = B[i][j];
            if(abs(r-g) < 13 and abs(r-b) < 13 and abs(b-g) < 13) nonclr++;

            if((g-r) + (g-b) >= 20 and g-r > -10 and g-b > -10) green++;
        }
    double non_color_percent = ((1.00 * nonclr) / (1.00 * area)) * 100.00;
    double green_percent = (1.00 * green) / (1.00 * area) * 100.00;

    static const double sigmaB = 30;
    static const double sigmaN = 65;
    static const int dx[] = {0, 0, -1, 1};
    static const int dy[] = {1, -1, 0, 0};

    auto in = [&](int a, int b) {
        if(a < 0 or a >= H or b < 0 or b >= W) return false;
        return true;
    };

    bool viz[500][500];
    auto BFS = [&](double sigma) {
        for(int i=0; i<H; i++)
            for(int j=0; j<W; j++)
                viz[i][j] = false;
        queue<pair<int, int>> q;
        int cnt = 0;
        for(int i=0; i<H; i++)
            for(int j=0; j<W; j++) {
                if(viz[i][j]) continue;

                cnt++;
                q.emplace(i, j);
                viz[i][j] = true;
                while(q.empty() == false) {
                    int x, y; tie(x, y) = q.front(); q.pop();
                    for(int k=0; k<4; k++) {
                        int nx = x + dx[k];
                        int ny = y + dy[k];
                        if(!in(nx, ny) or viz[nx][ny]) continue;

                        /*int dif =   abs(R[x][y] - R[nx][ny]) +
                                    abs(G[x][y] - G[nx][ny]) +
                                    abs(B[x][y] - B[nx][ny]);*/
                        int difr = abs(R[x][y] - R[nx][ny]);
                        int difg = abs(G[x][y] - G[nx][ny]);
                        int difb = abs(R[x][y] - R[nx][ny]);
                        double avg = 1.00 * (difr + difg + difb) / 3.00;
                        if(avg <= sigma) {
                            q.emplace(nx, ny);
                            viz[nx][ny] = true;
                        }
                    }
                }
            }
        return cnt;
    };

    int blocks = BFS(sigmaB);
    int nuances = BFS(sigmaN);

    /*cout << "blocks: " << blocks << "\n";
    cout << "nuances: " << nuances << "\n";
    cout << "non_color: " << non_color_percent << "\n";
    cout << "green: " << green_percent << "\n";
    cout << "green: " << green << "\n";*/

    if(blocks <= 180 and non_color_percent >= 30.00) return 1;
    if(non_color_percent >= 60.00 and blocks <= 3000) return 1;
    if(green_percent >= 25.00 and blocks <= 2000 and blocks >= 100) return 2;
    if(nuances <= 50) return 4;
    return 3;
}

Subtask #1
76.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 3344 KB Output is correct
2 Correct 32 ms 2300 KB Output is correct
3 Correct 59 ms 4152 KB Output is correct
4 Correct 68 ms 4124 KB Output is correct
5 Correct 64 ms 3932 KB Output is correct
6 Incorrect 74 ms 4220 KB Output isn't correct
7 Incorrect 58 ms 3276 KB Output isn't correct
8 Incorrect 53 ms 3500 KB Output isn't correct
9 Correct 47 ms 3876 KB Output is correct
10 Correct 36 ms 2636 KB Output is correct
11 Correct 34 ms 3972 KB Output is correct
12 Correct 34 ms 2124 KB Output is correct
13 Correct 49 ms 3224 KB Output is correct
14 Correct 43 ms 3976 KB Output is correct
15 Correct 49 ms 4144 KB Output is correct
16 Correct 49 ms 4132 KB Output is correct
17 Correct 61 ms 3532 KB Output is correct
18 Correct 55 ms 3140 KB Output is correct
19 Correct 51 ms 4212 KB Output is correct
20 Correct 61 ms 3948 KB Output is correct
21 Incorrect 49 ms 3468 KB Output isn't correct
22 Correct 50 ms 3880 KB Output is correct
23 Correct 48 ms 3964 KB Output is correct
24 Correct 56 ms 4172 KB Output is correct
25 Incorrect 54 ms 3892 KB Output isn't correct
26 Correct 54 ms 3964 KB Output is correct
27 Correct 51 ms 3972 KB Output is correct
28 Correct 15 ms 1576 KB Output is correct
29 Correct 54 ms 3480 KB Output is correct
30 Correct 54 ms 4144 KB Output is correct
31 Incorrect 54 ms 3440 KB Output isn't correct
32 Incorrect 38 ms 3968 KB Output isn't correct
33 Correct 52 ms 3112 KB Output is correct
34 Correct 59 ms 3984 KB Output is correct
35 Correct 58 ms 4044 KB Output is correct
36 Incorrect 59 ms 4180 KB Output isn't correct
37 Incorrect 16 ms 3924 KB Output isn't correct
38 Incorrect 63 ms 4224 KB Output isn't correct
39 Incorrect 49 ms 3164 KB Output isn't correct
40 Incorrect 48 ms 3328 KB Output isn't correct
41 Correct 46 ms 2768 KB Output is correct
42 Correct 60 ms 3948 KB Output is correct
43 Correct 35 ms 3896 KB Output is correct
44 Correct 53 ms 4172 KB Output is correct
45 Correct 40 ms 2652 KB Output is correct
46 Correct 29 ms 3976 KB Output is correct
47 Correct 54 ms 3660 KB Output is correct
48 Correct 44 ms 3896 KB Output is correct
49 Correct 49 ms 3908 KB Output is correct
50 Correct 63 ms 4124 KB Output is correct
51 Correct 49 ms 3424 KB Output is correct
52 Correct 47 ms 2732 KB Output is correct
53 Correct 33 ms 2432 KB Output is correct
54 Correct 35 ms 3944 KB Output is correct
55 Correct 54 ms 3500 KB Output is correct
56 Correct 55 ms 3432 KB Output is correct
57 Correct 49 ms 3852 KB Output is correct
58 Incorrect 62 ms 4056 KB Output isn't correct
59 Correct 52 ms 3292 KB Output is correct
60 Incorrect 55 ms 4128 KB Output isn't correct
61 Correct 50 ms 3120 KB Output is correct
62 Correct 60 ms 4136 KB Output is correct
63 Correct 52 ms 3976 KB Output is correct
64 Correct 39 ms 3972 KB Output is correct
65 Incorrect 53 ms 3972 KB Output isn't correct
66 Correct 46 ms 3880 KB Output is correct
67 Correct 37 ms 3972 KB Output is correct
68 Incorrect 54 ms 4268 KB Output isn't correct
69 Correct 46 ms 3236 KB Output is correct
70 Correct 38 ms 2508 KB Output is correct
71 Correct 43 ms 3932 KB Output is correct
72 Incorrect 68 ms 4204 KB Output isn't correct
73 Correct 57 ms 3860 KB Output is correct
74 Correct 57 ms 3916 KB Output is correct
75 Correct 47 ms 3356 KB Output is correct
76 Correct 45 ms 3936 KB Output is correct
77 Correct 58 ms 3988 KB Output is correct
78 Incorrect 50 ms 3900 KB Output isn't correct
79 Correct 57 ms 3892 KB Output is correct
80 Correct 38 ms 2592 KB Output is correct
81 Correct 40 ms 2852 KB Output is correct
82 Correct 30 ms 2120 KB Output is correct
83 Correct 47 ms 4044 KB Output is correct
84 Correct 47 ms 2904 KB Output is correct
85 Incorrect 78 ms 4160 KB Output isn't correct
86 Correct 46 ms 2852 KB Output is correct
87 Correct 55 ms 3388 KB Output is correct
88 Correct 53 ms 3260 KB Output is correct
89 Correct 50 ms 3404 KB Output is correct
90 Correct 50 ms 4232 KB Output is correct
91 Incorrect 51 ms 3340 KB Output isn't correct
92 Correct 41 ms 3896 KB Output is correct
93 Correct 46 ms 3860 KB Output is correct
94 Correct 69 ms 4180 KB Output is correct
95 Correct 41 ms 4060 KB Output is correct
96 Incorrect 48 ms 3160 KB Output isn't correct
97 Correct 64 ms 4160 KB Output is correct
98 Correct 39 ms 3884 KB Output is correct
99 Correct 65 ms 4100 KB Output is correct
100 Correct 49 ms 3364 KB Output is correct
101 Correct 68 ms 4200 KB Output is correct
102 Correct 50 ms 3448 KB Output is correct