oj.uz

Submission #434879

# Submission time Handle Problem Language Result Execution time Memory
434879 2021-06-22T04:17:31 Z QCFium Art Class (IOI13_artclass) C++14
91 / 100
 122 ms 6176 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 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);
	
	if (r1 <= 15) return 4;
	if (r1 >= 400) return 3;
	if (r2 <= 33000) return 2;
	return 1;
}

Compilation message

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
91.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 4732 KB Output is correct
2 Correct 35 ms 3108 KB Output is correct
3 Correct 37 ms 4600 KB Output is correct
4 Correct 50 ms 4264 KB Output is correct
5 Correct 53 ms 4628 KB Output is correct
6 Correct 42 ms 4748 KB Output is correct
7 Correct 56 ms 4908 KB Output is correct
8 Correct 63 ms 5884 KB Output is correct
9 Incorrect 58 ms 5272 KB Output isn't correct
10 Correct 55 ms 4876 KB Output is correct
11 Correct 64 ms 5852 KB Output is correct
12 Correct 58 ms 5332 KB Output is correct
13 Correct 48 ms 4668 KB Output is correct
14 Correct 88 ms 5816 KB Output is correct
15 Correct 55 ms 5068 KB Output is correct
16 Correct 41 ms 4532 KB Output is correct
17 Incorrect 50 ms 4272 KB Output isn't correct
18 Correct 56 ms 5384 KB Output is correct
19 Correct 56 ms 4548 KB Output is correct
20 Correct 53 ms 4948 KB Output is correct
21 Correct 44 ms 4008 KB Output is correct
22 Correct 54 ms 5104 KB Output is correct
23 Correct 46 ms 5060 KB Output is correct
24 Correct 48 ms 4280 KB Output is correct
25 Incorrect 58 ms 4808 KB Output isn't correct
26 Correct 49 ms 4460 KB Output is correct
27 Incorrect 53 ms 5036 KB Output isn't correct
28 Incorrect 63 ms 5996 KB Output isn't correct
29 Correct 56 ms 5492 KB Output is correct
30 Correct 47 ms 5064 KB Output is correct
31 Incorrect 67 ms 5844 KB Output isn't correct
32 Correct 46 ms 4872 KB Output is correct
33 Correct 14 ms 1356 KB Output is correct
34 Incorrect 51 ms 4232 KB Output isn't correct
35 Correct 30 ms 2428 KB Output is correct
36 Correct 62 ms 5864 KB Output is correct
37 Correct 34 ms 2980 KB Output is correct
38 Correct 17 ms 3660 KB Output is correct
39 Incorrect 56 ms 5188 KB Output isn't correct
40 Correct 122 ms 5708 KB Output is correct
41 Correct 65 ms 6176 KB Output is correct
42 Correct 58 ms 5736 KB Output is correct
43 Correct 59 ms 5700 KB Output is correct
44 Correct 53 ms 4676 KB Output is correct
45 Correct 67 ms 5472 KB Output is correct
46 Correct 55 ms 5188 KB Output is correct
47 Correct 53 ms 5276 KB Output is correct
48 Correct 72 ms 5628 KB Output is correct
49 Incorrect 60 ms 5744 KB Output isn't correct
50 Correct 43 ms 3696 KB Output is correct
51 Correct 57 ms 5196 KB Output is correct
52 Correct 61 ms 5740 KB Output is correct
53 Correct 42 ms 4660 KB Output is correct
54 Correct 50 ms 4392 KB Output is correct
55 Correct 54 ms 4548 KB Output is correct
56 Correct 53 ms 5348 KB Output is correct
57 Correct 43 ms 3784 KB Output is correct
58 Correct 57 ms 4256 KB Output is correct
59 Correct 48 ms 4164 KB Output is correct
60 Correct 54 ms 4820 KB Output is correct
61 Correct 34 ms 3048 KB Output is correct
62 Correct 47 ms 4404 KB Output is correct
63 Correct 52 ms 4532 KB Output is correct
64 Correct 56 ms 5188 KB Output is correct
65 Correct 52 ms 4548 KB Output is correct
66 Correct 66 ms 5896 KB Output is correct
67 Correct 50 ms 5316 KB Output is correct
68 Incorrect 53 ms 5260 KB Output isn't correct
69 Correct 28 ms 2332 KB Output is correct
70 Correct 55 ms 5468 KB Output is correct
71 Correct 47 ms 3044 KB Output is correct
72 Correct 42 ms 2628 KB Output is correct
73 Correct 41 ms 4916 KB Output is correct
74 Correct 63 ms 5316 KB Output is correct
75 Correct 36 ms 3272 KB Output is correct
76 Correct 42 ms 3652 KB Output is correct
77 Correct 41 ms 4876 KB Output is correct
78 Correct 56 ms 4564 KB Output is correct
79 Correct 72 ms 5192 KB Output is correct
80 Correct 50 ms 5240 KB Output is correct
81 Correct 33 ms 4360 KB Output is correct
82 Correct 46 ms 5096 KB Output is correct
83 Correct 56 ms 4932 KB Output is correct
84 Correct 52 ms 4336 KB Output is correct
85 Incorrect 51 ms 4384 KB Output isn't correct
86 Correct 66 ms 5368 KB Output is correct
87 Correct 54 ms 4868 KB Output is correct
88 Correct 53 ms 5444 KB Output is correct
89 Correct 51 ms 5316 KB Output is correct
90 Correct 54 ms 5176 KB Output is correct
91 Correct 58 ms 4676 KB Output is correct
92 Incorrect 64 ms 5848 KB Output isn't correct
93 Correct 54 ms 4712 KB Output is correct
94 Correct 42 ms 3524 KB Output is correct
95 Correct 54 ms 5212 KB Output is correct
96 Correct 55 ms 4700 KB Output is correct
97 Correct 62 ms 5188 KB Output is correct
98 Incorrect 66 ms 5832 KB Output isn't correct
99 Incorrect 62 ms 5952 KB Output isn't correct
100 Correct 50 ms 4420 KB Output is correct
101 Correct 56 ms 5284 KB Output is correct
102 Correct 45 ms 4976 KB Output is correct