oj.uz

Submission #586644

# Submission time Handle Problem Language Result Execution time Memory
586644 2022-06-30T13:31:12 Z AlperenT Art Class (IOI13_artclass) C++17
69 / 100
 102 ms 9236 KB 
#include <bits/stdc++.h>
#include "artclass.h"

using namespace std;

const int N = 500;
const int ISSAME_THRESHOLD = 35;
const int ISGREEN_THRESHOLD = 35;
const bool IS_MAX = true;

const int GREEN = 31;
const int CNTMIN = 11;
const int CNTMAX = 800;

const int K = 8;
const int xd[K] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int yd[K] = {0, 1, 1, 1, 0, -1, -1, -1};

int h, w, greencnt;

array<int, 3> color[N][N];

struct DSU{
	pair<int, int> par[N][N];
	int setsize[N][N];

	int setcnt;

	void reset(int n, int m){
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
				par[i][j] = {i, j};
				setsize[i][j] = 1;
			}
		}

		setcnt = n * m;
	}

	pair<int, int> setfind(pair<int, int> a){
		if(par[a.first][a.second] == a) return a;
		else return par[a.first][a.second] = setfind(par[a.first][a.second]);
	}

	void setunion(pair<int, int> a, pair<int, int> b){
		a = setfind(a), b = setfind(b);

		if(a != b){
			if(setsize[b.first][b.second] > setsize[a.first][a.second]) swap(a, b);

			par[b.first][b.second] = a;
			setsize[a.first][a.second] += setsize[b.first][b.second];

			setcnt--;
		}
	}
};

DSU dsu;

bool issame(array<int, 3> a, array<int, 3> b){
	int diff;

	if(IS_MAX) diff = max({abs(a[0] - b[0]), abs(a[1] - b[1]), abs(a[2] - b[2])});
	else diff = abs(a[0] - b[0]) + abs(a[1] - b[1]) + abs(a[2] - b[2]);

	return diff <= ISSAME_THRESHOLD;
}

bool isgreen(array<int, 3> a){
	// return (a[1] - max(a[0], a[2])) >= ISGREEN_THRESHOLD;

	// return ((a[1] - a[2] >= ISGREEN_THRESHOLD) || (a[2] - a[1] <= ISGREEN_THRESHOLD / 20)) && ((a[1] - a[0] >= ISGREEN_THRESHOLD) || (a[0] - a[1] <= ISGREEN_THRESHOLD));

	return (a[1] - a[2]) >= ISGREEN_THRESHOLD / 1.2 && ((a[1] - a[0] >= ISGREEN_THRESHOLD) || (a[0] - a[1] <= ISGREEN_THRESHOLD));
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]){
	h = H, w = W;

	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			color[i][j] = {R[i][j], G[i][j], B[i][j]};
		}
	}

	dsu.reset(h, w);

	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			for(int k = 0; k < K; k++){
				int x = i + xd[k], y = j + yd[k];

				if(x >= 0 && x < h && y >= 0 && y < w && issame(color[i][j], color[x][y])){
					dsu.setunion({i, j}, {x, y});
				}
			}

			greencnt += isgreen(color[i][j]);
		}
	}

	if(greencnt * 100 / (h * w) >= GREEN) return 2;
	else if(dsu.setcnt <= CNTMIN) return 4;
	else if(dsu.setcnt <= CNTMAX) return 1;
	else return 3;

    return -1;
}

