oj.uz

Submission #658009

# Submission time Handle Problem Language Result Execution time Memory
658009 2022-11-11T20:06:31 Z cristi_a Art Class (IOI13_artclass) C++17
73 / 100
 70 ms 5468 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 int sigmaB = 90;
    static const int sigmaN = 110;
    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 = [&](int 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]);
                        if(dif <= 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 <= 130 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 <= 1600 and blocks >= 100) return 2;
    if(nuances <= 50) return 4;
    return 3;
}

Subtask #1
73.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 4644 KB Output isn't correct
2 Incorrect 68 ms 5300 KB Output isn't correct
3 Correct 52 ms 5232 KB Output is correct
4 Correct 54 ms 5380 KB Output is correct
5 Correct 39 ms 4868 KB Output is correct
6 Incorrect 60 ms 5348 KB Output isn't correct
7 Correct 47 ms 4656 KB Output is correct
8 Incorrect 56 ms 5312 KB Output isn't correct
9 Correct 38 ms 4972 KB Output is correct
10 Correct 48 ms 4632 KB Output is correct
11 Correct 62 ms 5468 KB Output is correct
12 Correct 49 ms 5364 KB Output is correct
13 Correct 55 ms 5384 KB Output is correct
14 Correct 57 ms 5032 KB Output is correct
15 Incorrect 64 ms 5292 KB Output isn't correct
16 Correct 53 ms 5068 KB Output is correct
17 Correct 47 ms 3976 KB Output is correct
18 Incorrect 51 ms 4888 KB Output isn't correct
19 Correct 33 ms 3532 KB Output is correct
20 Correct 34 ms 4944 KB Output is correct
21 Correct 50 ms 4808 KB Output is correct
22 Correct 49 ms 5376 KB Output is correct
23 Correct 42 ms 4780 KB Output is correct
24 Correct 49 ms 4848 KB Output is correct
25 Correct 51 ms 4888 KB Output is correct
26 Correct 59 ms 5388 KB Output is correct
27 Correct 37 ms 4896 KB Output is correct
28 Incorrect 53 ms 4980 KB Output isn't correct
29 Correct 42 ms 4940 KB Output is correct
30 Correct 54 ms 4812 KB Output is correct
31 Correct 40 ms 5008 KB Output is correct
32 Correct 38 ms 5096 KB Output is correct
33 Incorrect 48 ms 4760 KB Output isn't correct
34 Correct 50 ms 4596 KB Output is correct
35 Correct 58 ms 5308 KB Output is correct
36 Correct 49 ms 5284 KB Output is correct
37 Incorrect 47 ms 4520 KB Output isn't correct
38 Correct 48 ms 5368 KB Output is correct
39 Correct 47 ms 5268 KB Output is correct
40 Correct 52 ms 4984 KB Output is correct
41 Correct 56 ms 5428 KB Output is correct
42 Correct 53 ms 5016 KB Output is correct
43 Correct 50 ms 5280 KB Output is correct
44 Correct 34 ms 2880 KB Output is correct
45 Correct 50 ms 4300 KB Output is correct
46 Correct 44 ms 4544 KB Output is correct
47 Correct 33 ms 4816 KB Output is correct
48 Correct 38 ms 3356 KB Output is correct
49 Correct 38 ms 3388 KB Output is correct
50 Correct 55 ms 4652 KB Output is correct
51 Correct 59 ms 5372 KB Output is correct
52 Correct 57 ms 5384 KB Output is correct
53 Correct 30 ms 4572 KB Output is correct
54 Incorrect 38 ms 5068 KB Output isn't correct
55 Correct 44 ms 4936 KB Output is correct
56 Incorrect 49 ms 4796 KB Output isn't correct
57 Correct 43 ms 4440 KB Output is correct
58 Correct 45 ms 4600 KB Output is correct
59 Correct 14 ms 1540 KB Output is correct
60 Correct 37 ms 3276 KB Output is correct
61 Correct 41 ms 5128 KB Output is correct
62 Incorrect 53 ms 5220 KB Output isn't correct
63 Correct 51 ms 4740 KB Output is correct
64 Correct 49 ms 5336 KB Output is correct
65 Incorrect 55 ms 5068 KB Output isn't correct
66 Incorrect 14 ms 3924 KB Output isn't correct
67 Correct 62 ms 5228 KB Output is correct
68 Correct 50 ms 5300 KB Output is correct
69 Correct 50 ms 5300 KB Output is correct
70 Incorrect 61 ms 5308 KB Output isn't correct
71 Correct 49 ms 4928 KB Output is correct
72 Incorrect 70 ms 5348 KB Output isn't correct
73 Correct 48 ms 5316 KB Output is correct
74 Correct 56 ms 4640 KB Output is correct
75 Correct 46 ms 5324 KB Output is correct
76 Incorrect 50 ms 5360 KB Output isn't correct
77 Correct 56 ms 4816 KB Output is correct
78 Incorrect 65 ms 5300 KB Output isn't correct
79 Incorrect 47 ms 4480 KB Output isn't correct
80 Correct 43 ms 3804 KB Output is correct
81 Correct 62 ms 5364 KB Output is correct
82 Correct 54 ms 4844 KB Output is correct
83 Correct 50 ms 4896 KB Output is correct
84 Correct 50 ms 5308 KB Output is correct
85 Incorrect 58 ms 5300 KB Output isn't correct
86 Correct 39 ms 5100 KB Output is correct
87 Correct 60 ms 5328 KB Output is correct
88 Incorrect 50 ms 4644 KB Output isn't correct
89 Correct 30 ms 2656 KB Output is correct
90 Correct 47 ms 5160 KB Output is correct
91 Correct 46 ms 4996 KB Output is correct
92 Correct 42 ms 4020 KB Output is correct
93 Correct 48 ms 4768 KB Output is correct
94 Correct 46 ms 5068 KB Output is correct
95 Correct 61 ms 5320 KB Output is correct
96 Correct 49 ms 4764 KB Output is correct
97 Correct 29 ms 2628 KB Output is correct
98 Correct 62 ms 5380 KB Output is correct
99 Correct 39 ms 3976 KB Output is correct
100 Correct 60 ms 5280 KB Output is correct
101 Correct 32 ms 3272 KB Output is correct
102 Incorrect 54 ms 4856 KB Output isn't correct