oj.uz

답안 #658018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658018 2022-11-11T22:31:21 Z cristi_a 미술 수업 (IOI13_artclass) C++17
76 / 100
 87 ms 3508 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(noise_percent <= 6.00 and green_percent >= 25.00 and blocks >= 100) return 2;
    if(blocks <= 180 and non_color_percent >= 30.00) return 1;
    if(non_color_percent >= 60.00 and blocks <= 3000) return 1;
    if(nuances <= 80) return 4;
    return 3;
}

Subtask #1
76.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 2820 KB Output is correct
2 Correct 39 ms 3344 KB Output is correct
3 Correct 57 ms 3376 KB Output is correct
4 Correct 46 ms 3420 KB Output is correct
5 Correct 69 ms 3344 KB Output is correct
6 Incorrect 70 ms 3456 KB Output isn't correct
7 Correct 49 ms 3444 KB Output is correct
8 Correct 83 ms 3448 KB Output is correct
9 Correct 72 ms 2996 KB Output is correct
10 Correct 51 ms 2412 KB Output is correct
11 Incorrect 17 ms 3480 KB Output isn't correct
12 Incorrect 58 ms 2920 KB Output isn't correct
13 Incorrect 58 ms 2728 KB Output isn't correct
14 Correct 53 ms 2792 KB Output is correct
15 Correct 63 ms 3508 KB Output is correct
16 Correct 54 ms 2856 KB Output is correct
17 Correct 42 ms 3432 KB Output is correct
18 Correct 63 ms 3392 KB Output is correct
19 Correct 41 ms 1952 KB Output is correct
20 Correct 16 ms 1108 KB Output is correct
21 Correct 49 ms 3404 KB Output is correct
22 Correct 71 ms 2892 KB Output is correct
23 Incorrect 70 ms 3504 KB Output isn't correct
24 Correct 61 ms 2772 KB Output is correct
25 Correct 67 ms 3376 KB Output is correct
26 Correct 54 ms 3416 KB Output is correct
27 Correct 78 ms 3384 KB Output is correct
28 Correct 53 ms 3388 KB Output is correct
29 Incorrect 71 ms 3404 KB Output isn't correct
30 Correct 61 ms 3376 KB Output is correct
31 Incorrect 60 ms 3120 KB Output isn't correct
32 Correct 38 ms 1740 KB Output is correct
33 Correct 78 ms 3356 KB Output is correct
34 Correct 43 ms 3404 KB Output is correct
35 Correct 43 ms 2024 KB Output is correct
36 Correct 57 ms 3348 KB Output is correct
37 Correct 56 ms 3384 KB Output is correct
38 Correct 59 ms 3108 KB Output is correct
39 Correct 37 ms 2132 KB Output is correct
40 Correct 32 ms 1680 KB Output is correct
41 Correct 43 ms 2436 KB Output is correct
42 Correct 63 ms 3456 KB Output is correct
43 Incorrect 51 ms 2352 KB Output isn't correct
44 Correct 64 ms 3460 KB Output is correct
45 Correct 57 ms 2612 KB Output is correct
46 Correct 54 ms 3348 KB Output is correct
47 Correct 54 ms 3456 KB Output is correct
48 Correct 34 ms 1612 KB Output is correct
49 Correct 48 ms 3404 KB Output is correct
50 Incorrect 55 ms 2820 KB Output isn't correct
51 Incorrect 58 ms 3508 KB Output isn't correct
52 Incorrect 69 ms 3408 KB Output isn't correct
53 Correct 40 ms 3464 KB Output is correct
54 Incorrect 61 ms 3416 KB Output isn't correct
55 Correct 52 ms 2716 KB Output is correct
56 Correct 59 ms 3028 KB Output is correct
57 Correct 53 ms 3404 KB Output is correct
58 Correct 67 ms 3368 KB Output is correct
59 Correct 68 ms 3456 KB Output is correct
60 Incorrect 55 ms 2744 KB Output isn't correct
61 Correct 35 ms 1952 KB Output is correct
62 Incorrect 62 ms 3448 KB Output isn't correct
63 Correct 57 ms 2848 KB Output is correct
64 Correct 56 ms 3368 KB Output is correct
65 Correct 49 ms 2272 KB Output is correct
66 Correct 69 ms 2784 KB Output is correct
67 Correct 60 ms 2708 KB Output is correct
68 Correct 70 ms 3456 KB Output is correct
69 Correct 51 ms 2764 KB Output is correct
70 Correct 64 ms 3020 KB Output is correct
71 Correct 47 ms 3460 KB Output is correct
72 Correct 45 ms 3404 KB Output is correct
73 Correct 33 ms 3460 KB Output is correct
74 Correct 59 ms 3412 KB Output is correct
75 Incorrect 56 ms 2808 KB Output isn't correct
76 Correct 55 ms 3404 KB Output is correct
77 Correct 87 ms 3356 KB Output is correct
78 Correct 54 ms 3388 KB Output is correct
79 Correct 72 ms 3304 KB Output is correct
80 Correct 57 ms 3460 KB Output is correct
81 Incorrect 57 ms 2892 KB Output isn't correct
82 Correct 60 ms 3460 KB Output is correct
83 Correct 54 ms 2424 KB Output is correct
84 Incorrect 44 ms 3380 KB Output isn't correct
85 Correct 56 ms 2880 KB Output is correct
86 Correct 63 ms 2820 KB Output is correct
87 Correct 53 ms 3456 KB Output is correct
88 Correct 60 ms 2896 KB Output is correct
89 Correct 55 ms 3472 KB Output is correct
90 Correct 59 ms 3412 KB Output is correct
91 Correct 53 ms 3456 KB Output is correct
92 Incorrect 59 ms 3404 KB Output isn't correct
93 Correct 64 ms 3344 KB Output is correct
94 Incorrect 68 ms 3000 KB Output isn't correct
95 Incorrect 66 ms 3352 KB Output isn't correct
96 Correct 61 ms 3404 KB Output is correct
97 Correct 62 ms 3404 KB Output is correct
98 Correct 41 ms 2028 KB Output is correct
99 Correct 65 ms 2892 KB Output is correct
100 Correct 62 ms 3344 KB Output is correct
101 Correct 55 ms 2680 KB Output is correct
102 Incorrect 74 ms 3396 KB Output isn't correct