Subtask #1
69.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 7396 KB Output is correct
2 Correct 23 ms 8788 KB Output is correct
3 Incorrect 74 ms 9076 KB Output isn't correct
4 Correct 55 ms 6600 KB Output is correct
5 Correct 71 ms 7756 KB Output is correct
6 Correct 54 ms 6396 KB Output is correct
7 Incorrect 54 ms 5624 KB Output isn't correct
8 Incorrect 72 ms 7760 KB Output isn't correct
9 Correct 47 ms 5004 KB Output is correct
10 Incorrect 56 ms 9080 KB Output isn't correct
11 Correct 80 ms 9012 KB Output is correct
12 Correct 74 ms 8132 KB Output is correct
13 Correct 64 ms 7536 KB Output is correct
14 Incorrect 69 ms 8968 KB Output isn't correct
15 Correct 54 ms 9052 KB Output is correct
16 Correct 44 ms 5716 KB Output is correct
17 Correct 65 ms 7240 KB Output is correct
18 Correct 71 ms 8968 KB Output is correct
19 Correct 70 ms 9088 KB Output is correct
20 Incorrect 81 ms 9080 KB Output isn't correct
21 Correct 71 ms 7896 KB Output is correct
22 Correct 48 ms 5708 KB Output is correct
23 Correct 80 ms 8012 KB Output is correct
24 Correct 102 ms 9056 KB Output is correct
25 Correct 72 ms 9088 KB Output is correct
26 Correct 71 ms 9084 KB Output is correct
27 Incorrect 84 ms 9088 KB Output isn't correct
28 Incorrect 60 ms 9080 KB Output isn't correct
29 Correct 88 ms 9056 KB Output is correct
30 Correct 74 ms 8012 KB Output is correct
31 Correct 85 ms 9016 KB Output is correct
32 Incorrect 71 ms 9088 KB Output isn't correct
33 Correct 71 ms 9000 KB Output is correct
34 Correct 66 ms 9012 KB Output is correct
35 Incorrect 86 ms 9008 KB Output isn't correct
36 Correct 86 ms 8928 KB Output is correct
37 Correct 42 ms 8972 KB Output is correct
38 Correct 66 ms 9064 KB Output is correct
39 Correct 77 ms 9236 KB Output is correct
40 Correct 70 ms 9080 KB Output is correct
41 Correct 76 ms 9080 KB Output is correct
42 Correct 55 ms 6612 KB Output is correct
43 Correct 68 ms 9084 KB Output is correct
44 Incorrect 47 ms 6092 KB Output isn't correct
45 Correct 72 ms 7716 KB Output is correct
46 Correct 48 ms 5756 KB Output is correct
47 Incorrect 73 ms 8280 KB Output isn't correct
48 Correct 72 ms 7956 KB Output is correct
49 Correct 66 ms 7508 KB Output is correct
50 Correct 87 ms 9000 KB Output is correct
51 Correct 77 ms 9164 KB Output is correct
52 Incorrect 55 ms 9152 KB Output isn't correct
53 Correct 70 ms 7456 KB Output is correct
54 Correct 35 ms 5008 KB Output is correct
55 Correct 57 ms 9172 KB Output is correct
56 Correct 65 ms 7684 KB Output is correct
57 Incorrect 77 ms 6772 KB Output isn't correct
58 Correct 62 ms 9040 KB Output is correct
59 Incorrect 82 ms 9084 KB Output isn't correct
60 Correct 50 ms 9080 KB Output is correct
61 Incorrect 74 ms 9064 KB Output isn't correct
62 Incorrect 85 ms 8964 KB Output isn't correct
63 Incorrect 74 ms 9016 KB Output isn't correct
64 Correct 54 ms 6388 KB Output is correct
65 Correct 78 ms 9120 KB Output is correct
66 Correct 84 ms 9016 KB Output is correct
67 Correct 75 ms 9032 KB Output is correct
68 Correct 68 ms 7436 KB Output is correct
69 Incorrect 69 ms 7360 KB Output isn't correct
70 Correct 70 ms 9084 KB Output is correct
71 Correct 87 ms 9036 KB Output is correct
72 Correct 68 ms 9040 KB Output is correct
73 Correct 66 ms 9044 KB Output is correct
74 Correct 71 ms 9084 KB Output is correct
75 Correct 89 ms 9084 KB Output is correct
76 Correct 68 ms 7284 KB Output is correct
77 Correct 91 ms 9044 KB Output is correct
78 Correct 63 ms 9208 KB Output is correct
79 Correct 82 ms 9080 KB Output is correct
80 Correct 69 ms 9084 KB Output is correct
81 Correct 54 ms 9028 KB Output is correct
82 Correct 77 ms 9080 KB Output is correct
83 Correct 78 ms 8040 KB Output is correct
84 Correct 77 ms 7844 KB Output is correct
85 Incorrect 79 ms 9000 KB Output isn't correct
86 Correct 78 ms 7268 KB Output is correct
87 Incorrect 70 ms 8996 KB Output isn't correct
88 Correct 55 ms 9072 KB Output is correct
89 Correct 73 ms 7772 KB Output is correct
90 Incorrect 76 ms 7536 KB Output isn't correct
91 Correct 22 ms 3532 KB Output is correct
92 Correct 66 ms 7552 KB Output is correct
93 Correct 94 ms 9036 KB Output is correct
94 Correct 72 ms 9012 KB Output is correct
95 Correct 39 ms 5064 KB Output is correct
96 Correct 73 ms 7808 KB Output is correct
97 Incorrect 55 ms 9028 KB Output isn't correct
98 Correct 78 ms 8652 KB Output is correct
99 Correct 71 ms 7884 KB Output is correct
100 Correct 75 ms 7812 KB Output is correct
101 Correct 60 ms 9080 KB Output is correct
102 Incorrect 78 ms 8268 KB Output isn't correct