oj.uz

Submission #754215

# Submission time Handle Problem Language Result Execution time Memory
754215 2023-06-07T09:05:37 Z marvinthang Art Class (IOI13_artclass) C++17
100 / 100
 55 ms 3324 KB 
/*************************************
*    author: marvinthang             *
*    created: 06.06.2023 21:33:35    *
*************************************/

#include "artclass.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

inline char gc() { // like getchar()
    static char buf[1 << 16];
    static size_t bc, be;
    if (bc >= be) {
        buf[0] = 0, bc = 0;
        be = fread(buf, 1, sizeof(buf), stdin);
    }
    return buf[bc++]; // returns 0 on EOF
}

int readInt() {
    int a, c;
    while ((a = gc()) < 40);
    if (a == '-') return -readInt();
    while ((c = gc()) >= 48) a = a * 10 + c - 480;
    return a - 48;
}

// end of template

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    int sum1 = 0, sum2 = 0;
    auto diff = [&] (int x, int y, int u, int v) {
        return abs(R[x][y] - R[u][v]) + abs(G[x][y] - G[u][v]) + abs(B[x][y] - B[u][v]);
    };
    int sum_r = 0, sum_g = 0, sum_b = 0;
    int adj_r = 0, adj_g = 0, adj_b = 0;
    REP(i, H) REP(j, W) {
        sum_r += R[i][j];
        sum_g += G[i][j];
        sum_b += B[i][j];
        if (j + 1 < W) {
            sum1 += diff(i, j, i, j + 1);
            adj_r += abs(R[i][j] - R[i][j + 1]);
            adj_g += abs(G[i][j] - G[i][j + 1]);
            adj_b += abs(B[i][j] - B[i][j + 1]);
        }
        if (i + 1 < H) {
            sum2 += diff(i, j, i + 1, j);
            adj_r += abs(R[i][j] - R[i + 1][j]);
            adj_g += abs(G[i][j] - G[i + 1][j]);
            adj_b += abs(B[i][j] - B[i + 1][j]);
        }
    }
    sum_r /= H * W;
    sum_g /= H * W;
    sum_b /= H * W;
    adj_r /= H * W;
    adj_g /= H * W;
    adj_b /= H * W;
    sum1 /= H * (W - 1);
    sum2 /= (H - 1) * W;
    if (sum1 < 9 && min({adj_r, adj_g, adj_b}) <= 6) return 4;
    if (sum1 >= 54 && max({adj_r, adj_g, adj_b}) >= 36) return 3;
    if (max({sum_r, sum_g, sum_b}) >= 131) return 1;
    return 2;
}

#ifdef LOCAL
#include <stdio.h>
#include "artclass.h"

static int H, W;
static int R[500][500];
static int G[500][500];
static int B[500][500];

