oj.uz

Submission #554121

# Submission time Handle Problem Language Result Execution time Memory
554121 2022-04-27T17:03:06 Z elazarkoren Art Class (IOI13_artclass) C++17
36 / 100
 74 ms 3652 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) {}
    double Close(int r, int g, int b, int gr) {
        return sqrt((r - red) * (r - red) + (g - green) * (g - green) + (b - blue) * (b - blue) + (gr - gray) * (gr - gray));
//        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, 61), Style(67, 97, 63, 87, 44), Style(106, 128, 106, 124, 51), Style(54, 89, 54, 100, 132)};

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:96:9: warning: unused variable 'max_cnt' [-Wunused-variable]
   96 |     int max_cnt = 0;
      |         ^~~~~~~

Subtask #1
36.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 3500 KB Output is correct
2 Correct 41 ms 3524 KB Output is correct
3 Correct 50 ms 3536 KB Output is correct
4 Correct 38 ms 3544 KB Output is correct
5 Incorrect 33 ms 2508 KB Output isn't correct
6 Incorrect 39 ms 3504 KB Output isn't correct
7 Correct 41 ms 3532 KB Output is correct
8 Incorrect 42 ms 3000 KB Output isn't correct
9 Correct 34 ms 3532 KB Output is correct
10 Correct 40 ms 3532 KB Output is correct
11 Correct 38 ms 3544 KB Output is correct
12 Correct 27 ms 1832 KB Output is correct
13 Correct 42 ms 3532 KB Output is correct
14 Incorrect 54 ms 3532 KB Output isn't correct
15 Correct 37 ms 2812 KB Output is correct
16 Correct 31 ms 2440 KB Output is correct
17 Incorrect 41 ms 3160 KB Output isn't correct
18 Incorrect 35 ms 3620 KB Output isn't correct
19 Incorrect 41 ms 3588 KB Output isn't correct
20 Correct 41 ms 3592 KB Output is correct
21 Correct 39 ms 2820 KB Output is correct
22 Correct 40 ms 2964 KB Output is correct
23 Correct 36 ms 3520 KB Output is correct
24 Incorrect 38 ms 3020 KB Output isn't correct
25 Correct 39 ms 3544 KB Output is correct
26 Correct 37 ms 2724 KB Output is correct
27 Incorrect 30 ms 2256 KB Output isn't correct
28 Correct 26 ms 2056 KB Output is correct
29 Incorrect 38 ms 3536 KB Output isn't correct
30 Correct 31 ms 3552 KB Output is correct
31 Incorrect 41 ms 3584 KB Output isn't correct
32 Incorrect 49 ms 3488 KB Output isn't correct
33 Correct 48 ms 3064 KB Output is correct
34 Correct 37 ms 2940 KB Output is correct
35 Correct 41 ms 2916 KB Output is correct
36 Correct 41 ms 2860 KB Output is correct
37 Correct 39 ms 3024 KB Output is correct
38 Correct 36 ms 2896 KB Output is correct
39 Incorrect 41 ms 3148 KB Output isn't correct
40 Incorrect 27 ms 3532 KB Output isn't correct
41 Incorrect 42 ms 3532 KB Output isn't correct
42 Incorrect 39 ms 3516 KB Output isn't correct
43 Correct 41 ms 3540 KB Output is correct
44 Correct 59 ms 3588 KB Output is correct
45 Correct 31 ms 2544 KB Output is correct
46 Correct 36 ms 2488 KB Output is correct
47 Correct 40 ms 3524 KB Output is correct
48 Incorrect 51 ms 3492 KB Output isn't correct
49 Incorrect 39 ms 2844 KB Output isn't correct
50 Correct 45 ms 2928 KB Output is correct
51 Correct 47 ms 3596 KB Output is correct
52 Incorrect 40 ms 3580 KB Output isn't correct
53 Correct 29 ms 3532 KB Output is correct
54 Incorrect 30 ms 3532 KB Output isn't correct
55 Correct 74 ms 3524 KB Output is correct
56 Incorrect 44 ms 3536 KB Output isn't correct
57 Correct 44 ms 3368 KB Output is correct
58 Incorrect 42 ms 3564 KB Output isn't correct
59 Incorrect 49 ms 3556 KB Output isn't correct
60 Correct 47 ms 3488 KB Output is correct
61 Correct 48 ms 3572 KB Output is correct
62 Correct 40 ms 3148 KB Output is correct
63 Correct 45 ms 3120 KB Output is correct
64 Incorrect 31 ms 3652 KB Output isn't correct
65 Correct 38 ms 2912 KB Output is correct
66 Incorrect 46 ms 3496 KB Output isn't correct
67 Correct 10 ms 1116 KB Output is correct
68 Correct 38 ms 3512 KB Output is correct
69 Incorrect 32 ms 3552 KB Output isn't correct
70 Correct 43 ms 3548 KB Output is correct
71 Correct 43 ms 3096 KB Output is correct
72 Incorrect 44 ms 3600 KB Output isn't correct
73 Correct 40 ms 3092 KB Output is correct
74 Incorrect 29 ms 3488 KB Output isn't correct
75 Incorrect 26 ms 2124 KB Output isn't correct
76 Correct 30 ms 3532 KB Output is correct
77 Incorrect 51 ms 3492 KB Output isn't correct
78 Correct 37 ms 2852 KB Output is correct
79 Incorrect 24 ms 3512 KB Output isn't correct
80 Correct 55 ms 2880 KB Output is correct
81 Correct 36 ms 3520 KB Output is correct
82 Incorrect 35 ms 2124 KB Output isn't correct
83 Incorrect 36 ms 3560 KB Output isn't correct
84 Incorrect 39 ms 3508 KB Output isn't correct
85 Incorrect 45 ms 3544 KB Output isn't correct
86 Correct 37 ms 3528 KB Output is correct
87 Correct 42 ms 3196 KB Output is correct
88 Correct 48 ms 3572 KB Output is correct
89 Correct 52 ms 3584 KB Output is correct
90 Correct 12 ms 3412 KB Output is correct
91 Incorrect 43 ms 3084 KB Output isn't correct
92 Correct 38 ms 2852 KB Output is correct
93 Incorrect 41 ms 3176 KB Output isn't correct
94 Correct 39 ms 2920 KB Output is correct
95 Correct 26 ms 2096 KB Output is correct
96 Correct 40 ms 3580 KB Output is correct
97 Correct 40 ms 3600 KB Output is correct
98 Incorrect 23 ms 1740 KB Output isn't correct
99 Correct 21 ms 1868 KB Output is correct
100 Incorrect 39 ms 3600 KB Output isn't correct
101 Correct 34 ms 2584 KB Output is correct
102 Correct 33 ms 3544 KB Output is correct