oj.uz

Submission #754072

# Submission time Handle Problem Language Result Execution time Memory
754072 2023-06-06T15:38:17 Z marvinthang Art Class (IOI13_artclass) C++17
98 / 100
 108 ms 6260 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]);
    };
    REP(i, H) REP(j, W) {
        if (j + 1 < W) sum1 += diff(i, j, i, j + 1);
        if (i + 1 < H) sum2 += diff(i, j, i + 1, j);
    }
    sum1 /= H * (W - 1);
    sum2 /= (H - 1) * W;
    // if (sum1 < 9) return 4;
    // if (sum1 + sum2 >= 110) return 3;
    // cout << sum1 + sum2 << ' ';
    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) return 4;
    if (sum1 + sum2 >= 100 && f >= 70000) 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) > 20) continue;
                visited[u][v] = true;
                q.emplace(u, v);
            }
        }
    }
    f = cnt * 1000000LL / H / W;
    if (f >= 120000) return 2;
    return 1;
}

#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
98.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 4944 KB Output is correct
2 Correct 66 ms 5140 KB Output is correct
3 Correct 58 ms 4852 KB Output is correct
4 Correct 37 ms 3384 KB Output is correct
5 Correct 53 ms 4284 KB Output is correct
6 Correct 13 ms 3728 KB Output is correct
7 Correct 39 ms 3108 KB Output is correct
8 Correct 83 ms 6048 KB Output is correct
9 Correct 49 ms 5432 KB Output is correct
10 Correct 54 ms 5352 KB Output is correct
11 Correct 63 ms 4364 KB Output is correct
12 Correct 50 ms 5692 KB Output is correct
13 Correct 72 ms 5964 KB Output is correct
14 Correct 64 ms 5280 KB Output is correct
15 Correct 62 ms 4940 KB Output is correct
16 Correct 60 ms 5324 KB Output is correct
17 Correct 53 ms 4888 KB Output is correct
18 Incorrect 108 ms 5944 KB Output isn't correct
19 Correct 41 ms 2476 KB Output is correct
20 Correct 68 ms 6260 KB Output is correct
21 Correct 51 ms 4644 KB Output is correct
22 Incorrect 47 ms 4328 KB Output isn't correct
23 Correct 47 ms 5088 KB Output is correct
24 Correct 40 ms 3824 KB Output is correct
25 Correct 46 ms 5172 KB Output is correct
26 Correct 48 ms 5720 KB Output is correct
27 Correct 69 ms 5988 KB Output is correct
28 Correct 53 ms 4676 KB Output is correct
29 Correct 67 ms 5552 KB Output is correct
30 Correct 58 ms 6188 KB Output is correct
31 Correct 68 ms 5012 KB Output is correct
32 Correct 48 ms 5196 KB Output is correct
33 Correct 60 ms 4252 KB Output is correct
34 Correct 39 ms 5084 KB Output is correct
35 Correct 32 ms 4684 KB Output is correct
36 Correct 38 ms 3148 KB Output is correct
37 Correct 56 ms 5068 KB Output is correct
38 Correct 60 ms 5304 KB Output is correct
39 Correct 36 ms 3172 KB Output is correct
40 Correct 50 ms 5392 KB Output is correct
41 Correct 64 ms 5748 KB Output is correct
42 Correct 65 ms 5368 KB Output is correct
43 Correct 41 ms 4936 KB Output is correct
44 Correct 48 ms 4824 KB Output is correct
45 Correct 67 ms 6028 KB Output is correct
46 Correct 43 ms 4444 KB Output is correct
47 Correct 63 ms 5852 KB Output is correct
48 Correct 48 ms 4664 KB Output is correct
49 Correct 46 ms 5228 KB Output is correct
50 Correct 61 ms 4776 KB Output is correct
51 Correct 49 ms 5068 KB Output is correct
52 Incorrect 80 ms 6032 KB Output isn't correct
53 Correct 59 ms 5288 KB Output is correct
54 Incorrect 64 ms 5224 KB Output isn't correct
55 Correct 28 ms 2636 KB Output is correct
56 Correct 62 ms 6008 KB Output is correct
57 Correct 34 ms 4640 KB Output is correct
58 Correct 61 ms 4852 KB Output is correct
59 Incorrect 53 ms 5324 KB Output isn't correct
60 Correct 62 ms 5716 KB Output is correct
61 Correct 62 ms 5936 KB Output is correct
62 Correct 42 ms 4848 KB Output is correct
63 Correct 61 ms 4428 KB Output is correct
64 Incorrect 54 ms 4284 KB Output isn't correct
65 Correct 50 ms 5396 KB Output is correct
66 Incorrect 55 ms 5468 KB Output isn't correct
67 Correct 36 ms 4920 KB Output is correct
68 Correct 63 ms 4948 KB Output is correct
69 Correct 44 ms 5068 KB Output is correct
70 Incorrect 46 ms 5016 KB Output isn't correct
71 Incorrect 54 ms 5328 KB Output isn't correct
72 Correct 60 ms 5744 KB Output is correct
73 Correct 50 ms 4428 KB Output is correct
74 Correct 34 ms 4720 KB Output is correct
75 Correct 84 ms 5644 KB Output is correct
76 Correct 58 ms 4516 KB Output is correct
77 Correct 57 ms 5444 KB Output is correct
78 Correct 65 ms 4784 KB Output is correct
79 Correct 40 ms 3004 KB Output is correct
80 Correct 42 ms 3676 KB Output is correct
81 Incorrect 61 ms 5484 KB Output isn't correct
82 Correct 55 ms 4616 KB Output is correct
83 Correct 38 ms 4848 KB Output is correct
84 Correct 27 ms 4372 KB Output is correct
85 Correct 57 ms 4456 KB Output is correct
86 Correct 51 ms 4332 KB Output is correct
87 Correct 58 ms 4364 KB Output is correct
88 Correct 48 ms 5464 KB Output is correct
89 Correct 62 ms 5352 KB Output is correct
90 Correct 60 ms 4824 KB Output is correct
91 Correct 16 ms 1420 KB Output is correct
92 Correct 58 ms 5432 KB Output is correct
93 Correct 57 ms 4924 KB Output is correct
94 Correct 41 ms 3692 KB Output is correct
95 Correct 65 ms 5932 KB Output is correct
96 Correct 49 ms 3884 KB Output is correct
97 Correct 30 ms 2380 KB Output is correct
98 Incorrect 63 ms 5484 KB Output isn't correct
99 Correct 67 ms 4712 KB Output is correct
100 Correct 59 ms 5408 KB Output is correct
101 Correct 46 ms 4048 KB Output is correct
102 Correct 52 ms 5356 KB Output is correct