int main() {
    freopen("artclass.out", "w", stdout);
    FOR(t, 1, 5) {
        FOR(i, 1, 10) {
            freopen(("style-" + to_string(t) + "-" + to_string(i) + ".txt").c_str(), "r", stdin);
            H = readInt(); W = readInt();
            REP(i, H) REP(j, W) {
                R[i][j] = readInt();
                G[i][j] = readInt();
                B[i][j] = readInt();
            }
            int x = style(H, W, R, G, B);
            if (x != t) cerr << t << ' ' << i << ": " << x << '\n';
        }
        cout << '\n' << string(20, '=') << '\n';
    }
    return 0;
}
#endif

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2612 KB Output is correct
2 Correct 36 ms 2108 KB Output is correct
3 Correct 48 ms 3116 KB Output is correct
4 Correct 40 ms 3120 KB Output is correct
5 Correct 44 ms 2524 KB Output is correct
6 Incorrect 42 ms 3160 KB Output isn't correct
7 Correct 42 ms 3100 KB Output is correct
8 Correct 28 ms 1872 KB Output is correct
9 Correct 29 ms 1740 KB Output is correct
10 Correct 44 ms 2636 KB Output is correct
11 Correct 40 ms 3132 KB Output is correct
12 Correct 42 ms 2576 KB Output is correct
13 Correct 34 ms 2088 KB Output is correct
14 Correct 21 ms 1472 KB Output is correct
15 Correct 43 ms 3276 KB Output is correct
16 Correct 33 ms 3196 KB Output is correct
17 Correct 42 ms 3200 KB Output is correct
18 Correct 42 ms 3216 KB Output is correct
19 Correct 25 ms 3144 KB Output is correct
20 Correct 45 ms 2676 KB Output is correct
21 Incorrect 47 ms 2640 KB Output isn't correct
22 Correct 44 ms 3148 KB Output is correct
23 Correct 42 ms 2636 KB Output is correct
24 Correct 45 ms 3324 KB Output is correct
25 Incorrect 41 ms 2388 KB Output isn't correct
26 Correct 42 ms 2740 KB Output is correct
27 Correct 43 ms 2796 KB Output is correct
28 Correct 42 ms 2720 KB Output is correct
29 Correct 44 ms 3180 KB Output is correct
30 Correct 39 ms 2572 KB Output is correct
31 Correct 42 ms 3168 KB Output is correct
32 Correct 53 ms 3204 KB Output is correct
33 Correct 47 ms 3112 KB Output is correct
34 Correct 45 ms 3116 KB Output is correct
35 Incorrect 44 ms 3108 KB Output isn't correct
36 Correct 42 ms 2416 KB Output is correct
37 Correct 42 ms 3164 KB Output is correct
38 Correct 44 ms 3176 KB Output is correct
39 Correct 55 ms 3204 KB Output is correct
40 Correct 37 ms 3208 KB Output is correct
41 Correct 35 ms 3204 KB Output is correct
42 Correct 44 ms 2724 KB Output is correct
43 Correct 33 ms 3192 KB Output is correct
44 Correct 51 ms 3104 KB Output is correct
45 Correct 11 ms 828 KB Output is correct
46 Correct 43 ms 3152 KB Output is correct
47 Correct 41 ms 2448 KB Output is correct
48 Correct 53 ms 3168 KB Output is correct
49 Correct 43 ms 2636 KB Output is correct
50 Incorrect 27 ms 1724 KB Output isn't correct
51 Correct 51 ms 3180 KB Output is correct
52 Correct 51 ms 3144 KB Output is correct
53 Incorrect 36 ms 3112 KB Output isn't correct
54 Incorrect 13 ms 3156 KB Output isn't correct
55 Correct 39 ms 2508 KB Output is correct
56 Incorrect 39 ms 2516 KB Output isn't correct
57 Correct 34 ms 2132 KB Output is correct
58 Correct 42 ms 2656 KB Output is correct
59 Correct 52 ms 3152 KB Output is correct
60 Correct 45 ms 2832 KB Output is correct
61 Correct 44 ms 3148 KB Output is correct
62 Correct 35 ms 2020 KB Output is correct
63 Correct 43 ms 2636 KB Output is correct
64 Correct 42 ms 3156 KB Output is correct
65 Correct 43 ms 3196 KB Output is correct
66 Correct 53 ms 3128 KB Output is correct
67 Correct 52 ms 3208 KB Output is correct
68 Correct 44 ms 3156 KB Output is correct
69 Correct 44 ms 2772 KB Output is correct
70 Correct 53 ms 3152 KB Output is correct
71 Correct 49 ms 3204 KB Output is correct
72 Correct 43 ms 3216 KB Output is correct
73 Correct 42 ms 2544 KB Output is correct
74 Correct 46 ms 3172 KB Output is correct
75 Correct 50 ms 3156 KB Output is correct
76 Correct 43 ms 3148 KB Output is correct
77 Correct 27 ms 1764 KB Output is correct
78 Correct 36 ms 3140 KB Output is correct
79 Correct 51 ms 2992 KB Output is correct
80 Correct 50 ms 3220 KB Output is correct
81 Correct 29 ms 1844 KB Output is correct
82 Correct 44 ms 2720 KB Output is correct
83 Correct 36 ms 3148 KB Output is correct
84 Correct 43 ms 2552 KB Output is correct
85 Correct 41 ms 3148 KB Output is correct
86 Correct 37 ms 3196 KB Output is correct
87 Correct 33 ms 3176 KB Output is correct
88 Correct 32 ms 3148 KB Output is correct
89 Correct 42 ms 2604 KB Output is correct
90 Correct 38 ms 2472 KB Output is correct
91 Correct 39 ms 3100 KB Output is correct
92 Correct 33 ms 3148 KB Output is correct
93 Correct 23 ms 1560 KB Output is correct
94 Correct 34 ms 2124 KB Output is correct
95 Correct 32 ms 3164 KB Output is correct
96 Correct 51 ms 3132 KB Output is correct
97 Correct 50 ms 3128 KB Output is correct
98 Correct 33 ms 3180 KB Output is correct
99 Correct 55 ms 3120 KB Output is correct
100 Correct 43 ms 3148 KB Output is correct
101 Correct 21 ms 1392 KB Output is correct
102 Correct 37 ms 2432 KB Output is correct