oj.uz

답안 #955252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955252 2024-03-30T01:07:44 Z Programmer123 미술 수업 (IOI13_artclass) C++17
76 / 100
 97 ms 15156 KB 
#ifndef ONLINE_JUDGE
#include "artclass.h"
#endif
#include <bits/stdc++.h>
struct pixel {
    double r, g, b;
    double h, s, l;
    pixel() {
        r = g = b = h = s = l = 0.0;
    }
    pixel(int _r, int _g, int _b) {
        r = _r / 255.0;
        g = _g / 255.0;
        b = _b / 255.0;
        auto xmax = std::max({r, g, b});
        auto xmin = std::min({r, g, b});
        auto c = xmax - xmin;
        l = (xmax + xmin) / 2;
        if (xmax == 0) {
            s = 0;
        } else {
            s = c / xmax;
        }
        if (c == 0.0) {
            h = 0;
        } else if (xmax == r) {
            h = 60.0 * (fmod(60.0 + ((g - b) / c), 6.0));
        } else if (xmax == g) {
            h = 60.0 * ((b - r) / c + 2.0);
        } else if (xmax == b) {
            h = 60.0 * ((r - g) / c + 4.0);
        } else {
            assert(false);
        }
    }
};
bool green(int r, int g, int b) {
    return (g > 100 && r < 100 && b < 100) || (g > 50 && r < 50 && b < 50);
}
double dist(pixel _a, pixel _b) {
    auto r = _a.r - _b.r;
    auto g = _a.g - _b.g;
    auto b = _a.b - _b.b;
    return std::sqrt(r * r + g * g + b * b);
}
double noise(std::vector<pixel> pixels) {
    double res = 0;
    for (int i = 0; i < pixels.size(); ++i) {
        for (int j = i + 1; j < pixels.size(); ++j) {
            res += dist(pixels[i], pixels[j]);
        }
    }
    return res;
}
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    std::mt19937 Rand(std::random_device{}());
    auto data = new pixel *[H];
    for (int i = 0; i < H; ++i) {
        data[i] = new pixel[W];
        for (int j = 0; j < W; ++j) {
            data[i][j] = pixel(R[i][j], G[i][j], B[i][j]);
        }
    }
    auto clean = [&]() {
        for (int i = 0; i < H; ++i) {
            delete[] data[i];
        }
        delete[] data;
    };
    std::vector<pixel> primaries = {
            {190, 10, 10},
            {238, 208, 3},
            {57, 96, 188},
            {240, 240, 240},
            {0, 0, 0}};
    auto primary = [&](pixel x) {
        for (auto p: primaries) {
            if (dist(x, p) < 0.1) return true;
        }
        return false;
    };
    int numP = 0;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            numP += primary(data[i][j]);
        }
    }
    if (numP > 40000) {
        clean();
        return 1;
    }
    //    return 0;
    int numG = 0;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            numG += (dist(data[i][j], {108, 141, 71}) < 0.25);
            //            numG += (std::abs(data[i][j].h - 120.0) < 20.0) && (data[i][j].l < 0.8) && (data[i][j].l > 0.2);
        }
    }
    const double BLUE_THRESHOLD = 0.25;
    int highB = 0, lowB = 0;
    for (int i = 0; i < H / 2; ++i) {
        for (int j = 0; j < W; ++j) {
            highB += (dist(data[i][j], {160, 180, 215}) < BLUE_THRESHOLD);
        }
    }
    for (int i = H / 2; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            lowB += (dist(data[i][j], {160, 180, 215}) < BLUE_THRESHOLD);
        }
    }
    std::map<int, int> diffs;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            if (data[i][j].l < 0.2 || data[i][j].l > 0.8) continue;
            int num = std::floor(data[i][j].h / 10);
            diffs[num]++;
        }
    }
    int numlarge = 0;
    for (auto [a, b]: diffs) {
        //#ifdef LOCAL
        //        std::cout << "Colour " << a << ": " << b << std::endl;
        //#endif
        if (b > H * W / 4) numlarge++;
    }
    if (numG > 2000 && highB > lowB * 1.5) {
        clean();
        return 2;
    }
    int numW = 0;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            if (data[i][j].l > 0.7) numW++;
        }
    }
    double Noise = 0.0;
    int rad = 10;
    for (int sample = 0; sample < 100; ++sample) {
        int r = Rand() % H;
        int c = Rand() % W;
        while (r - rad < 0 || r + rad >= H) {
            r = Rand() % H;
        }
        while (c - rad < 0 || c + rad >= W) {
            c = Rand() % W;
        }
        std::vector<pixel> pixels;
        for (int i = r - rad; i <= r + rad; ++i) {
            for (int j = c - rad; j <= c + rad; ++j) {
                pixels.push_back(data[i][j]);
            }
        }
        Noise += noise(pixels);
    }
    if (Noise >= 1000000) {
        clean();
        return 3;
    }
    clean();
    return 4;
}

