oj.uz

Submission #554111

# Submission time Handle Problem Language Result Execution time Memory
554111 2022-04-27T16:44:32 Z elazarkoren Art Class (IOI13_artclass) C++17
27 / 100
 61 ms 3312 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, diff;
    Style() {}
    Style(int r, int g, int b, int gr, int diff): red(r), green(g), blue(b), gray(gr), diff(diff) {}
    int Close(int r, int g, int b, int gr) {
        return abs(r - red) + abs(g - green) + abs(b - blue) + abs(gr - gray);
    }
    bool Ok(int r, int g, int b, int gr) {
        return Close(r, g, b, gr) <= diff * 1.5;
    }
};

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

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};
    vi good;
    for (int i = 1; i <= 3; i++) {
        if (s[i].Ok(sum_r, sum_g, sum_b, gray_scale)) good.push_back(i);
    }
    if (good.empty()) return 4;
    for (int i : good) {
        //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;
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:95:9: warning: unused variable 'max_cnt' [-Wunused-variable]
   95 |     int max_cnt = 0;
      |         ^~~~~~~

Subtask #1
27.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 3228 KB Output isn't correct
2 Correct 36 ms 2548 KB Output is correct
3 Incorrect 31 ms 3136 KB Output isn't correct
4 Correct 12 ms 868 KB Output is correct
5 Incorrect 31 ms 3160 KB Output isn't correct
6 Correct 25 ms 1724 KB Output is correct
7 Correct 31 ms 3276 KB Output is correct
8 Incorrect 50 ms 3220 KB Output isn't correct
9 Correct 41 ms 3096 KB Output is correct
10 Incorrect 47 ms 3152 KB Output isn't correct
11 Correct 40 ms 3172 KB Output is correct
12 Correct 47 ms 3188 KB Output is correct
13 Incorrect 36 ms 3136 KB Output isn't correct
14 Incorrect 33 ms 3224 KB Output isn't correct
15 Incorrect 37 ms 3112 KB Output isn't correct
16 Incorrect 21 ms 1384 KB Output isn't correct
17 Correct 44 ms 3124 KB Output is correct
18 Correct 39 ms 2588 KB Output is correct
19 Correct 26 ms 1768 KB Output is correct
20 Correct 39 ms 2416 KB Output is correct
21 Incorrect 31 ms 2140 KB Output isn't correct
22 Incorrect 38 ms 3124 KB Output isn't correct
23 Incorrect 38 ms 3220 KB Output isn't correct
24 Correct 48 ms 3116 KB Output is correct
25 Correct 41 ms 2756 KB Output is correct
26 Correct 40 ms 2692 KB Output is correct
27 Correct 30 ms 3200 KB Output is correct
28 Correct 47 ms 3184 KB Output is correct
29 Incorrect 35 ms 2372 KB Output isn't correct
30 Incorrect 46 ms 3128 KB Output isn't correct
31 Incorrect 38 ms 3116 KB Output isn't correct
32 Correct 35 ms 3220 KB Output is correct
33 Correct 37 ms 2636 KB Output is correct
34 Correct 45 ms 3108 KB Output is correct
35 Correct 34 ms 2380 KB Output is correct
36 Incorrect 41 ms 2864 KB Output isn't correct
37 Incorrect 26 ms 3204 KB Output isn't correct
38 Incorrect 38 ms 3128 KB Output isn't correct
39 Correct 40 ms 3148 KB Output is correct
40 Incorrect 39 ms 3180 KB Output isn't correct
41 Correct 37 ms 2512 KB Output is correct
42 Correct 40 ms 3244 KB Output is correct
43 Incorrect 38 ms 2728 KB Output isn't correct
44 Correct 38 ms 2596 KB Output is correct
45 Correct 42 ms 3156 KB Output is correct
46 Correct 32 ms 2032 KB Output is correct
47 Correct 30 ms 1996 KB Output is correct
48 Incorrect 61 ms 3100 KB Output isn't correct
49 Incorrect 37 ms 3188 KB Output isn't correct
50 Correct 30 ms 2044 KB Output is correct
51 Incorrect 32 ms 3092 KB Output isn't correct
52 Incorrect 29 ms 3148 KB Output isn't correct
53 Incorrect 41 ms 2852 KB Output isn't correct
54 Correct 37 ms 2444 KB Output is correct
55 Incorrect 39 ms 2716 KB Output isn't correct
56 Incorrect 40 ms 2592 KB Output isn't correct
57 Correct 34 ms 3148 KB Output is correct
58 Correct 38 ms 2728 KB Output is correct
59 Incorrect 41 ms 3188 KB Output isn't correct
60 Incorrect 24 ms 3216 KB Output isn't correct
61 Correct 39 ms 3216 KB Output is correct
62 Incorrect 46 ms 3056 KB Output isn't correct
63 Incorrect 43 ms 3132 KB Output isn't correct
64 Correct 38 ms 2552 KB Output is correct
65 Correct 38 ms 3184 KB Output is correct
66 Correct 44 ms 3148 KB Output is correct
67 Correct 41 ms 2628 KB Output is correct
68 Correct 43 ms 2732 KB Output is correct
69 Correct 38 ms 3312 KB Output is correct
70 Incorrect 22 ms 1492 KB Output isn't correct
71 Incorrect 31 ms 3168 KB Output isn't correct
72 Correct 22 ms 1620 KB Output is correct
73 Correct 35 ms 2572 KB Output is correct
74 Correct 53 ms 3184 KB Output is correct
75 Correct 50 ms 3196 KB Output is correct
76 Incorrect 37 ms 3168 KB Output isn't correct
77 Correct 31 ms 3156 KB Output is correct
78 Incorrect 40 ms 3144 KB Output isn't correct
79 Correct 40 ms 2548 KB Output is correct
80 Incorrect 32 ms 3176 KB Output isn't correct
81 Correct 35 ms 2448 KB Output is correct
82 Correct 35 ms 3164 KB Output is correct
83 Correct 30 ms 2124 KB Output is correct
84 Incorrect 24 ms 1712 KB Output isn't correct
85 Correct 38 ms 3152 KB Output is correct
86 Correct 47 ms 3196 KB Output is correct
87 Incorrect 25 ms 1792 KB Output isn't correct
88 Correct 36 ms 2528 KB Output is correct
89 Incorrect 27 ms 1828 KB Output isn't correct
90 Correct 29 ms 3216 KB Output is correct
91 Incorrect 47 ms 3104 KB Output isn't correct
92 Correct 39 ms 2784 KB Output is correct
93 Correct 37 ms 3148 KB Output is correct
94 Correct 35 ms 2376 KB Output is correct
95 Incorrect 45 ms 3164 KB Output isn't correct
96 Correct 49 ms 3112 KB Output is correct
97 Correct 46 ms 3100 KB Output is correct
98 Correct 39 ms 2712 KB Output is correct
99 Incorrect 42 ms 3308 KB Output isn't correct
100 Incorrect 47 ms 3140 KB Output isn't correct
101 Correct 13 ms 3176 KB Output is correct
102 Correct 37 ms 2508 KB Output is correct