oj.uz

Submission #658016

# Submission time Handle Problem Language Result Execution time Memory
658016 2022-11-11T20:49:00 Z cristi_a Art Class (IOI13_artclass) C++17
76 / 100
 86 ms 3532 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;
    };

    int noise = 0;
    for(int i=0; i<H; i++)
        for(int j=0; j<W; j++)
            for(int k=0; k<4; k++) {
                int ni = i + dx[k];
                int nj = j + dy[k];
                if(!in(ni, nj)) continue;

                int difs =  abs(R[i][j] - R[ni][nj]) +
                            abs(G[i][j] - G[ni][nj]) +
                            abs(B[i][j] - B[ni][nj]);
                if(difs >= 200) noise++;
            }
    double noise_percent = 1.00 * noise / (1.00 * area) * 100.00;

    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 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";*/

    //cout << "\nnoise_percent: " << noise_percent << "\n";
    if(noise_percent >= 35.00) return 3;
    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 69 ms 3464 KB Output is correct
2 Correct 77 ms 3412 KB Output is correct
3 Correct 57 ms 3036 KB Output is correct
4 Correct 74 ms 3464 KB Output is correct
5 Incorrect 60 ms 3088 KB Output isn't correct
6 Incorrect 55 ms 2892 KB Output isn't correct
7 Correct 78 ms 3372 KB Output is correct
8 Correct 60 ms 3368 KB Output is correct
9 Incorrect 17 ms 3412 KB Output isn't correct
10 Correct 53 ms 2380 KB Output is correct
11 Incorrect 72 ms 3340 KB Output isn't correct
12 Correct 50 ms 2260 KB Output is correct
13 Correct 86 ms 3228 KB Output is correct
14 Correct 54 ms 3468 KB Output is correct
15 Correct 62 ms 3400 KB Output is correct
16 Correct 54 ms 3460 KB Output is correct
17 Correct 51 ms 2800 KB Output is correct
18 Incorrect 45 ms 3512 KB Output isn't correct
19 Correct 67 ms 3384 KB Output is correct
20 Correct 53 ms 2888 KB Output is correct
21 Correct 34 ms 1748 KB Output is correct
22 Correct 77 ms 3400 KB Output is correct
23 Correct 69 ms 3348 KB Output is correct
24 Correct 73 ms 2836 KB Output is correct
25 Correct 54 ms 3368 KB Output is correct
26 Correct 50 ms 2760 KB Output is correct
27 Correct 45 ms 3448 KB Output is correct
28 Correct 44 ms 3408 KB Output is correct
29 Correct 46 ms 3352 KB Output is correct
30 Correct 51 ms 3428 KB Output is correct
31 Correct 81 ms 3468 KB Output is correct
32 Correct 47 ms 3444 KB Output is correct
33 Correct 42 ms 3416 KB Output is correct
34 Correct 62 ms 3448 KB Output is correct
35 Correct 47 ms 2364 KB Output is correct
36 Correct 53 ms 3476 KB Output is correct
37 Incorrect 56 ms 2720 KB Output isn't correct
38 Incorrect 57 ms 2812 KB Output isn't correct
39 Correct 49 ms 3460 KB Output is correct
40 Incorrect 66 ms 3432 KB Output isn't correct
41 Correct 51 ms 3372 KB Output is correct
42 Correct 66 ms 3400 KB Output is correct
43 Incorrect 64 ms 3420 KB Output isn't correct
44 Incorrect 54 ms 2752 KB Output isn't correct
45 Correct 49 ms 2248 KB Output is correct
46 Correct 61 ms 3020 KB Output is correct
47 Correct 34 ms 1728 KB Output is correct
48 Correct 55 ms 2964 KB Output is correct
49 Correct 65 ms 3416 KB Output is correct
50 Correct 39 ms 3468 KB Output is correct
51 Incorrect 64 ms 3404 KB Output isn't correct
52 Correct 36 ms 2052 KB Output is correct
53 Incorrect 70 ms 3380 KB Output isn't correct
54 Correct 71 ms 3408 KB Output is correct
55 Correct 54 ms 3392 KB Output is correct
56 Correct 46 ms 2444 KB Output is correct
57 Correct 34 ms 3448 KB Output is correct
58 Incorrect 68 ms 3424 KB Output isn't correct
59 Correct 64 ms 2736 KB Output is correct
60 Correct 64 ms 2676 KB Output is correct
61 Incorrect 60 ms 3460 KB Output isn't correct
62 Correct 73 ms 3416 KB Output is correct
63 Correct 56 ms 2892 KB Output is correct
64 Incorrect 54 ms 2764 KB Output isn't correct
65 Correct 53 ms 3404 KB Output is correct
66 Correct 61 ms 2620 KB Output is correct
67 Correct 55 ms 2892 KB Output is correct
68 Incorrect 71 ms 3460 KB Output isn't correct
69 Correct 49 ms 3460 KB Output is correct
70 Correct 51 ms 2264 KB Output is correct
71 Correct 61 ms 2948 KB Output is correct
72 Correct 57 ms 3424 KB Output is correct
73 Incorrect 66 ms 3452 KB Output isn't correct
74 Correct 37 ms 2120 KB Output is correct
75 Correct 60 ms 2764 KB Output is correct
76 Correct 54 ms 3532 KB Output is correct
77 Correct 66 ms 3464 KB Output is correct
78 Correct 38 ms 3404 KB Output is correct
79 Correct 48 ms 2116 KB Output is correct
80 Incorrect 59 ms 2880 KB Output isn't correct
81 Correct 41 ms 2004 KB Output is correct
82 Correct 61 ms 2796 KB Output is correct
83 Correct 70 ms 3392 KB Output is correct
84 Correct 69 ms 3376 KB Output is correct
85 Correct 58 ms 3388 KB Output is correct
86 Correct 75 ms 3360 KB Output is correct
87 Correct 56 ms 3460 KB Output is correct
88 Correct 53 ms 3460 KB Output is correct
89 Correct 42 ms 3392 KB Output is correct
90 Correct 73 ms 3412 KB Output is correct
91 Correct 16 ms 1148 KB Output is correct
92 Incorrect 61 ms 2936 KB Output isn't correct
93 Incorrect 64 ms 3432 KB Output isn't correct
94 Correct 54 ms 3416 KB Output is correct
95 Correct 71 ms 3340 KB Output is correct
96 Correct 58 ms 3056 KB Output is correct
97 Correct 37 ms 1620 KB Output is correct
98 Correct 53 ms 2764 KB Output is correct
99 Correct 66 ms 2816 KB Output is correct
100 Correct 67 ms 3056 KB Output is correct
101 Correct 47 ms 3384 KB Output is correct
102 Incorrect 53 ms 2740 KB Output isn't correct