oj.uz

Submission #754206

# Submission time Handle Problem Language Result Execution time Memory
754206 2023-06-07T08:44:12 Z marvinthang Art Class (IOI13_artclass) C++17
0 / 100
 87 ms 6112 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;
    cout << sum_g << ' ';
    sum1 /= H * (W - 1);
    sum2 /= (H - 1) * W;
    vector <vector <bool>> visited(H, vector<bool>(W));
    int cnt = 0;
    REP(x, H) REP(y, W) if (!visited[x][y]) {
        ++cnt;
        queue <pair <int, int>> q;
        q.emplace(x, y);
        visited[x][y] = true;
        while (!q.empty()) {
            auto [x, y] = q.front(); q.pop();
            REP(d, 4) {
                int u = x + dx[d], v = y + dy[d];
                if (u < 0 || u >= H || v < 0 || v >= W || visited[u][v] || diff(x, y, u, v) > 60) continue;
                visited[u][v] = true;
                q.emplace(u, v);
            }
        }
    }
    long long f = cnt * 1000000LL / H / W;
    if (sum1 <= 10 && sum2 <= 10 && f <= 100 && min({adj_r, adj_g, adj_b}) <= 6) return 4;
    if (sum1 + sum2 >= 100 && f >= 70000 && max({adj_r, adj_g, adj_b}) >= 36) return 3;
    cnt = 0;
    visited = vector <vector<bool>>(H, vector<bool>(W));
    REP(x, H) REP(y, W) if (!visited[x][y]) {
        ++cnt;
        queue <pair <int, int>> q;
        q.emplace(x, y);
        visited[x][y] = true;
        while (!q.empty()) {
            auto [x, y] = q.front(); q.pop();
            REP(d, 4) {
                int u = x + dx[d], v = y + dy[d];
                if (u < 0 || u >= H || v < 0 || v >= W || visited[u][v] || diff(x, y, u, v) > 10) continue;
                visited[u][v] = true;
                q.emplace(u, v);
            }
        }
    }
    f = cnt * 1000000LL / H / W;
    if (f < 400000 && 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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 4444 KB Output isn't correct
2 Incorrect 69 ms 5188 KB Output isn't correct
3 Incorrect 52 ms 5708 KB Output isn't correct
4 Incorrect 55 ms 5396 KB Output isn't correct
5 Incorrect 48 ms 4396 KB Output isn't correct
6 Incorrect 47 ms 5192 KB Output isn't correct
7 Incorrect 65 ms 6048 KB Output isn't correct
8 Incorrect 63 ms 5296 KB Output isn't correct
9 Incorrect 60 ms 5116 KB Output isn't correct
10 Incorrect 44 ms 4812 KB Output isn't correct
11 Incorrect 73 ms 6088 KB Output isn't correct
12 Incorrect 62 ms 5384 KB Output isn't correct
13 Incorrect 65 ms 4812 KB Output isn't correct
14 Incorrect 71 ms 5300 KB Output isn't correct
15 Incorrect 86 ms 6000 KB Output isn't correct
16 Incorrect 63 ms 4920 KB Output isn't correct
17 Incorrect 61 ms 5432 KB Output isn't correct
18 Incorrect 72 ms 5440 KB Output isn't correct
19 Incorrect 50 ms 5196 KB Output isn't correct
20 Incorrect 48 ms 5728 KB Output isn't correct
21 Incorrect 33 ms 4668 KB Output isn't correct
22 Incorrect 55 ms 4508 KB Output isn't correct
23 Incorrect 67 ms 4500 KB Output isn't correct
24 Incorrect 27 ms 2392 KB Output isn't correct
25 Incorrect 82 ms 5928 KB Output isn't correct
26 Incorrect 57 ms 5328 KB Output isn't correct
27 Incorrect 72 ms 6028 KB Output isn't correct
28 Incorrect 68 ms 4348 KB Output isn't correct
29 Incorrect 40 ms 4796 KB Output isn't correct
30 Incorrect 62 ms 4400 KB Output isn't correct
31 Incorrect 41 ms 3628 KB Output isn't correct
32 Incorrect 45 ms 5160 KB Output isn't correct
33 Incorrect 55 ms 5388 KB Output isn't correct
34 Incorrect 56 ms 4260 KB Output isn't correct
35 Incorrect 49 ms 3864 KB Output isn't correct
36 Incorrect 45 ms 4424 KB Output isn't correct
37 Incorrect 37 ms 4680 KB Output isn't correct
38 Incorrect 57 ms 6112 KB Output isn't correct
39 Incorrect 44 ms 3788 KB Output isn't correct
40 Incorrect 66 ms 5908 KB Output isn't correct
41 Incorrect 71 ms 4820 KB Output isn't correct
42 Incorrect 38 ms 3152 KB Output isn't correct
43 Incorrect 72 ms 4780 KB Output isn't correct
44 Incorrect 51 ms 5484 KB Output isn't correct
45 Incorrect 68 ms 5956 KB Output isn't correct
46 Incorrect 62 ms 4408 KB Output isn't correct
47 Incorrect 49 ms 4044 KB Output isn't correct
48 Incorrect 59 ms 4908 KB Output isn't correct
49 Incorrect 78 ms 5972 KB Output isn't correct
50 Incorrect 56 ms 4428 KB Output isn't correct
51 Incorrect 42 ms 4932 KB Output isn't correct
52 Incorrect 70 ms 6020 KB Output isn't correct
53 Incorrect 48 ms 5452 KB Output isn't correct
54 Incorrect 54 ms 5068 KB Output isn't correct
55 Incorrect 77 ms 5548 KB Output isn't correct
56 Incorrect 21 ms 1348 KB Output isn't correct
57 Incorrect 49 ms 5324 KB Output isn't correct
58 Incorrect 16 ms 3688 KB Output isn't correct
59 Incorrect 60 ms 4724 KB Output isn't correct
60 Incorrect 67 ms 6048 KB Output isn't correct
61 Incorrect 54 ms 5324 KB Output isn't correct
62 Incorrect 59 ms 5260 KB Output isn't correct
63 Incorrect 27 ms 2364 KB Output isn't correct
64 Incorrect 47 ms 5040 KB Output isn't correct
65 Incorrect 61 ms 4960 KB Output isn't correct
66 Incorrect 69 ms 4972 KB Output isn't correct
67 Incorrect 51 ms 5308 KB Output isn't correct
68 Incorrect 45 ms 5132 KB Output isn't correct
69 Incorrect 36 ms 3380 KB Output isn't correct
70 Incorrect 64 ms 4816 KB Output isn't correct
71 Incorrect 45 ms 3824 KB Output isn't correct
72 Incorrect 46 ms 4928 KB Output isn't correct
73 Incorrect 56 ms 5432 KB Output isn't correct
74 Incorrect 34 ms 3064 KB Output isn't correct
75 Incorrect 54 ms 5348 KB Output isn't correct
76 Incorrect 49 ms 5080 KB Output isn't correct
77 Incorrect 84 ms 5768 KB Output isn't correct
78 Incorrect 69 ms 6048 KB Output isn't correct
79 Incorrect 53 ms 5464 KB Output isn't correct
80 Incorrect 57 ms 4700 KB Output isn't correct
81 Incorrect 34 ms 2644 KB Output isn't correct
82 Incorrect 40 ms 4392 KB Output isn't correct
83 Incorrect 44 ms 4684 KB Output isn't correct
84 Incorrect 55 ms 4584 KB Output isn't correct
85 Incorrect 74 ms 4276 KB Output isn't correct
86 Incorrect 49 ms 4836 KB Output isn't correct
87 Incorrect 41 ms 3148 KB Output isn't correct
88 Incorrect 39 ms 5024 KB Output isn't correct
89 Incorrect 78 ms 5952 KB Output isn't correct
90 Incorrect 62 ms 5464 KB Output isn't correct
91 Incorrect 87 ms 5816 KB Output isn't correct
92 Incorrect 77 ms 4980 KB Output isn't correct
93 Incorrect 34 ms 3020 KB Output isn't correct
94 Incorrect 53 ms 4796 KB Output isn't correct
95 Incorrect 46 ms 5336 KB Output isn't correct
96 Incorrect 75 ms 5452 KB Output isn't correct
97 Incorrect 52 ms 5248 KB Output isn't correct
98 Incorrect 55 ms 5248 KB Output isn't correct
99 Incorrect 48 ms 4404 KB Output isn't correct
100 Incorrect 62 ms 4680 KB Output isn't correct
101 Incorrect 55 ms 4668 KB Output isn't correct
102 Incorrect 56 ms 5396 KB Output isn't correct