oj.uz

Submission #554097

# Submission time Handle Problem Language Result Execution time Memory
554097 2022-04-27T16:26:38 Z elazarkoren Art Class (IOI13_artclass) C++17
12 / 100
 56 ms 3268 KB 
#include "artclass.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int infinity = 1e9;

struct Style{
    int red, green, blue, gray;
    Style() {}
    Style(int r, int g, int b, int gr): red(r), green(g), blue(b), gray(gr) {}
    int Close(int r, int g, int b, int gr) {
        return abs(r - red) + abs(g - green) + abs(b - blue) + abs(gr - gray);
    }
};

Style s[] = {Style(), Style(146, 166, 146, 167), Style(67, 97, 63, 87), Style(106, 128, 106, 124), Style(54, 89, 54, 100)};

int cnt[5];

void ClosestR(int x) {
    int ans = infinity;
    for (int i = 1; i <= 4; i++) {
        chkmin(ans, abs(x - s[i].red));
    }
    for (int i = 1; i <= 4; i++) {
        if (abs(x - s[i].red) == ans) {
            cnt[i]++;
        }
    }
}

void ClosestG(int x) {
    int ans = infinity;
    for (int i = 1; i <= 4; i++) {
        chkmin(ans, abs(x - s[i].green));
    }
    for (int i = 1; i <= 4; i++) {
        if (abs(x - s[i].green) == ans) {
            cnt[i]++;
        }
    }
}

void ClosestB(int x) {
    int ans = infinity;
    for (int i = 1; i <= 4; i++) {
        chkmin(ans, abs(x - s[i].blue));
    }
    for (int i = 1; i <= 4; i++) {
        if (abs(x - s[i].blue) == ans) {
            cnt[i]++;
        }
    }
}

void ClosestGr(int x) {
    int ans = infinity;
    for (int i = 1; i <= 4; i++) {
        chkmin(ans, abs(x - s[i].gray));
    }
    for (int i = 1; i <= 4; i++) {
        if (abs(x - s[i].gray) == ans) {
            cnt[i]++;
        }
    }
}


int style(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
    ll sum_r = 0, sum_g = 0, sum_b = 0, gray_scale = 0;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            sum_r += r[i][j], sum_g += g[i][j], sum_b += b[i][j];
            gray_scale += (r[i][j] + g[i][j] + b[i][j]) / 3;
        }
    }
    sum_r /= (h * w);
    sum_g /= (h * w);
    sum_b /= (h * w);
    gray_scale /= (h * w);
    cnt[1] = cnt[2] = cnt[3] = cnt[4] = 0;
    ClosestR(sum_r), ClosestG(sum_g), ClosestB(sum_b), ClosestGr(gray_scale);
    int max_cnt = 0;
    for (int i = 1; i <= 4; i++) {
        chkmax(max_cnt, cnt[i]);
    }
    pii ans = {infinity, 0};
    for (int i = 1; i <= 4; i++) {
        if (cnt[i] == max_cnt) {
            pii q = {s[i].Close(sum_r, sum_g, sum_b, gray_scale), i};
            chkmin(ans, q);
        }
    }
    return ans.y;
}

