oj.uz

Submission #554118

# Submission time Handle Problem Language Result Execution time Memory
554118 2022-04-27T16:56:08 Z elazarkoren Art Class (IOI13_artclass) C++17
36 / 100
 73 ms 3500 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.3;
    }
};

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 <= 4; 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
36.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 3440 KB Output isn't correct
2 Correct 23 ms 1740 KB Output is correct
3 Correct 42 ms 3368 KB Output is correct
4 Correct 42 ms 2924 KB Output is correct
5 Incorrect 29 ms 3384 KB Output isn't correct
6 Correct 44 ms 3404 KB Output is correct
7 Correct 32 ms 3452 KB Output is correct
8 Correct 39 ms 2636 KB Output is correct
9 Correct 11 ms 980 KB Output is correct
10 Correct 27 ms 2004 KB Output is correct
11 Correct 39 ms 3456 KB Output is correct
12 Correct 32 ms 2380 KB Output is correct
13 Incorrect 69 ms 3468 KB Output isn't correct
14 Incorrect 47 ms 3080 KB Output isn't correct
15 Incorrect 48 ms 3444 KB Output isn't correct
16 Incorrect 34 ms 3356 KB Output isn't correct
17 Correct 25 ms 1996 KB Output is correct
18 Correct 30 ms 3432 KB Output is correct
19 Correct 40 ms 2892 KB Output is correct
20 Correct 41 ms 3480 KB Output is correct
21 Correct 41 ms 3392 KB Output is correct
22 Incorrect 40 ms 3484 KB Output isn't correct
23 Correct 36 ms 3464 KB Output is correct
24 Incorrect 40 ms 3392 KB Output isn't correct
25 Correct 42 ms 2904 KB Output is correct
26 Correct 39 ms 3456 KB Output is correct
27 Correct 41 ms 2760 KB Output is correct
28 Incorrect 44 ms 3264 KB Output isn't correct
29 Incorrect 33 ms 2124 KB Output isn't correct
30 Incorrect 39 ms 3468 KB Output isn't correct
31 Incorrect 43 ms 3380 KB Output isn't correct
32 Correct 38 ms 2640 KB Output is correct
33 Incorrect 32 ms 3404 KB Output isn't correct
34 Correct 50 ms 3456 KB Output is correct
35 Correct 49 ms 3436 KB Output is correct
36 Incorrect 38 ms 2732 KB Output isn't correct
37 Correct 40 ms 2680 KB Output is correct
38 Correct 43 ms 2820 KB Output is correct
39 Incorrect 51 ms 3324 KB Output isn't correct
40 Correct 37 ms 2672 KB Output is correct
41 Correct 40 ms 2892 KB Output is correct
42 Correct 41 ms 2772 KB Output is correct
43 Incorrect 40 ms 3444 KB Output isn't correct
44 Incorrect 49 ms 3408 KB Output isn't correct
45 Correct 59 ms 3372 KB Output is correct
46 Correct 50 ms 3388 KB Output is correct
47 Incorrect 34 ms 2384 KB Output isn't correct
48 Correct 32 ms 3400 KB Output is correct
49 Incorrect 28 ms 3404 KB Output isn't correct
50 Incorrect 20 ms 1612 KB Output isn't correct
51 Correct 51 ms 3428 KB Output is correct
52 Incorrect 22 ms 1740 KB Output isn't correct
53 Incorrect 65 ms 2928 KB Output isn't correct
54 Incorrect 34 ms 3404 KB Output isn't correct
55 Incorrect 36 ms 3408 KB Output isn't correct
56 Incorrect 31 ms 3404 KB Output isn't correct
57 Correct 41 ms 3472 KB Output is correct
58 Correct 52 ms 3388 KB Output is correct
59 Correct 44 ms 3396 KB Output is correct
60 Correct 50 ms 2908 KB Output is correct
61 Correct 44 ms 3360 KB Output is correct
62 Correct 34 ms 3500 KB Output is correct
63 Incorrect 26 ms 1996 KB Output isn't correct
64 Correct 31 ms 2364 KB Output is correct
65 Correct 39 ms 2788 KB Output is correct
66 Incorrect 42 ms 2940 KB Output isn't correct
67 Incorrect 26 ms 1964 KB Output isn't correct
68 Correct 41 ms 3472 KB Output is correct
69 Correct 34 ms 3372 KB Output is correct
70 Incorrect 39 ms 3464 KB Output isn't correct
71 Correct 33 ms 2356 KB Output is correct
72 Correct 39 ms 3436 KB Output is correct
73 Correct 40 ms 2880 KB Output is correct
74 Incorrect 41 ms 3120 KB Output isn't correct
75 Correct 40 ms 3400 KB Output is correct
76 Correct 42 ms 3056 KB Output is correct
77 Incorrect 43 ms 3472 KB Output isn't correct
78 Correct 38 ms 2780 KB Output is correct
79 Correct 53 ms 3396 KB Output is correct
80 Correct 31 ms 2316 KB Output is correct
81 Incorrect 39 ms 3452 KB Output isn't correct
82 Correct 35 ms 2880 KB Output is correct
83 Incorrect 24 ms 3392 KB Output isn't correct
84 Correct 73 ms 3376 KB Output is correct
85 Correct 33 ms 3468 KB Output is correct
86 Correct 49 ms 3436 KB Output is correct
87 Incorrect 51 ms 3444 KB Output isn't correct
88 Incorrect 43 ms 2852 KB Output isn't correct
89 Correct 33 ms 3432 KB Output is correct
90 Correct 42 ms 2892 KB Output is correct
91 Correct 67 ms 3440 KB Output is correct
92 Incorrect 50 ms 3424 KB Output isn't correct
93 Correct 36 ms 2704 KB Output is correct
94 Correct 36 ms 3472 KB Output is correct
95 Correct 40 ms 2948 KB Output is correct
96 Correct 48 ms 3400 KB Output is correct
97 Incorrect 42 ms 3432 KB Output isn't correct
98 Incorrect 42 ms 3364 KB Output isn't correct
99 Correct 13 ms 3340 KB Output is correct
100 Correct 39 ms 2892 KB Output is correct
101 Incorrect 38 ms 3412 KB Output isn't correct
102 Correct 41 ms 2764 KB Output is correct