oj.uz

Submission #658015

# Submission time Handle Problem Language Result Execution time Memory
658015 2022-11-11T20:28:11 Z cristi_a Art Class (IOI13_artclass) C++17
71 / 100
 64 ms 3572 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 >= 55.00 and blocks <= 3000) return 1;
    if(green_percent >= 35.00 and blocks <= 2500 and blocks >= 200) return 2;
    if(nuances <= 60) return 4;
    return 3;
}

Subtask #1
71.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 2900 KB Output isn't correct
2 Correct 46 ms 3464 KB Output is correct
3 Correct 16 ms 1140 KB Output is correct
4 Correct 41 ms 3392 KB Output is correct
5 Incorrect 52 ms 2860 KB Output isn't correct
6 Correct 45 ms 2816 KB Output is correct
7 Correct 46 ms 3412 KB Output is correct
8 Incorrect 37 ms 3420 KB Output isn't correct
9 Correct 56 ms 3404 KB Output is correct
10 Incorrect 45 ms 2868 KB Output isn't correct
11 Correct 64 ms 3412 KB Output is correct
12 Correct 55 ms 3404 KB Output is correct
13 Correct 31 ms 2064 KB Output is correct
14 Correct 56 ms 2724 KB Output is correct
15 Correct 48 ms 2900 KB Output is correct
16 Correct 47 ms 3464 KB Output is correct
17 Correct 49 ms 3456 KB Output is correct
18 Incorrect 57 ms 3400 KB Output isn't correct
19 Correct 46 ms 3460 KB Output is correct
20 Correct 45 ms 3456 KB Output is correct
21 Correct 40 ms 3416 KB Output is correct
22 Correct 47 ms 2888 KB Output is correct
23 Incorrect 55 ms 3484 KB Output isn't correct
24 Correct 49 ms 2680 KB Output is correct
25 Correct 42 ms 2356 KB Output is correct
26 Incorrect 51 ms 2844 KB Output isn't correct
27 Incorrect 48 ms 3468 KB Output isn't correct
28 Correct 46 ms 2764 KB Output is correct
29 Correct 49 ms 3404 KB Output is correct
30 Correct 53 ms 3460 KB Output is correct
31 Correct 47 ms 2636 KB Output is correct
32 Correct 56 ms 3412 KB Output is correct
33 Correct 44 ms 2800 KB Output is correct
34 Correct 37 ms 2408 KB Output is correct
35 Correct 47 ms 2912 KB Output is correct
36 Correct 51 ms 2936 KB Output is correct
37 Correct 51 ms 2980 KB Output is correct
38 Correct 63 ms 3512 KB Output is correct
39 Correct 54 ms 2892 KB Output is correct
40 Correct 37 ms 3384 KB Output is correct
41 Correct 52 ms 2900 KB Output is correct
42 Correct 28 ms 3468 KB Output is correct
43 Correct 42 ms 3468 KB Output is correct
44 Incorrect 60 ms 3448 KB Output isn't correct
45 Incorrect 51 ms 3064 KB Output isn't correct
46 Correct 44 ms 3404 KB Output is correct
47 Correct 45 ms 2496 KB Output is correct
48 Correct 42 ms 2332 KB Output is correct
49 Correct 55 ms 3032 KB Output is correct
50 Incorrect 46 ms 3452 KB Output isn't correct
51 Correct 51 ms 3460 KB Output is correct
52 Incorrect 52 ms 3340 KB Output isn't correct
53 Correct 32 ms 3404 KB Output is correct
54 Correct 35 ms 3416 KB Output is correct
55 Incorrect 47 ms 2644 KB Output isn't correct
56 Correct 45 ms 2788 KB Output is correct
57 Incorrect 52 ms 3572 KB Output isn't correct
58 Correct 40 ms 3460 KB Output is correct
59 Correct 29 ms 1684 KB Output is correct
60 Incorrect 49 ms 2716 KB Output isn't correct
61 Incorrect 55 ms 3056 KB Output isn't correct
62 Correct 40 ms 3436 KB Output is correct
63 Incorrect 63 ms 3400 KB Output isn't correct
64 Correct 50 ms 3404 KB Output is correct
65 Correct 37 ms 2080 KB Output is correct
66 Correct 38 ms 3432 KB Output is correct
67 Correct 47 ms 3360 KB Output is correct
68 Correct 57 ms 3460 KB Output is correct
69 Correct 55 ms 3344 KB Output is correct
70 Correct 58 ms 3400 KB Output is correct
71 Correct 58 ms 3528 KB Output is correct
72 Correct 46 ms 3432 KB Output is correct
73 Correct 48 ms 3444 KB Output is correct
74 Correct 59 ms 3532 KB Output is correct
75 Correct 51 ms 3020 KB Output is correct
76 Correct 30 ms 1808 KB Output is correct
77 Correct 32 ms 2124 KB Output is correct
78 Correct 49 ms 3404 KB Output is correct
79 Correct 56 ms 2744 KB Output is correct
80 Correct 38 ms 3484 KB Output is correct
81 Incorrect 46 ms 2964 KB Output isn't correct
82 Correct 47 ms 3436 KB Output is correct
83 Incorrect 59 ms 3464 KB Output isn't correct
84 Correct 38 ms 2008 KB Output is correct
85 Correct 48 ms 3404 KB Output is correct
86 Correct 54 ms 3440 KB Output is correct
87 Incorrect 58 ms 3464 KB Output isn't correct
88 Incorrect 48 ms 2764 KB Output isn't correct
89 Correct 35 ms 3388 KB Output is correct
90 Correct 30 ms 1672 KB Output is correct
91 Correct 59 ms 3404 KB Output is correct
92 Correct 35 ms 2024 KB Output is correct
93 Incorrect 15 ms 3420 KB Output isn't correct
94 Correct 53 ms 3460 KB Output is correct
95 Correct 52 ms 3004 KB Output is correct
96 Correct 39 ms 3404 KB Output is correct
97 Correct 59 ms 3412 KB Output is correct
98 Correct 53 ms 3184 KB Output is correct
99 Correct 60 ms 3376 KB Output is correct
100 Correct 58 ms 3520 KB Output is correct
101 Correct 46 ms 2260 KB Output is correct
102 Incorrect 62 ms 3456 KB Output isn't correct