oj.uz

Submission #955249

# Submission time Handle Problem Language Result Execution time Memory
955249 2024-03-29T23:49:43 Z Programmer123 Art Class (IOI13_artclass) C++17
23 / 100
 88 ms 15092 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]);
        }
    }
    int numG = 0;
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            numG += (std::abs(data[i][j].h - 120.0) < 10.0) && (data[i][j].l < 0.8) && (data[i][j].l > 0.2);
        }
    }
    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++;
    }
    auto clean = [&]() {
        for (int i = 0; i < H; ++i) {
            delete[] data[i];
        }
        delete[] data;
    };
    if (numG > 2100) {
        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 (numW > H * W / 4) {
        clean();
        return 1;
    }
    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
23.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 12624 KB Output isn't correct
2 Incorrect 35 ms 10332 KB Output isn't correct
3 Incorrect 67 ms 12144 KB Output isn't correct
4 Correct 62 ms 10320 KB Output is correct
5 Correct 28 ms 8784 KB Output is correct
6 Incorrect 41 ms 11604 KB Output isn't correct
7 Correct 79 ms 13904 KB Output is correct
8 Incorrect 48 ms 11604 KB Output isn't correct
9 Correct 64 ms 10508 KB Output is correct
10 Correct 44 ms 12880 KB Output is correct
11 Correct 75 ms 14416 KB Output is correct
12 Correct 79 ms 15092 KB Output is correct
13 Correct 79 ms 14932 KB Output is correct
14 Correct 70 ms 13016 KB Output is correct
15 Incorrect 44 ms 12372 KB Output isn't correct
16 Correct 65 ms 11416 KB Output is correct
17 Incorrect 72 ms 12884 KB Output isn't correct
18 Incorrect 35 ms 10588 KB Output isn't correct
19 Correct 67 ms 10244 KB Output is correct
20 Correct 79 ms 14728 KB Output is correct
21 Correct 52 ms 7588 KB Output is correct
22 Correct 52 ms 7764 KB Output is correct
23 Correct 69 ms 12880 KB Output is correct
24 Correct 71 ms 13112 KB Output is correct
25 Incorrect 73 ms 12536 KB Output isn't correct
26 Incorrect 72 ms 12884 KB Output isn't correct
27 Correct 68 ms 12884 KB Output is correct
28 Incorrect 85 ms 12716 KB Output isn't correct
29 Correct 42 ms 5976 KB Output is correct
30 Incorrect 68 ms 11764 KB Output isn't correct
31 Incorrect 73 ms 12368 KB Output isn't correct
32 Correct 51 ms 7516 KB Output is correct
33 Correct 67 ms 9000 KB Output is correct
34 Correct 71 ms 11868 KB Output is correct
35 Incorrect 70 ms 12372 KB Output isn't correct
36 Incorrect 74 ms 13456 KB Output isn't correct
37 Correct 47 ms 13140 KB Output is correct
38 Incorrect 80 ms 12952 KB Output isn't correct
39 Correct 88 ms 14932 KB Output is correct
40 Correct 73 ms 12668 KB Output is correct
41 Incorrect 46 ms 13396 KB Output isn't correct
42 Correct 70 ms 13676 KB Output is correct
43 Correct 46 ms 13124 KB Output is correct
44 Incorrect 65 ms 11356 KB Output isn't correct
45 Correct 61 ms 8704 KB Output is correct
46 Correct 80 ms 14720 KB Output is correct
47 Incorrect 48 ms 12500 KB Output isn't correct
48 Correct 62 ms 10668 KB Output is correct
49 Correct 74 ms 13088 KB Output is correct
50 Correct 87 ms 15088 KB Output is correct
51 Incorrect 68 ms 11864 KB Output isn't correct
52 Correct 58 ms 9308 KB Output is correct
53 Incorrect 82 ms 14932 KB Output isn't correct
54 Incorrect 63 ms 10096 KB Output isn't correct
55 Incorrect 80 ms 14932 KB Output isn't correct
56 Correct 78 ms 14844 KB Output is correct
57 Incorrect 70 ms 12368 KB Output isn't correct
58 Correct 70 ms 13136 KB Output is correct
59 Incorrect 74 ms 13136 KB Output isn't correct
60 Incorrect 42 ms 12744 KB Output isn't correct
61 Incorrect 79 ms 11860 KB Output isn't correct
62 Incorrect 69 ms 12076 KB Output isn't correct
63 Incorrect 36 ms 10576 KB Output isn't correct
64 Incorrect 80 ms 13320 KB Output isn't correct
65 Correct 45 ms 12880 KB Output is correct
66 Incorrect 73 ms 12972 KB Output isn't correct
67 Incorrect 76 ms 13180 KB Output isn't correct
68 Correct 62 ms 10296 KB Output is correct
69 Correct 60 ms 10836 KB Output is correct
70 Correct 68 ms 12628 KB Output is correct
71 Incorrect 73 ms 12884 KB Output isn't correct
72 Correct 66 ms 9552 KB Output is correct
73 Incorrect 72 ms 12924 KB Output isn't correct
74 Incorrect 69 ms 11348 KB Output isn't correct
75 Correct 82 ms 14940 KB Output is correct
76 Correct 74 ms 13136 KB Output is correct
77 Correct 55 ms 8796 KB Output is correct
78 Incorrect 72 ms 13444 KB Output isn't correct
79 Incorrect 70 ms 12360 KB Output isn't correct
80 Correct 79 ms 14932 KB Output is correct
81 Correct 62 ms 10316 KB Output is correct
82 Correct 40 ms 4952 KB Output is correct
83 Correct 74 ms 11364 KB Output is correct
84 Correct 67 ms 12628 KB Output is correct
85 Correct 78 ms 14416 KB Output is correct
86 Correct 81 ms 14928 KB Output is correct
87 Incorrect 72 ms 13668 KB Output isn't correct
88 Correct 82 ms 14840 KB Output is correct
89 Incorrect 75 ms 12724 KB Output isn't correct
90 Incorrect 69 ms 12136 KB Output isn't correct
91 Incorrect 61 ms 11088 KB Output isn't correct
92 Correct 87 ms 13140 KB Output is correct
93 Correct 61 ms 10760 KB Output is correct
94 Correct 68 ms 12992 KB Output is correct
95 Correct 42 ms 12196 KB Output is correct
96 Incorrect 49 ms 14160 KB Output isn't correct
97 Correct 53 ms 9048 KB Output is correct
98 Incorrect 61 ms 10680 KB Output isn't correct
99 Correct 72 ms 12884 KB Output is correct
100 Incorrect 71 ms 12884 KB Output isn't correct
101 Correct 78 ms 14424 KB Output is correct
102 Incorrect 44 ms 12116 KB Output isn't correct