oj.uz

Submission #554115

# Submission time Handle Problem Language Result Execution time Memory
554115 2022-04-27T16:51:07 Z elazarkoren Art Class (IOI13_artclass) C++17
27 / 100
 51 ms 3252 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.7;
    }
};

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 37 ms 3176 KB Output isn't correct
2 Incorrect 42 ms 2800 KB Output isn't correct
3 Correct 35 ms 2508 KB Output is correct
4 Correct 37 ms 2492 KB Output is correct
5 Incorrect 47 ms 3124 KB Output isn't correct
6 Correct 37 ms 2640 KB Output is correct
7 Correct 35 ms 2508 KB Output is correct
8 Correct 40 ms 2636 KB Output is correct
9 Incorrect 37 ms 3180 KB Output isn't correct
10 Correct 27 ms 3116 KB Output is correct
11 Incorrect 47 ms 3176 KB Output isn't correct
12 Incorrect 40 ms 3152 KB Output isn't correct
13 Incorrect 43 ms 3128 KB Output isn't correct
14 Correct 35 ms 2584 KB Output is correct
15 Incorrect 30 ms 3252 KB Output isn't correct
16 Correct 13 ms 3132 KB Output is correct
17 Correct 34 ms 2328 KB Output is correct
18 Incorrect 36 ms 2472 KB Output isn't correct
19 Correct 42 ms 2764 KB Output is correct
20 Incorrect 41 ms 2764 KB Output isn't correct
21 Correct 37 ms 3200 KB Output is correct
22 Incorrect 38 ms 3148 KB Output isn't correct
23 Correct 40 ms 2792 KB Output is correct
24 Correct 31 ms 3204 KB Output is correct
25 Correct 40 ms 3100 KB Output is correct
26 Correct 27 ms 1736 KB Output is correct
27 Incorrect 38 ms 3220 KB Output isn't correct
28 Correct 39 ms 2668 KB Output is correct
29 Incorrect 40 ms 2592 KB Output isn't correct
30 Correct 48 ms 3176 KB Output is correct
31 Incorrect 20 ms 1492 KB Output isn't correct
32 Correct 40 ms 3224 KB Output is correct
33 Correct 40 ms 2732 KB Output is correct
34 Correct 40 ms 3156 KB Output is correct
35 Correct 36 ms 2516 KB Output is correct
36 Incorrect 38 ms 3140 KB Output isn't correct
37 Incorrect 31 ms 3172 KB Output isn't correct
38 Correct 38 ms 2640 KB Output is correct
39 Incorrect 34 ms 2208 KB Output isn't correct
40 Correct 39 ms 2620 KB Output is correct
41 Incorrect 40 ms 3148 KB Output isn't correct
42 Incorrect 47 ms 3116 KB Output isn't correct
43 Correct 26 ms 3156 KB Output is correct
44 Incorrect 19 ms 1492 KB Output isn't correct
45 Incorrect 38 ms 2696 KB Output isn't correct
46 Correct 50 ms 3172 KB Output is correct
47 Incorrect 39 ms 3112 KB Output isn't correct
48 Incorrect 35 ms 3128 KB Output isn't correct
49 Incorrect 29 ms 3132 KB Output isn't correct
50 Correct 46 ms 3208 KB Output is correct
51 Incorrect 37 ms 3196 KB Output isn't correct
52 Correct 38 ms 3148 KB Output is correct
53 Incorrect 41 ms 3152 KB Output isn't correct
54 Correct 30 ms 2124 KB Output is correct
55 Incorrect 47 ms 3128 KB Output isn't correct
56 Incorrect 41 ms 3120 KB Output isn't correct
57 Incorrect 32 ms 3196 KB Output isn't correct
58 Incorrect 51 ms 3116 KB Output isn't correct
59 Correct 51 ms 3100 KB Output is correct
60 Correct 46 ms 3208 KB Output is correct
61 Correct 37 ms 2516 KB Output is correct
62 Correct 29 ms 3204 KB Output is correct
63 Incorrect 42 ms 3148 KB Output isn't correct
64 Correct 32 ms 3168 KB Output is correct
65 Correct 10 ms 852 KB Output is correct
66 Incorrect 32 ms 3148 KB Output isn't correct
67 Correct 31 ms 3188 KB Output is correct
68 Incorrect 22 ms 3212 KB Output isn't correct
69 Incorrect 26 ms 1748 KB Output isn't correct
70 Correct 21 ms 1544 KB Output is correct
71 Correct 48 ms 3148 KB Output is correct
72 Correct 38 ms 2540 KB Output is correct
73 Incorrect 27 ms 1720 KB Output isn't correct
74 Correct 49 ms 3220 KB Output is correct
75 Correct 38 ms 2520 KB Output is correct
76 Incorrect 38 ms 3140 KB Output isn't correct
77 Correct 34 ms 2352 KB Output is correct
78 Correct 38 ms 3148 KB Output is correct
79 Correct 30 ms 2132 KB Output is correct
80 Correct 44 ms 3180 KB Output is correct
81 Incorrect 39 ms 3164 KB Output isn't correct
82 Incorrect 26 ms 1892 KB Output isn't correct
83 Correct 26 ms 1748 KB Output is correct
84 Incorrect 33 ms 3172 KB Output isn't correct
85 Incorrect 44 ms 2992 KB Output isn't correct
86 Correct 46 ms 3220 KB Output is correct
87 Correct 41 ms 3148 KB Output is correct
88 Correct 30 ms 2064 KB Output is correct
89 Correct 32 ms 3156 KB Output is correct
90 Correct 41 ms 3208 KB Output is correct
91 Correct 39 ms 2636 KB Output is correct
92 Correct 47 ms 3200 KB Output is correct
93 Correct 36 ms 2568 KB Output is correct
94 Correct 40 ms 3176 KB Output is correct
95 Incorrect 28 ms 3156 KB Output isn't correct
96 Correct 38 ms 2636 KB Output is correct
97 Correct 43 ms 3108 KB Output is correct
98 Correct 47 ms 3132 KB Output is correct
99 Incorrect 38 ms 3188 KB Output isn't correct
100 Incorrect 41 ms 2728 KB Output isn't correct
101 Correct 32 ms 2112 KB Output is correct
102 Correct 38 ms 2544 KB Output is correct