Subtask #1
12.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2468 KB Output is correct
2 Incorrect 41 ms 2608 KB Output isn't correct
3 Correct 41 ms 2572 KB Output is correct
4 Incorrect 42 ms 3148 KB Output isn't correct
5 Incorrect 41 ms 2684 KB Output isn't correct
6 Incorrect 43 ms 3212 KB Output isn't correct
7 Correct 48 ms 3196 KB Output is correct
8 Incorrect 48 ms 2764 KB Output isn't correct
9 Incorrect 42 ms 2444 KB Output isn't correct
10 Correct 37 ms 2380 KB Output is correct
11 Incorrect 44 ms 3148 KB Output isn't correct
12 Incorrect 34 ms 3200 KB Output isn't correct
13 Correct 50 ms 3168 KB Output is correct
14 Incorrect 42 ms 2696 KB Output isn't correct
15 Incorrect 37 ms 3204 KB Output isn't correct
16 Correct 43 ms 2656 KB Output is correct
17 Incorrect 47 ms 3124 KB Output isn't correct
18 Incorrect 28 ms 1764 KB Output isn't correct
19 Correct 42 ms 3268 KB Output is correct
20 Incorrect 46 ms 2696 KB Output isn't correct
21 Correct 27 ms 1740 KB Output is correct
22 Incorrect 51 ms 3152 KB Output isn't correct
23 Correct 34 ms 2020 KB Output is correct
24 Incorrect 43 ms 2644 KB Output isn't correct
25 Incorrect 44 ms 2760 KB Output isn't correct
26 Correct 43 ms 3200 KB Output is correct
27 Correct 38 ms 2516 KB Output is correct
28 Correct 39 ms 2472 KB Output is correct
29 Incorrect 45 ms 3148 KB Output isn't correct
30 Correct 51 ms 3152 KB Output is correct
31 Correct 28 ms 3172 KB Output is correct
32 Correct 11 ms 852 KB Output is correct
33 Correct 50 ms 3184 KB Output is correct
34 Correct 47 ms 3132 KB Output is correct
35 Correct 42 ms 2596 KB Output is correct
36 Incorrect 44 ms 3152 KB Output isn't correct
37 Correct 53 ms 3212 KB Output is correct
38 Incorrect 45 ms 3148 KB Output isn't correct
39 Incorrect 52 ms 3148 KB Output isn't correct
40 Correct 32 ms 3148 KB Output is correct
41 Correct 13 ms 3156 KB Output is correct
42 Incorrect 36 ms 3144 KB Output isn't correct
43 Correct 49 ms 3160 KB Output is correct
44 Incorrect 43 ms 2608 KB Output isn't correct
45 Correct 45 ms 2640 KB Output is correct
46 Incorrect 50 ms 3160 KB Output isn't correct
47 Incorrect 31 ms 1512 KB Output isn't correct
48 Incorrect 32 ms 3160 KB Output isn't correct
49 Incorrect 41 ms 3120 KB Output isn't correct
50 Correct 48 ms 3108 KB Output is correct
51 Incorrect 41 ms 3152 KB Output isn't correct
52 Incorrect 43 ms 3204 KB Output isn't correct
53 Incorrect 40 ms 3128 KB Output isn't correct
54 Correct 43 ms 3148 KB Output is correct
55 Correct 26 ms 3152 KB Output is correct
56 Incorrect 42 ms 3128 KB Output isn't correct
57 Incorrect 45 ms 3152 KB Output isn't correct
58 Incorrect 43 ms 2752 KB Output isn't correct
59 Incorrect 42 ms 3136 KB Output isn't correct
60 Correct 44 ms 3104 KB Output is correct
61 Correct 52 ms 3128 KB Output is correct
62 Correct 45 ms 2732 KB Output is correct
63 Incorrect 32 ms 3176 KB Output isn't correct
64 Incorrect 35 ms 2172 KB Output isn't correct
65 Incorrect 45 ms 2768 KB Output isn't correct
66 Incorrect 32 ms 3104 KB Output isn't correct
67 Correct 41 ms 3164 KB Output is correct
68 Correct 40 ms 2508 KB Output is correct
69 Correct 28 ms 1748 KB Output is correct
70 Correct 42 ms 2488 KB Output is correct
71 Incorrect 39 ms 3128 KB Output isn't correct
72 Incorrect 44 ms 3212 KB Output isn't correct
73 Correct 38 ms 2532 KB Output is correct
74 Correct 41 ms 3144 KB Output is correct
75 Correct 38 ms 2548 KB Output is correct
76 Correct 51 ms 3168 KB Output is correct
77 Incorrect 48 ms 3056 KB Output isn't correct
78 Correct 33 ms 2184 KB Output is correct
79 Correct 56 ms 2764 KB Output is correct
80 Correct 35 ms 3160 KB Output is correct
81 Correct 53 ms 3148 KB Output is correct
82 Incorrect 36 ms 3148 KB Output isn't correct
83 Correct 33 ms 2132 KB Output is correct
84 Correct 23 ms 1404 KB Output is correct
85 Correct 38 ms 2436 KB Output is correct
86 Correct 31 ms 3180 KB Output is correct
87 Incorrect 45 ms 2732 KB Output isn't correct
88 Incorrect 30 ms 1876 KB Output isn't correct
89 Incorrect 23 ms 1492 KB Output isn't correct
90 Correct 36 ms 3164 KB Output is correct
91 Incorrect 27 ms 1684 KB Output isn't correct
92 Correct 51 ms 3144 KB Output is correct
93 Correct 52 ms 3224 KB Output is correct
94 Correct 32 ms 1996 KB Output is correct
95 Incorrect 46 ms 3168 KB Output isn't correct
96 Incorrect 31 ms 3156 KB Output isn't correct
97 Correct 39 ms 3260 KB Output is correct
98 Correct 39 ms 2452 KB Output is correct
99 Correct 35 ms 3204 KB Output is correct
100 Incorrect 53 ms 3192 KB Output isn't correct
101 Incorrect 45 ms 3152 KB Output isn't correct
102 Incorrect 44 ms 3108 KB Output isn't correct