oj.uz

Submission #554129

# Submission time Handle Problem Language Result Execution time Memory
554129 2022-04-27T17:13:42 Z elazarkoren Art Class (IOI13_artclass) C++17
29 / 100
 49 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, 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.5;
    }
};

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
29.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 3156 KB Output isn't correct
2 Incorrect 38 ms 3224 KB Output isn't correct
3 Correct 37 ms 2336 KB Output is correct
4 Correct 36 ms 2508 KB Output is correct
5 Incorrect 35 ms 3164 KB Output isn't correct
6 Incorrect 38 ms 3180 KB Output isn't correct
7 Incorrect 37 ms 2460 KB Output isn't correct
8 Incorrect 37 ms 3100 KB Output isn't correct
9 Incorrect 37 ms 3156 KB Output isn't correct
10 Correct 43 ms 2764 KB Output is correct
11 Correct 45 ms 3160 KB Output is correct
12 Correct 31 ms 3236 KB Output is correct
13 Correct 44 ms 3076 KB Output is correct
14 Correct 29 ms 3156 KB Output is correct
15 Correct 39 ms 3220 KB Output is correct
16 Correct 36 ms 2380 KB Output is correct
17 Correct 38 ms 3188 KB Output is correct
18 Correct 30 ms 3156 KB Output is correct
19 Correct 33 ms 3140 KB Output is correct
20 Correct 40 ms 3156 KB Output is correct
21 Incorrect 42 ms 2928 KB Output isn't correct
22 Correct 21 ms 1408 KB Output is correct
23 Correct 45 ms 3184 KB Output is correct
24 Incorrect 48 ms 3216 KB Output isn't correct
25 Incorrect 37 ms 3192 KB Output isn't correct
26 Correct 42 ms 3120 KB Output is correct
27 Correct 41 ms 2752 KB Output is correct
28 Correct 43 ms 3204 KB Output is correct
29 Incorrect 46 ms 3100 KB Output isn't correct
30 Incorrect 37 ms 3148 KB Output isn't correct
31 Correct 31 ms 3212 KB Output is correct
32 Incorrect 25 ms 1740 KB Output isn't correct
33 Incorrect 32 ms 2148 KB Output isn't correct
34 Correct 27 ms 3196 KB Output is correct
35 Incorrect 41 ms 3112 KB Output isn't correct
36 Incorrect 41 ms 2648 KB Output isn't correct
37 Correct 39 ms 2708 KB Output is correct
38 Incorrect 29 ms 1904 KB Output isn't correct
39 Correct 39 ms 2604 KB Output is correct
40 Correct 40 ms 2712 KB Output is correct
41 Correct 37 ms 2556 KB Output is correct
42 Correct 46 ms 3164 KB Output is correct
43 Incorrect 32 ms 3220 KB Output isn't correct
44 Correct 39 ms 2528 KB Output is correct
45 Correct 38 ms 2636 KB Output is correct
46 Incorrect 24 ms 3156 KB Output isn't correct
47 Incorrect 40 ms 2836 KB Output isn't correct
48 Correct 38 ms 2548 KB Output is correct
49 Incorrect 37 ms 3148 KB Output isn't correct
50 Correct 40 ms 3192 KB Output is correct
51 Incorrect 41 ms 2708 KB Output isn't correct
52 Correct 32 ms 2132 KB Output is correct
53 Incorrect 46 ms 3212 KB Output isn't correct
54 Correct 28 ms 2000 KB Output is correct
55 Incorrect 39 ms 3148 KB Output isn't correct
56 Correct 38 ms 3128 KB Output is correct
57 Incorrect 49 ms 3164 KB Output isn't correct
58 Correct 36 ms 2556 KB Output is correct
59 Correct 42 ms 3144 KB Output is correct
60 Correct 36 ms 2416 KB Output is correct
61 Incorrect 40 ms 2676 KB Output isn't correct
62 Correct 40 ms 2804 KB Output is correct
63 Correct 37 ms 2356 KB Output is correct
64 Correct 46 ms 3124 KB Output is correct
65 Correct 45 ms 3120 KB Output is correct
66 Incorrect 29 ms 3208 KB Output isn't correct
67 Incorrect 31 ms 3128 KB Output isn't correct
68 Correct 36 ms 2576 KB Output is correct
69 Correct 33 ms 3268 KB Output is correct
70 Correct 36 ms 3140 KB Output is correct
71 Correct 44 ms 2204 KB Output is correct
72 Incorrect 19 ms 1492 KB Output isn't correct
73 Incorrect 47 ms 2944 KB Output isn't correct
74 Correct 35 ms 2492 KB Output is correct
75 Incorrect 36 ms 3148 KB Output isn't correct
76 Incorrect 39 ms 2688 KB Output isn't correct
77 Correct 37 ms 3212 KB Output is correct
78 Correct 25 ms 1748 KB Output is correct
79 Correct 39 ms 3108 KB Output is correct
80 Correct 45 ms 3164 KB Output is correct
81 Incorrect 27 ms 3140 KB Output isn't correct
82 Incorrect 41 ms 3208 KB Output isn't correct
83 Correct 48 ms 3136 KB Output is correct
84 Incorrect 41 ms 3128 KB Output isn't correct
85 Correct 37 ms 2548 KB Output is correct
86 Correct 20 ms 1492 KB Output is correct
87 Incorrect 24 ms 1808 KB Output isn't correct
88 Correct 46 ms 3148 KB Output is correct
89 Correct 28 ms 3160 KB Output is correct
90 Correct 12 ms 3156 KB Output is correct
91 Incorrect 39 ms 3108 KB Output isn't correct
92 Incorrect 44 ms 3120 KB Output isn't correct
93 Incorrect 40 ms 3176 KB Output isn't correct
94 Incorrect 37 ms 3124 KB Output isn't correct
95 Incorrect 31 ms 3148 KB Output isn't correct
96 Correct 25 ms 1696 KB Output is correct
97 Correct 31 ms 2088 KB Output is correct
98 Correct 34 ms 2460 KB Output is correct
99 Correct 39 ms 2572 KB Output is correct
100 Incorrect 46 ms 3096 KB Output isn't correct
101 Correct 41 ms 3108 KB Output is correct
102 Correct 12 ms 852 KB Output is correct