oj.uz

Submission #658012

# Submission time Handle Problem Language Result Execution time Memory
658012 2022-11-11T20:17:36 Z cristi_a Art Class (IOI13_artclass) C++17
76 / 100
 85 ms 4020 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 = 50;
    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 47 ms 2648 KB Output is correct
2 Incorrect 69 ms 3980 KB Output isn't correct
3 Correct 60 ms 3940 KB Output is correct
4 Correct 39 ms 2252 KB Output is correct
5 Correct 62 ms 3840 KB Output is correct
6 Correct 44 ms 3732 KB Output is correct
7 Correct 54 ms 3896 KB Output is correct
8 Correct 49 ms 3916 KB Output is correct
9 Correct 61 ms 3912 KB Output is correct
10 Correct 59 ms 3916 KB Output is correct
11 Incorrect 49 ms 3048 KB Output isn't correct
12 Incorrect 64 ms 3916 KB Output isn't correct
13 Correct 53 ms 3824 KB Output is correct
14 Correct 50 ms 3916 KB Output is correct
15 Correct 54 ms 3972 KB Output is correct
16 Correct 53 ms 3940 KB Output is correct
17 Incorrect 64 ms 3892 KB Output isn't correct
18 Correct 34 ms 3636 KB Output is correct
19 Correct 63 ms 3876 KB Output is correct
20 Incorrect 50 ms 3404 KB Output isn't correct
21 Correct 41 ms 3712 KB Output is correct
22 Incorrect 85 ms 3972 KB Output isn't correct
23 Correct 50 ms 3176 KB Output is correct
24 Correct 37 ms 3712 KB Output is correct
25 Correct 60 ms 3192 KB Output is correct
26 Correct 54 ms 2856 KB Output is correct
27 Correct 35 ms 3636 KB Output is correct
28 Correct 45 ms 3652 KB Output is correct
29 Correct 40 ms 2080 KB Output is correct
30 Incorrect 58 ms 3872 KB Output isn't correct
31 Correct 66 ms 3860 KB Output is correct
32 Incorrect 21 ms 3700 KB Output isn't correct
33 Correct 60 ms 3900 KB Output is correct
34 Correct 64 ms 3328 KB Output is correct
35 Correct 50 ms 3648 KB Output is correct
36 Correct 50 ms 4020 KB Output is correct
37 Correct 59 ms 3264 KB Output is correct
38 Correct 57 ms 3804 KB Output is correct
39 Correct 65 ms 3848 KB Output is correct
40 Correct 64 ms 3416 KB Output is correct
41 Correct 39 ms 3660 KB Output is correct
42 Incorrect 49 ms 2996 KB Output isn't correct
43 Incorrect 62 ms 3984 KB Output isn't correct
44 Correct 59 ms 3932 KB Output is correct
45 Correct 62 ms 3916 KB Output is correct
46 Correct 32 ms 1936 KB Output is correct
47 Correct 65 ms 3920 KB Output is correct
48 Correct 50 ms 2908 KB Output is correct
49 Correct 35 ms 2024 KB Output is correct
50 Incorrect 66 ms 3868 KB Output isn't correct
51 Incorrect 59 ms 3924 KB Output isn't correct
52 Correct 56 ms 3700 KB Output is correct
53 Correct 71 ms 3936 KB Output is correct
54 Incorrect 65 ms 3908 KB Output isn't correct
55 Correct 49 ms 3776 KB Output is correct
56 Correct 59 ms 3924 KB Output is correct
57 Correct 38 ms 3684 KB Output is correct
58 Correct 50 ms 3752 KB Output is correct
59 Correct 54 ms 3740 KB Output is correct
60 Correct 48 ms 3856 KB Output is correct
61 Correct 50 ms 2688 KB Output is correct
62 Correct 52 ms 3788 KB Output is correct
63 Incorrect 57 ms 3848 KB Output isn't correct
64 Incorrect 73 ms 3300 KB Output isn't correct
65 Correct 37 ms 2212 KB Output is correct
66 Correct 39 ms 2788 KB Output is correct
67 Correct 49 ms 3644 KB Output is correct
68 Incorrect 54 ms 3496 KB Output isn't correct
69 Correct 17 ms 1320 KB Output is correct
70 Correct 48 ms 3052 KB Output is correct
71 Correct 46 ms 3916 KB Output is correct
72 Correct 53 ms 3644 KB Output is correct
73 Correct 48 ms 2564 KB Output is correct
74 Correct 62 ms 3508 KB Output is correct
75 Correct 66 ms 3884 KB Output is correct
76 Incorrect 39 ms 3616 KB Output isn't correct
77 Correct 37 ms 2392 KB Output is correct
78 Correct 48 ms 3720 KB Output is correct
79 Incorrect 48 ms 2940 KB Output isn't correct
80 Correct 74 ms 3864 KB Output is correct
81 Correct 45 ms 2592 KB Output is correct
82 Correct 59 ms 3916 KB Output is correct
83 Correct 49 ms 3032 KB Output is correct
84 Correct 56 ms 3540 KB Output is correct
85 Correct 32 ms 3720 KB Output is correct
86 Correct 60 ms 3920 KB Output is correct
87 Correct 49 ms 2956 KB Output is correct
88 Correct 55 ms 3632 KB Output is correct
89 Correct 48 ms 3016 KB Output is correct
90 Correct 48 ms 3080 KB Output is correct
91 Correct 46 ms 2384 KB Output is correct
92 Incorrect 54 ms 2972 KB Output isn't correct
93 Correct 51 ms 3344 KB Output is correct
94 Incorrect 52 ms 3148 KB Output isn't correct
95 Correct 58 ms 3264 KB Output is correct
96 Correct 69 ms 3232 KB Output is correct
97 Incorrect 61 ms 3520 KB Output isn't correct
98 Correct 58 ms 3844 KB Output is correct
99 Correct 51 ms 3900 KB Output is correct
100 Correct 34 ms 2248 KB Output is correct
101 Correct 73 ms 3504 KB Output is correct
102 Correct 62 ms 3020 KB Output is correct