oj.uz

Submission #554125

# Submission time Handle Problem Language Result Execution time Memory
554125 2022-04-27T17:08:42 Z elazarkoren Art Class (IOI13_artclass) C++17
38 / 100
 50 ms 3228 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.4;
    }
};

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

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1384 KB Output is correct
2 Correct 34 ms 2380 KB Output is correct
3 Correct 10 ms 852 KB Output is correct
4 Incorrect 38 ms 3148 KB Output isn't correct
5 Incorrect 48 ms 3148 KB Output isn't correct
6 Correct 37 ms 2636 KB Output is correct
7 Incorrect 27 ms 3136 KB Output isn't correct
8 Incorrect 38 ms 3212 KB Output isn't correct
9 Correct 12 ms 3116 KB Output is correct
10 Correct 39 ms 2616 KB Output is correct
11 Incorrect 40 ms 3168 KB Output isn't correct
12 Incorrect 30 ms 3148 KB Output isn't correct
13 Incorrect 25 ms 1740 KB Output isn't correct
14 Incorrect 36 ms 2484 KB Output isn't correct
15 Correct 39 ms 3156 KB Output is correct
16 Incorrect 32 ms 3204 KB Output isn't correct
17 Correct 46 ms 3216 KB Output is correct
18 Correct 37 ms 3104 KB Output is correct
19 Incorrect 35 ms 3116 KB Output isn't correct
20 Incorrect 39 ms 2636 KB Output isn't correct
21 Incorrect 48 ms 3184 KB Output isn't correct
22 Correct 38 ms 2528 KB Output is correct
23 Correct 41 ms 3120 KB Output is correct
24 Correct 30 ms 3156 KB Output is correct
25 Correct 30 ms 3184 KB Output is correct
26 Correct 38 ms 3200 KB Output is correct
27 Correct 47 ms 3136 KB Output is correct
28 Correct 36 ms 3216 KB Output is correct
29 Incorrect 30 ms 3148 KB Output isn't correct
30 Correct 36 ms 2440 KB Output is correct
31 Incorrect 27 ms 3220 KB Output isn't correct
32 Correct 46 ms 3192 KB Output is correct
33 Correct 24 ms 1748 KB Output is correct
34 Incorrect 46 ms 3164 KB Output isn't correct
35 Correct 48 ms 3156 KB Output is correct
36 Correct 29 ms 1980 KB Output is correct
37 Correct 29 ms 3120 KB Output is correct
38 Incorrect 37 ms 3108 KB Output isn't correct
39 Incorrect 45 ms 3152 KB Output isn't correct
40 Correct 40 ms 3124 KB Output is correct
41 Incorrect 38 ms 2652 KB Output isn't correct
42 Incorrect 42 ms 2704 KB Output isn't correct
43 Correct 33 ms 3160 KB Output is correct
44 Incorrect 33 ms 3172 KB Output isn't correct
45 Incorrect 39 ms 2760 KB Output isn't correct
46 Correct 36 ms 2648 KB Output is correct
47 Correct 38 ms 3172 KB Output is correct
48 Incorrect 43 ms 3192 KB Output isn't correct
49 Correct 31 ms 3152 KB Output is correct
50 Correct 42 ms 2724 KB Output is correct
51 Correct 50 ms 3148 KB Output is correct
52 Incorrect 40 ms 3212 KB Output isn't correct
53 Incorrect 40 ms 3156 KB Output isn't correct
54 Correct 36 ms 2596 KB Output is correct
55 Incorrect 37 ms 3212 KB Output isn't correct
56 Incorrect 38 ms 3208 KB Output isn't correct
57 Incorrect 25 ms 1868 KB Output isn't correct
58 Incorrect 39 ms 3112 KB Output isn't correct
59 Incorrect 40 ms 2848 KB Output isn't correct
60 Correct 43 ms 3228 KB Output is correct
61 Incorrect 34 ms 3216 KB Output isn't correct
62 Correct 33 ms 2468 KB Output is correct
63 Correct 37 ms 3132 KB Output is correct
64 Correct 44 ms 3216 KB Output is correct
65 Correct 38 ms 2636 KB Output is correct
66 Correct 44 ms 3188 KB Output is correct
67 Incorrect 24 ms 1732 KB Output isn't correct
68 Correct 39 ms 2764 KB Output is correct
69 Correct 39 ms 3148 KB Output is correct
70 Correct 43 ms 3220 KB Output is correct
71 Correct 26 ms 3172 KB Output is correct
72 Incorrect 21 ms 1492 KB Output isn't correct
73 Correct 24 ms 1728 KB Output is correct
74 Correct 41 ms 2764 KB Output is correct
75 Correct 38 ms 2716 KB Output is correct
76 Correct 32 ms 2132 KB Output is correct
77 Correct 35 ms 2456 KB Output is correct
78 Correct 37 ms 2476 KB Output is correct
79 Correct 39 ms 2644 KB Output is correct
80 Correct 31 ms 2064 KB Output is correct
81 Correct 37 ms 2532 KB Output is correct
82 Correct 29 ms 2124 KB Output is correct
83 Correct 46 ms 3144 KB Output is correct
84 Correct 45 ms 3128 KB Output is correct
85 Correct 40 ms 3108 KB Output is correct
86 Correct 20 ms 1560 KB Output is correct
87 Incorrect 32 ms 2224 KB Output isn't correct
88 Correct 29 ms 3168 KB Output is correct
89 Correct 34 ms 3156 KB Output is correct
90 Correct 33 ms 2380 KB Output is correct
91 Correct 35 ms 2520 KB Output is correct
92 Incorrect 41 ms 3104 KB Output isn't correct
93 Incorrect 41 ms 2800 KB Output isn't correct
94 Correct 46 ms 3220 KB Output is correct
95 Correct 36 ms 2380 KB Output is correct
96 Correct 40 ms 3096 KB Output is correct
97 Incorrect 47 ms 3164 KB Output isn't correct
98 Incorrect 38 ms 3176 KB Output isn't correct
99 Incorrect 23 ms 3144 KB Output isn't correct
100 Correct 37 ms 2560 KB Output is correct
101 Correct 38 ms 3152 KB Output is correct
102 Correct 46 ms 3184 KB Output is correct