oj.uz

Submission #658002

# Submission time Handle Problem Language Result Execution time Memory
658002 2022-11-11T19:52:57 Z cristi_a Art Class (IOI13_artclass) C++17
60 / 100
 83 ms 6272 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 >= 5 and g - b >= 5) 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 >= 26.00) return 2;
    if(nuances <= 50) return 4;
    return 3;
}

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 5384 KB Output is correct
2 Correct 56 ms 5496 KB Output is correct
3 Incorrect 52 ms 5432 KB Output isn't correct
4 Correct 57 ms 4696 KB Output is correct
5 Incorrect 66 ms 5024 KB Output isn't correct
6 Correct 57 ms 5480 KB Output is correct
7 Incorrect 55 ms 5172 KB Output isn't correct
8 Correct 59 ms 4812 KB Output is correct
9 Correct 48 ms 3848 KB Output is correct
10 Incorrect 55 ms 4828 KB Output isn't correct
11 Incorrect 46 ms 4644 KB Output isn't correct
12 Correct 54 ms 4876 KB Output is correct
13 Correct 39 ms 3240 KB Output is correct
14 Correct 47 ms 4028 KB Output is correct
15 Incorrect 38 ms 4000 KB Output isn't correct
16 Correct 57 ms 5988 KB Output is correct
17 Incorrect 48 ms 4556 KB Output isn't correct
18 Correct 49 ms 5260 KB Output is correct
19 Correct 57 ms 5664 KB Output is correct
20 Incorrect 73 ms 6132 KB Output isn't correct
21 Correct 47 ms 5172 KB Output is correct
22 Correct 49 ms 4776 KB Output is correct
23 Incorrect 58 ms 6128 KB Output isn't correct
24 Incorrect 46 ms 4528 KB Output isn't correct
25 Correct 30 ms 2700 KB Output is correct
26 Incorrect 52 ms 4968 KB Output isn't correct
27 Correct 58 ms 5548 KB Output is correct
28 Correct 34 ms 5064 KB Output is correct
29 Correct 57 ms 4936 KB Output is correct
30 Correct 53 ms 5700 KB Output is correct
31 Correct 53 ms 5356 KB Output is correct
32 Incorrect 30 ms 4536 KB Output isn't correct
33 Correct 73 ms 5160 KB Output is correct
34 Correct 58 ms 6120 KB Output is correct
35 Correct 45 ms 4852 KB Output is correct
36 Correct 60 ms 5188 KB Output is correct
37 Incorrect 46 ms 5296 KB Output isn't correct
38 Correct 58 ms 5580 KB Output is correct
39 Correct 15 ms 1620 KB Output is correct
40 Correct 37 ms 4844 KB Output is correct
41 Correct 34 ms 3276 KB Output is correct
42 Correct 51 ms 4556 KB Output is correct
43 Correct 46 ms 5136 KB Output is correct
44 Incorrect 59 ms 6088 KB Output isn't correct
45 Correct 53 ms 4284 KB Output is correct
46 Correct 47 ms 5504 KB Output is correct
47 Correct 61 ms 5120 KB Output is correct
48 Correct 51 ms 4596 KB Output is correct
49 Correct 37 ms 4940 KB Output is correct
50 Correct 57 ms 5948 KB Output is correct
51 Correct 57 ms 5460 KB Output is correct
52 Correct 52 ms 5580 KB Output is correct
53 Correct 33 ms 2784 KB Output is correct
54 Correct 39 ms 3276 KB Output is correct
55 Correct 41 ms 4940 KB Output is correct
56 Correct 70 ms 6272 KB Output is correct
57 Incorrect 63 ms 5792 KB Output isn't correct
58 Incorrect 54 ms 5956 KB Output isn't correct
59 Correct 46 ms 4660 KB Output is correct
60 Correct 45 ms 4992 KB Output is correct
61 Incorrect 39 ms 5060 KB Output isn't correct
62 Correct 48 ms 4640 KB Output is correct
63 Correct 52 ms 3356 KB Output is correct
64 Correct 48 ms 5692 KB Output is correct
65 Correct 59 ms 5464 KB Output is correct
66 Incorrect 83 ms 6200 KB Output isn't correct
67 Correct 54 ms 5464 KB Output is correct
68 Incorrect 50 ms 5592 KB Output isn't correct
69 Correct 49 ms 5516 KB Output is correct
70 Correct 53 ms 6000 KB Output is correct
71 Correct 52 ms 5636 KB Output is correct
72 Incorrect 52 ms 5524 KB Output isn't correct
73 Incorrect 47 ms 5440 KB Output isn't correct
74 Incorrect 39 ms 5112 KB Output isn't correct
75 Correct 50 ms 4524 KB Output is correct
76 Correct 38 ms 2604 KB Output is correct
77 Correct 50 ms 5408 KB Output is correct
78 Incorrect 48 ms 5344 KB Output isn't correct
79 Incorrect 19 ms 3908 KB Output isn't correct
80 Incorrect 56 ms 6032 KB Output isn't correct
81 Correct 49 ms 5336 KB Output is correct
82 Correct 61 ms 6092 KB Output is correct
83 Correct 43 ms 3996 KB Output is correct
84 Incorrect 46 ms 4408 KB Output isn't correct
85 Correct 59 ms 6164 KB Output is correct
86 Correct 60 ms 5544 KB Output is correct
87 Correct 60 ms 6152 KB Output is correct
88 Correct 49 ms 4644 KB Output is correct
89 Correct 63 ms 6044 KB Output is correct
90 Incorrect 53 ms 4812 KB Output isn't correct
91 Incorrect 63 ms 6088 KB Output isn't correct
92 Correct 49 ms 5052 KB Output is correct
93 Correct 57 ms 4768 KB Output is correct
94 Correct 52 ms 5208 KB Output is correct
95 Correct 58 ms 6120 KB Output is correct
96 Correct 52 ms 5316 KB Output is correct
97 Correct 64 ms 5512 KB Output is correct
98 Correct 38 ms 3532 KB Output is correct
99 Correct 46 ms 5288 KB Output is correct
100 Correct 56 ms 5628 KB Output is correct
101 Correct 49 ms 4804 KB Output is correct
102 Correct 50 ms 5068 KB Output is correct