oj.uz

Submission #434881

# Submission time Handle Problem Language Result Execution time Memory
434881 2021-06-22T04:22:36 Z QCFium Art Class (IOI13_artclass) C++14
100 / 100
 69 ms 3272 KB 
#include <bits/stdc++.h>
#include "artclass.h"

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int value1(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
	auto diff = [&] (int i0, int j0, int i1, int j1) {
		return std::abs(r[i0][j0] - r[i1][j1]) + std::abs(g[i0][j0] - g[i1][j1]) + std::abs(b[i0][j0] - b[i1][j1]);
	};
	
	int r0 = 0;
	for (int i = 0; i + 1 < h; i++) {
		for (int j = 0; j < w; j++) {
			int cur_diff = diff(i, j, i + 1, j);
			if (cur_diff > 40) r0 += cur_diff;
		}
	}
	
	int r1 = 0;
	for (int i = 0; i < h; i++) {
		for (int j = 0; j + 1 < w; j++) {
			int cur_diff = diff(i, j, i, j + 1);
			if (cur_diff > 40) r1 += cur_diff;
		}
	}
	
		int r2 = 0;
	for (int i = 0; i + 1 < h; i++) {
		for (int j = 0; j + 1 < w; j++) {
			int cur_diff = diff(i, j, i + 1, j + 1);
			if (cur_diff > 40) r2 += cur_diff;
		}
	}
	
	return std::min({r0, r1, r2}) * 10 / h / w;
}


int value3(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
	auto diff = [&] (int i0, int j0, int i1, int j1) {
		return std::abs(r[i0][j0] - r[i1][j1]) + std::abs(g[i0][j0] - g[i1][j1]) + std::abs(b[i0][j0] - b[i1][j1]);
	};
	const int THRESHOLD = 50;
	
	int r0 = 0;
	for (int i = 0; i + 1 < h; i++) {
		for (int j = 0; j < w; j++) {
			int cur_diff = diff(i, j, i + 1, j);
			if (cur_diff < THRESHOLD) r0 += cur_diff;
		}
	}
	
	int r1 = 0;
	for (int i = 0; i < h; i++) {
		for (int j = 0; j + 1 < w; j++) {
			int cur_diff = diff(i, j, i, j + 1);
			if (cur_diff < THRESHOLD) r1 += cur_diff;
		}
	}
	
		int r2 = 0;
	for (int i = 0; i + 1 < h; i++) {
		for (int j = 0; j + 1 < w; j++) {
			int cur_diff = diff(i, j, i + 1, j + 1);
			if (cur_diff < THRESHOLD) r2 += cur_diff;
		}
	}
	
	return std::min({r0, r1, r2}) * 10 / h / w;
}


int value2(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
	double ra = 0;
	double ga = 0;
	double ba = 0;
	for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) {
		ra += r[i][j];
		ga += g[i][j];
		ba += b[i][j];
	}
	ra /= h * w;
	ga /= h * w;
	ba /= h * w;
	
	double sd = 0;
	for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) {
		double tmp = std::abs(ra - r[i][j]) + std::abs(ga - g[i][j]) + std::abs(ba - b[i][j]);
		sd += tmp * tmp;
	}
	sd /= h * w;
	
	return sd;
}