#ifdef ONLINE_JUDGE
int _R[500][500];
int _G[500][500];
int _B[500][500];
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T;
    std::cin >> T;
    for (int _ = 0; _ < T; ++_) {
        int H, W;
        std::cin >> H >> W;
        for (int i = 0; i < H; ++i) {
            for (int j = 0; j < W; ++j) {
                int a;
                std::cin >> a;
                _R[i][j] = (a >> 16) & 0xff;
                _G[i][j] = (a >> 8) & 0xff;
                _B[i][j] = a & 0xff;
            }
        }
        std::cout << style(H, W, _R, _G, _B) << std::endl;
    }
}
#endif

Compilation message

artclass.cpp: In function 'double noise(std::vector<pixel>)':
artclass.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pixel>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 0; i < pixels.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~
artclass.cpp:49:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pixel>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int j = i + 1; j < pixels.size(); ++j) {
      |                             ~~^~~~~~~~~~~~~~~

Subtask #1
76.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 10128 KB Output is correct
2 Correct 70 ms 10248 KB Output is correct
3 Correct 96 ms 13904 KB Output is correct
4 Correct 66 ms 13072 KB Output is correct
5 Incorrect 85 ms 14160 KB Output isn't correct
6 Correct 82 ms 12844 KB Output is correct
7 Incorrect 62 ms 9296 KB Output isn't correct
8 Correct 73 ms 11356 KB Output is correct
9 Correct 63 ms 8784 KB Output is correct
10 Correct 51 ms 12628 KB Output is correct
11 Correct 91 ms 15100 KB Output is correct
12 Correct 54 ms 11440 KB Output is correct
13 Incorrect 58 ms 13392 KB Output isn't correct
14 Correct 76 ms 11604 KB Output is correct
15 Correct 69 ms 11148 KB Output is correct
16 Incorrect 41 ms 10064 KB Output isn't correct
17 Correct 55 ms 12880 KB Output is correct
18 Incorrect 56 ms 13560 KB Output isn't correct
19 Correct 52 ms 12804 KB Output is correct
20 Incorrect 79 ms 12992 KB Output isn't correct
21 Correct 67 ms 10800 KB Output is correct
22 Correct 74 ms 10364 KB Output is correct
23 Correct 84 ms 13804 KB Output is correct
24 Correct 82 ms 13144 KB Output is correct
25 Correct 79 ms 11868 KB Output is correct
26 Correct 60 ms 8792 KB Output is correct
27 Incorrect 89 ms 14800 KB Output isn't correct
28 Incorrect 51 ms 13388 KB Output isn't correct
29 Incorrect 82 ms 12972 KB Output isn't correct
30 Correct 97 ms 14296 KB Output is correct
31 Correct 70 ms 10432 KB Output is correct
32 Correct 51 ms 12624 KB Output is correct
33 Correct 56 ms 7768 KB Output is correct
34 Correct 75 ms 11612 KB Output is correct
35 Incorrect 41 ms 10324 KB Output isn't correct
36 Correct 63 ms 9004 KB Output is correct
37 Correct 52 ms 14752 KB Output is correct
38 Correct 86 ms 11544 KB Output is correct
39 Incorrect 44 ms 12892 KB Output isn't correct
40 Correct 50 ms 12116 KB Output is correct
41 Correct 48 ms 11860 KB Output is correct
42 Correct 49 ms 12116 KB Output is correct
43 Correct 33 ms 9808 KB Output is correct
44 Correct 50 ms 14164 KB Output is correct
45 Incorrect 90 ms 14900 KB Output isn't correct
46 Correct 52 ms 14812 KB Output is correct
47 Correct 51 ms 12624 KB Output is correct
48 Correct 87 ms 12364 KB Output is correct
49 Correct 52 ms 14700 KB Output is correct
50 Correct 48 ms 12120 KB Output is correct
51 Correct 52 ms 12872 KB Output is correct
52 Correct 70 ms 11392 KB Output is correct
53 Correct 64 ms 10248 KB Output is correct
54 Correct 36 ms 8780 KB Output is correct
55 Correct 78 ms 12924 KB Output is correct
56 Incorrect 80 ms 12880 KB Output isn't correct
57 Correct 58 ms 15048 KB Output is correct
58 Incorrect 92 ms 15156 KB Output isn't correct
59 Incorrect 45 ms 13652 KB Output isn't correct
60 Correct 79 ms 12368 KB Output is correct
61 Correct 43 ms 12496 KB Output is correct
62 Correct 81 ms 12628 KB Output is correct
63 Correct 52 ms 15140 KB Output is correct
64 Correct 48 ms 11600 KB Output is correct
65 Incorrect 65 ms 10640 KB Output isn't correct
66 Correct 54 ms 7516 KB Output is correct
67 Correct 80 ms 12604 KB Output is correct
68 Incorrect 46 ms 12388 KB Output isn't correct
69 Correct 57 ms 9052 KB Output is correct
70 Correct 55 ms 12880 KB Output is correct
71 Correct 54 ms 13080 KB Output is correct
72 Correct 97 ms 12372 KB Output is correct
73 Correct 45 ms 5044 KB Output is correct
74 Correct 50 ms 12368 KB Output is correct
75 Correct 53 ms 14944 KB Output is correct
76 Incorrect 56 ms 12880 KB Output isn't correct
77 Correct 51 ms 14416 KB Output is correct
78 Correct 85 ms 11696 KB Output is correct
79 Correct 45 ms 12880 KB Output is correct
80 Correct 77 ms 12952 KB Output is correct
81 Incorrect 43 ms 12624 KB Output isn't correct
82 Correct 68 ms 7388 KB Output is correct
83 Correct 79 ms 12884 KB Output is correct
84 Correct 55 ms 14932 KB Output is correct
85 Correct 72 ms 10580 KB Output is correct
86 Correct 42 ms 10576 KB Output is correct
87 Correct 80 ms 13348 KB Output is correct
88 Correct 54 ms 13212 KB Output is correct
89 Correct 52 ms 15008 KB Output is correct
90 Correct 87 ms 13392 KB Output is correct
91 Correct 74 ms 12624 KB Output is correct
92 Correct 64 ms 13248 KB Output is correct
93 Correct 80 ms 13652 KB Output is correct
94 Incorrect 41 ms 10832 KB Output isn't correct
95 Correct 79 ms 12116 KB Output is correct
96 Correct 68 ms 10832 KB Output is correct
97 Correct 48 ms 11868 KB Output is correct
98 Incorrect 93 ms 14928 KB Output isn't correct
99 Correct 51 ms 12364 KB Output is correct
100 Correct 54 ms 12372 KB Output is correct
101 Correct 52 ms 12652 KB Output is correct
102 Correct 42 ms 5980 KB Output is correct