/*************************************
* 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) > 10) continue;
visited[u][v] = true;
q.emplace(u, v);
}
}
}
f = cnt * 1000000LL / H / W;
if (f >= 350000) 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
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
54 ms |
3148 KB |
Output is correct |
2 |
Correct |
66 ms |
3072 KB |
Output is correct |
3 |
Correct |
61 ms |
2732 KB |
Output is correct |
4 |
Correct |
63 ms |
2960 KB |
Output is correct |
5 |
Correct |
38 ms |
3532 KB |
Output is correct |
6 |
Correct |
45 ms |
3420 KB |
Output is correct |
7 |
Correct |
51 ms |
3568 KB |
Output is correct |
8 |
Correct |
45 ms |
3448 KB |
Output is correct |
9 |
Correct |
59 ms |
2996 KB |
Output is correct |
10 |
Correct |
81 ms |
3056 KB |
Output is correct |
11 |
Correct |
28 ms |
1740 KB |
Output is correct |
12 |
Correct |
67 ms |
3532 KB |
Output is correct |
13 |
Correct |
64 ms |
3112 KB |
Output is correct |
14 |
Correct |
59 ms |
3580 KB |
Output is correct |
15 |
Correct |
59 ms |
3544 KB |
Output is correct |
16 |
Correct |
57 ms |
2356 KB |
Output is correct |
17 |
Correct |
63 ms |
3552 KB |
Output is correct |
18 |
Correct |
61 ms |
2764 KB |
Output is correct |
19 |
Correct |
63 ms |
3468 KB |
Output is correct |
20 |
Correct |
62 ms |
2748 KB |
Output is correct |
21 |
Correct |
75 ms |
3476 KB |
Output is correct |
22 |
Correct |
59 ms |
2996 KB |
Output is correct |
23 |
Correct |
39 ms |
3468 KB |
Output is correct |
24 |
Correct |
39 ms |
3404 KB |
Output is correct |
25 |
Correct |
50 ms |
2796 KB |
Output is correct |
26 |
Correct |
15 ms |
3532 KB |
Output is correct |
27 |
Correct |
57 ms |
3504 KB |
Output is correct |
28 |
Correct |
36 ms |
1996 KB |
Output is correct |
29 |
Correct |
31 ms |
1748 KB |
Output is correct |
30 |
Correct |
69 ms |
3512 KB |
Output is correct |
31 |
Correct |
39 ms |
2348 KB |
Output is correct |
32 |
Correct |
40 ms |
2404 KB |
Output is correct |
33 |
Correct |
27 ms |
1732 KB |
Output is correct |
34 |
Correct |
63 ms |
3540 KB |
Output is correct |
35 |
Correct |
34 ms |
1992 KB |
Output is correct |
36 |
Correct |
37 ms |
3532 KB |
Output is correct |
37 |
Incorrect |
54 ms |
3444 KB |
Output isn't correct |
38 |
Correct |
65 ms |
3556 KB |
Output is correct |
39 |
Correct |
46 ms |
3524 KB |
Output is correct |
40 |
Correct |
57 ms |
3580 KB |
Output is correct |
41 |
Correct |
48 ms |
2632 KB |
Output is correct |
42 |
Correct |
46 ms |
3348 KB |
Output is correct |
43 |
Correct |
38 ms |
2040 KB |
Output is correct |
44 |
Correct |
45 ms |
3544 KB |
Output is correct |
45 |
Incorrect |
58 ms |
3348 KB |
Output isn't correct |
46 |
Correct |
52 ms |
3424 KB |
Output is correct |
47 |
Correct |
14 ms |
1104 KB |
Output is correct |
48 |
Correct |
49 ms |
2936 KB |
Output is correct |
49 |
Incorrect |
40 ms |
3516 KB |
Output isn't correct |
50 |
Correct |
50 ms |
3524 KB |
Output is correct |
51 |
Incorrect |
57 ms |
3516 KB |
Output isn't correct |
52 |
Correct |
45 ms |
3524 KB |
Output is correct |
53 |
Correct |
63 ms |
3256 KB |
Output is correct |
54 |
Correct |
47 ms |
3516 KB |
Output is correct |
55 |
Incorrect |
51 ms |
3544 KB |
Output isn't correct |
56 |
Correct |
32 ms |
1996 KB |
Output is correct |
57 |
Correct |
44 ms |
2492 KB |
Output is correct |
58 |
Correct |
47 ms |
3492 KB |
Output is correct |
59 |
Correct |
59 ms |
3044 KB |
Output is correct |
60 |
Correct |
59 ms |
3532 KB |
Output is correct |
61 |
Correct |
58 ms |
3488 KB |
Output is correct |
62 |
Incorrect |
48 ms |
2704 KB |
Output isn't correct |
63 |
Correct |
53 ms |
3424 KB |
Output is correct |
64 |
Correct |
45 ms |
3516 KB |
Output is correct |
65 |
Correct |
81 ms |
3536 KB |
Output is correct |
66 |
Correct |
65 ms |
3120 KB |
Output is correct |
67 |
Correct |
63 ms |
3536 KB |
Output is correct |
68 |
Correct |
50 ms |
3516 KB |
Output is correct |
69 |
Correct |
62 ms |
3428 KB |
Output is correct |
70 |
Correct |
52 ms |
3556 KB |
Output is correct |
71 |
Correct |
46 ms |
3528 KB |
Output is correct |
72 |
Correct |
54 ms |
3020 KB |
Output is correct |
73 |
Correct |
40 ms |
3544 KB |
Output is correct |
74 |
Correct |
39 ms |
3520 KB |
Output is correct |
75 |
Correct |
43 ms |
2384 KB |
Output is correct |
76 |
Incorrect |
52 ms |
2800 KB |
Output isn't correct |
77 |
Correct |
32 ms |
3504 KB |
Output is correct |
78 |
Correct |
56 ms |
3044 KB |
Output is correct |
79 |
Correct |
57 ms |
3560 KB |
Output is correct |
80 |
Incorrect |
71 ms |
3592 KB |
Output isn't correct |
81 |
Correct |
69 ms |
2768 KB |
Output is correct |
82 |
Correct |
40 ms |
2172 KB |
Output is correct |
83 |
Correct |
57 ms |
2860 KB |
Output is correct |
84 |
Correct |
57 ms |
2896 KB |
Output is correct |
85 |
Correct |
52 ms |
2956 KB |
Output is correct |
86 |
Incorrect |
43 ms |
3572 KB |
Output isn't correct |
87 |
Correct |
63 ms |
3576 KB |
Output is correct |
88 |
Correct |
49 ms |
3276 KB |
Output is correct |
89 |
Correct |
60 ms |
3536 KB |
Output is correct |
90 |
Correct |
58 ms |
2956 KB |
Output is correct |
91 |
Correct |
52 ms |
2892 KB |
Output is correct |
92 |
Correct |
53 ms |
3468 KB |
Output is correct |
93 |
Correct |
31 ms |
3432 KB |
Output is correct |
94 |
Correct |
38 ms |
3532 KB |
Output is correct |
95 |
Correct |
34 ms |
3532 KB |
Output is correct |
96 |
Correct |
70 ms |
3512 KB |
Output is correct |
97 |
Correct |
43 ms |
2884 KB |
Output is correct |
98 |
Incorrect |
74 ms |
3544 KB |
Output isn't correct |
99 |
Correct |
40 ms |
3468 KB |
Output is correct |
100 |
Correct |
64 ms |
3600 KB |
Output is correct |
101 |
Correct |
31 ms |
3444 KB |
Output is correct |
102 |
Incorrect |
72 ms |
3528 KB |
Output isn't correct |