oj.uz

Submission #955251

# Submission time Handle Problem Language Result Execution time Memory
955251 2024-03-30T00:59:33 Z Programmer123 Art Class (IOI13_artclass) C++17
27 / 100
 91 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 += (std::abs(data[i][j].h - 120.0) < 20.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++;
    }
    if (numG > 2500) {
        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
27.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 10324 KB Output is correct
2 Correct 80 ms 12892 KB Output is correct
3 Correct 51 ms 12896 KB Output is correct
4 Incorrect 48 ms 12884 KB Output isn't correct
5 Incorrect 51 ms 11604 KB Output isn't correct
6 Correct 55 ms 7764 KB Output is correct
7 Correct 77 ms 11860 KB Output is correct
8 Incorrect 50 ms 12288 KB Output isn't correct
9 Incorrect 86 ms 14928 KB Output isn't correct
10 Incorrect 51 ms 13648 KB Output isn't correct
11 Incorrect 76 ms 13112 KB Output isn't correct
12 Correct 58 ms 14972 KB Output is correct
13 Correct 66 ms 10076 KB Output is correct
14 Correct 56 ms 8896 KB Output is correct
15 Incorrect 41 ms 11016 KB Output isn't correct
16 Correct 50 ms 12628 KB Output is correct
17 Correct 57 ms 14660 KB Output is correct
18 Incorrect 72 ms 12116 KB Output isn't correct
19 Incorrect 91 ms 15156 KB Output isn't correct
20 Correct 60 ms 8796 KB Output is correct
21 Correct 47 ms 12464 KB Output is correct
22 Incorrect 76 ms 12628 KB Output isn't correct
23 Correct 49 ms 12704 KB Output is correct
24 Correct 51 ms 12896 KB Output is correct
25 Correct 41 ms 5992 KB Output is correct
26 Correct 78 ms 13140 KB Output is correct
27 Incorrect 65 ms 10840 KB Output isn't correct
28 Incorrect 35 ms 10328 KB Output isn't correct
29 Incorrect 87 ms 14756 KB Output isn't correct
30 Incorrect 64 ms 10576 KB Output isn't correct
31 Correct 45 ms 11848 KB Output is correct
32 Incorrect 52 ms 13404 KB Output isn't correct
33 Correct 51 ms 12880 KB Output is correct
34 Correct 60 ms 14932 KB Output is correct
35 Correct 70 ms 11124 KB Output is correct
36 Correct 41 ms 5040 KB Output is correct
37 Correct 58 ms 14928 KB Output is correct
38 Incorrect 68 ms 11496 KB Output isn't correct
39 Incorrect 48 ms 11604 KB Output isn't correct
40 Incorrect 61 ms 9304 KB Output isn't correct
41 Correct 81 ms 13512 KB Output is correct
42 Correct 68 ms 11344 KB Output is correct
43 Correct 83 ms 13856 KB Output is correct
44 Incorrect 66 ms 10844 KB Output isn't correct
45 Correct 73 ms 12880 KB Output is correct
46 Incorrect 49 ms 12504 KB Output isn't correct
47 Incorrect 35 ms 8788 KB Output isn't correct
48 Correct 64 ms 10968 KB Output is correct
49 Incorrect 53 ms 13136 KB Output isn't correct
50 Incorrect 79 ms 12968 KB Output isn't correct
51 Correct 48 ms 12044 KB Output is correct
52 Correct 46 ms 11856 KB Output is correct
53 Correct 58 ms 14672 KB Output is correct
54 Correct 77 ms 13652 KB Output is correct
55 Correct 84 ms 14416 KB Output is correct
56 Correct 48 ms 12656 KB Output is correct
57 Incorrect 46 ms 10576 KB Output isn't correct
58 Incorrect 80 ms 12892 KB Output isn't correct
59 Correct 57 ms 14948 KB Output is correct
60 Correct 76 ms 10480 KB Output is correct
61 Correct 60 ms 15104 KB Output is correct
62 Incorrect 26 ms 7260 KB Output isn't correct
63 Incorrect 74 ms 12512 KB Output isn't correct
64 Correct 48 ms 12860 KB Output is correct
65 Incorrect 58 ms 14136 KB Output isn't correct
66 Correct 72 ms 11752 KB Output is correct
67 Correct 75 ms 12884 KB Output is correct
68 Incorrect 53 ms 12380 KB Output isn't correct
69 Incorrect 51 ms 12332 KB Output isn't correct
70 Incorrect 48 ms 12732 KB Output isn't correct
71 Incorrect 72 ms 11856 KB Output isn't correct
72 Correct 74 ms 12560 KB Output is correct
73 Correct 71 ms 11092 KB Output is correct
74 Correct 91 ms 15076 KB Output is correct
75 Correct 46 ms 12624 KB Output is correct
76 Correct 61 ms 9000 KB Output is correct
77 Incorrect 39 ms 10324 KB Output isn't correct
78 Correct 78 ms 12632 KB Output is correct
79 Incorrect 28 ms 7704 KB Output isn't correct
80 Incorrect 79 ms 12376 KB Output isn't correct
81 Incorrect 55 ms 13140 KB Output isn't correct
82 Incorrect 76 ms 12884 KB Output isn't correct
83 Correct 77 ms 12880 KB Output is correct
84 Incorrect 81 ms 13276 KB Output isn't correct
85 Incorrect 77 ms 12612 KB Output isn't correct
86 Correct 35 ms 9816 KB Output is correct
87 Incorrect 43 ms 12096 KB Output isn't correct
88 Correct 75 ms 12884 KB Output is correct
89 Correct 61 ms 10064 KB Output is correct
90 Incorrect 73 ms 12116 KB Output isn't correct
91 Correct 69 ms 11344 KB Output is correct
92 Correct 51 ms 13284 KB Output is correct
93 Correct 75 ms 13080 KB Output is correct
94 Incorrect 46 ms 12716 KB Output isn't correct
95 Correct 54 ms 14432 KB Output is correct
96 Correct 80 ms 13396 KB Output is correct
97 Correct 72 ms 12808 KB Output is correct
98 Incorrect 90 ms 14996 KB Output isn't correct
99 Correct 67 ms 10320 KB Output is correct
100 Correct 31 ms 8788 KB Output is correct
101 Correct 58 ms 14968 KB Output is correct
102 Correct 58 ms 14680 KB Output is correct