int style(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
	
	int r1 = value1(h, w, r, g, b);
	int r2 = value2(h, w, r, g, b);
	int r3 = value3(h, w, r, g, b);
	if (r1 <= 15) return 4;
	if (r1 >= 400) return 3;
	/*
	if (r2 <= 33000) return 2;
	else return 1;*/
	if (r3 <= 125) return 1;
	else return 2;
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:103:6: warning: unused variable 'r2' [-Wunused-variable]
  103 |  int r2 = value2(h, w, r, g, b);
      |      ^~
artclass.cpp: In function 'int ri()':
artclass.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 3152 KB Output is correct
2 Correct 44 ms 2208 KB Output is correct
3 Correct 61 ms 3192 KB Output is correct
4 Correct 56 ms 3220 KB Output is correct
5 Incorrect 49 ms 2480 KB Output isn't correct
6 Correct 50 ms 2572 KB Output is correct
7 Correct 55 ms 2624 KB Output is correct
8 Correct 66 ms 3136 KB Output is correct
9 Correct 43 ms 3192 KB Output is correct
10 Correct 50 ms 2572 KB Output is correct
11 Correct 53 ms 2576 KB Output is correct
12 Incorrect 65 ms 3192 KB Output isn't correct
13 Correct 28 ms 1552 KB Output is correct
14 Correct 52 ms 2544 KB Output is correct
15 Correct 39 ms 3160 KB Output is correct
16 Correct 39 ms 3108 KB Output is correct
17 Correct 36 ms 1720 KB Output is correct
18 Correct 53 ms 3148 KB Output is correct
19 Correct 14 ms 844 KB Output is correct
20 Correct 49 ms 3140 KB Output is correct
21 Correct 43 ms 3108 KB Output is correct
22 Correct 49 ms 2368 KB Output is correct
23 Correct 58 ms 3176 KB Output is correct
24 Correct 64 ms 3272 KB Output is correct
25 Correct 33 ms 1712 KB Output is correct
26 Correct 53 ms 2660 KB Output is correct
27 Correct 58 ms 2748 KB Output is correct
28 Correct 65 ms 3204 KB Output is correct
29 Correct 43 ms 2184 KB Output is correct
30 Correct 43 ms 3176 KB Output is correct
31 Correct 69 ms 3140 KB Output is correct
32 Correct 50 ms 3128 KB Output is correct
33 Correct 53 ms 3212 KB Output is correct
34 Correct 57 ms 3092 KB Output is correct
35 Correct 56 ms 2684 KB Output is correct
36 Correct 28 ms 1408 KB Output is correct
37 Correct 53 ms 3140 KB Output is correct
38 Correct 65 ms 3148 KB Output is correct
39 Correct 54 ms 3124 KB Output is correct
40 Correct 63 ms 3256 KB Output is correct
41 Correct 40 ms 3188 KB Output is correct
42 Correct 67 ms 3076 KB Output is correct
43 Correct 51 ms 2440 KB Output is correct
44 Correct 30 ms 1508 KB Output is correct
45 Correct 52 ms 3124 KB Output is correct
46 Incorrect 67 ms 3112 KB Output isn't correct
47 Correct 67 ms 3184 KB Output is correct
48 Correct 50 ms 2496 KB Output is correct
49 Correct 53 ms 3176 KB Output is correct
50 Correct 45 ms 3212 KB Output is correct
51 Correct 38 ms 1660 KB Output is correct
52 Correct 55 ms 3208 KB Output is correct
53 Correct 50 ms 2400 KB Output is correct
54 Correct 37 ms 3184 KB Output is correct
55 Correct 56 ms 3200 KB Output is correct
56 Correct 42 ms 3188 KB Output is correct
57 Correct 68 ms 3208 KB Output is correct
58 Correct 54 ms 2628 KB Output is correct
59 Correct 63 ms 3012 KB Output is correct
60 Correct 59 ms 3140 KB Output is correct
61 Correct 43 ms 3188 KB Output is correct
62 Correct 51 ms 3092 KB Output is correct
63 Correct 57 ms 3140 KB Output is correct
64 Correct 37 ms 1884 KB Output is correct
65 Correct 53 ms 2584 KB Output is correct
66 Correct 41 ms 1960 KB Output is correct
67 Correct 56 ms 3164 KB Output is correct
68 Correct 54 ms 3140 KB Output is correct
69 Correct 66 ms 3172 KB Output is correct
70 Correct 45 ms 3140 KB Output is correct
71 Correct 53 ms 3216 KB Output is correct
72 Correct 52 ms 3264 KB Output is correct
73 Correct 55 ms 2720 KB Output is correct
74 Correct 55 ms 3192 KB Output is correct
75 Correct 55 ms 2672 KB Output is correct
76 Correct 66 ms 3152 KB Output is correct
77 Correct 53 ms 3228 KB Output is correct
78 Incorrect 55 ms 3108 KB Output isn't correct
79 Incorrect 58 ms 2880 KB Output isn't correct
80 Correct 56 ms 3120 KB Output is correct
81 Correct 42 ms 3140 KB Output is correct
82 Correct 51 ms 2556 KB Output is correct
83 Correct 56 ms 2640 KB Output is correct
84 Incorrect 52 ms 2524 KB Output isn't correct
85 Correct 49 ms 2496 KB Output is correct
86 Correct 34 ms 1688 KB Output is correct
87 Correct 17 ms 3172 KB Output is correct
88 Correct 46 ms 3136 KB Output is correct
89 Correct 44 ms 3140 KB Output is correct
90 Correct 56 ms 2792 KB Output is correct
91 Correct 53 ms 2604 KB Output is correct
92 Correct 41 ms 2052 KB Output is correct
93 Correct 66 ms 3192 KB Output is correct
94 Correct 47 ms 3196 KB Output is correct
95 Correct 56 ms 2636 KB Output is correct
96 Incorrect 50 ms 2480 KB Output isn't correct
97 Correct 52 ms 3144 KB Output is correct
98 Correct 53 ms 2600 KB Output is correct
99 Correct 58 ms 3112 KB Output is correct
100 Correct 58 ms 3120 KB Output is correct
101 Correct 42 ms 2092 KB Output is correct
102 Correct 57 ms 2784 KB Output is correct