oj.uz

Submission #754211

# Submission time Handle Problem Language Result Execution time Memory
754211 2023-06-07T08:54:39 Z marvinthang Art Class (IOI13_artclass) C++17
96 / 100
 77 ms 4404 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 <= 8 && sum2 <= 9 && min({adj_r, adj_g, adj_b}) <= 6) return 4;
    if (sum1 + sum2 >= 100 && max({adj_r, adj_g, adj_b}) >= 36) return 3;
    if (max({sum_r, sum_g, sum_b}) >= 135) 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
96.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 3872 KB Output is correct
2 Correct 56 ms 4400 KB Output is correct
3 Correct 42 ms 3672 KB Output is correct
4 Incorrect 31 ms 2932 KB Output isn't correct
5 Incorrect 43 ms 3660 KB Output isn't correct
6 Correct 44 ms 3612 KB Output is correct
7 Correct 44 ms 4360 KB Output is correct
8 Correct 49 ms 3936 KB Output is correct
9 Correct 49 ms 3804 KB Output is correct
10 Correct 47 ms 4044 KB Output is correct
11 Incorrect 30 ms 3024 KB Output isn't correct
12 Correct 43 ms 3404 KB Output is correct
13 Correct 48 ms 3864 KB Output is correct
14 Correct 45 ms 3784 KB Output is correct
15 Correct 30 ms 2840 KB Output is correct
16 Correct 49 ms 4292 KB Output is correct
17 Correct 57 ms 4348 KB Output is correct
18 Correct 40 ms 4280 KB Output is correct
19 Correct 58 ms 4300 KB Output is correct
20 Incorrect 48 ms 3808 KB Output isn't correct
21 Correct 45 ms 3808 KB Output is correct
22 Correct 54 ms 4336 KB Output is correct
23 Correct 45 ms 4260 KB Output is correct
24 Correct 53 ms 4388 KB Output is correct
25 Correct 51 ms 4028 KB Output is correct
26 Incorrect 56 ms 4348 KB Output isn't correct
27 Correct 44 ms 4092 KB Output is correct
28 Incorrect 14 ms 3652 KB Output isn't correct
29 Correct 48 ms 3772 KB Output is correct
30 Correct 24 ms 2376 KB Output is correct
31 Correct 46 ms 3640 KB Output is correct
32 Correct 49 ms 4340 KB Output is correct
33 Correct 38 ms 4296 KB Output is correct
34 Incorrect 53 ms 4320 KB Output isn't correct
35 Incorrect 45 ms 4372 KB Output isn't correct
36 Correct 36 ms 4300 KB Output is correct
37 Correct 52 ms 3728 KB Output is correct
38 Correct 57 ms 4320 KB Output is correct
39 Correct 29 ms 2836 KB Output is correct
40 Correct 47 ms 4300 KB Output is correct
41 Correct 37 ms 3216 KB Output is correct
42 Correct 66 ms 4376 KB Output is correct
43 Correct 49 ms 4372 KB Output is correct
44 Correct 52 ms 4396 KB Output is correct
45 Correct 32 ms 4308 KB Output is correct
46 Correct 42 ms 3492 KB Output is correct
47 Correct 36 ms 4324 KB Output is correct
48 Correct 62 ms 4216 KB Output is correct
49 Correct 48 ms 4300 KB Output is correct
50 Correct 47 ms 4308 KB Output is correct
51 Correct 49 ms 4384 KB Output is correct
52 Correct 53 ms 4268 KB Output is correct
53 Correct 26 ms 4300 KB Output is correct
54 Correct 39 ms 3528 KB Output is correct
55 Correct 41 ms 3340 KB Output is correct
56 Correct 39 ms 4384 KB Output is correct
57 Correct 39 ms 4304 KB Output is correct
58 Correct 57 ms 4404 KB Output is correct
59 Correct 50 ms 4252 KB Output is correct
60 Correct 45 ms 3868 KB Output is correct
61 Correct 45 ms 4380 KB Output is correct
62 Correct 54 ms 4300 KB Output is correct
63 Correct 56 ms 4300 KB Output is correct
64 Correct 59 ms 4300 KB Output is correct
65 Incorrect 46 ms 3676 KB Output isn't correct
66 Correct 29 ms 2748 KB Output is correct
67 Correct 37 ms 4300 KB Output is correct
68 Correct 47 ms 4248 KB Output is correct
69 Correct 46 ms 4288 KB Output is correct
70 Incorrect 55 ms 4072 KB Output isn't correct
71 Correct 34 ms 3276 KB Output is correct
72 Correct 35 ms 4300 KB Output is correct
73 Correct 36 ms 4352 KB Output is correct
74 Correct 45 ms 4300 KB Output is correct
75 Correct 12 ms 1408 KB Output is correct
76 Correct 46 ms 3696 KB Output is correct
77 Correct 24 ms 2356 KB Output is correct
78 Correct 45 ms 4312 KB Output is correct
79 Correct 49 ms 4324 KB Output is correct
80 Correct 36 ms 3280 KB Output is correct
81 Correct 48 ms 3788 KB Output is correct
82 Correct 58 ms 3708 KB Output is correct
83 Incorrect 56 ms 4300 KB Output isn't correct
84 Correct 53 ms 4364 KB Output is correct
85 Correct 32 ms 4344 KB Output is correct
86 Correct 47 ms 3240 KB Output is correct
87 Correct 49 ms 4300 KB Output is correct
88 Correct 77 ms 4296 KB Output is correct
89 Correct 44 ms 3672 KB Output is correct
90 Correct 45 ms 4260 KB Output is correct
91 Correct 35 ms 4256 KB Output is correct
92 Correct 33 ms 4296 KB Output is correct
93 Correct 40 ms 3584 KB Output is correct
94 Correct 58 ms 4336 KB Output is correct
95 Correct 45 ms 3748 KB Output is correct
96 Correct 35 ms 4292 KB Output is correct
97 Correct 38 ms 3148 KB Output is correct
98 Correct 47 ms 3428 KB Output is correct
99 Correct 53 ms 3920 KB Output is correct
100 Incorrect 47 ms 3692 KB Output isn't correct
101 Correct 47 ms 4320 KB Output is correct
102 Correct 25 ms 2556 KB Output is correct