oj.uz

Submission #586640

# Submission time Handle Problem Language Result Execution time Memory
586640 2022-06-30T13:20:33 Z AlperenT Art Class (IOI13_artclass) C++17
76 / 100
 101 ms 9204 KB 
#include <bits/stdc++.h>
#include "artclass.h"

using namespace std;

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

const int GREEN = 31;
const int CNTMIN = 13;
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[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]);
		}
	}

	// cout << "Color Count: " << dsu.setcnt << " " << "Green Count: " << greencnt << " " << "Green Percent: " << greencnt * 100 / (h * w)  <<"\n";

	// cout << dsu.setcnt << "\n";

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

# Verdict Execution time Memory Grader output
1 Correct 75 ms 8092 KB Output is correct
2 Incorrect 53 ms 9048 KB Output isn't correct
3 Correct 72 ms 9004 KB Output is correct
4 Incorrect 46 ms 5964 KB Output isn't correct
5 Correct 72 ms 7916 KB Output is correct
6 Correct 79 ms 9084 KB Output is correct
7 Correct 91 ms 7868 KB Output is correct
8 Incorrect 85 ms 8964 KB Output isn't correct
9 Correct 64 ms 9132 KB Output is correct
10 Correct 43 ms 8996 KB Output is correct
11 Correct 66 ms 7684 KB Output is correct
12 Correct 61 ms 9040 KB Output is correct
13 Correct 68 ms 9048 KB Output is correct
14 Correct 69 ms 9036 KB Output is correct
15 Correct 82 ms 9020 KB Output is correct
16 Correct 72 ms 9004 KB Output is correct
17 Correct 62 ms 9060 KB Output is correct
18 Incorrect 84 ms 9028 KB Output isn't correct
19 Correct 54 ms 9088 KB Output is correct
20 Correct 55 ms 6384 KB Output is correct
21 Incorrect 67 ms 9024 KB Output isn't correct
22 Correct 34 ms 4960 KB Output is correct
23 Correct 66 ms 9060 KB Output is correct
24 Correct 54 ms 6572 KB Output is correct
25 Correct 82 ms 9040 KB Output is correct
26 Incorrect 62 ms 7384 KB Output isn't correct
27 Correct 71 ms 6692 KB Output is correct
28 Incorrect 57 ms 9080 KB Output isn't correct
29 Correct 69 ms 9004 KB Output is correct
30 Incorrect 76 ms 8264 KB Output isn't correct
31 Correct 75 ms 9080 KB Output is correct
32 Incorrect 101 ms 9172 KB Output isn't correct
33 Correct 82 ms 9080 KB Output is correct
34 Correct 73 ms 7908 KB Output is correct
35 Correct 86 ms 9048 KB Output is correct
36 Correct 42 ms 5728 KB Output is correct
37 Incorrect 80 ms 9024 KB Output isn't correct
38 Correct 55 ms 9084 KB Output is correct
39 Incorrect 56 ms 6684 KB Output isn't correct
40 Correct 71 ms 9064 KB Output is correct
41 Correct 71 ms 8040 KB Output is correct
42 Correct 68 ms 7740 KB Output is correct
43 Correct 70 ms 7420 KB Output is correct
44 Correct 81 ms 9084 KB Output is correct
45 Correct 68 ms 7636 KB Output is correct
46 Incorrect 78 ms 9088 KB Output isn't correct
47 Correct 83 ms 9084 KB Output is correct
48 Correct 77 ms 9088 KB Output is correct
49 Correct 65 ms 7356 KB Output is correct
50 Correct 86 ms 7956 KB Output is correct
51 Correct 72 ms 9088 KB Output is correct
52 Correct 67 ms 7496 KB Output is correct
53 Correct 72 ms 8124 KB Output is correct
54 Correct 35 ms 4948 KB Output is correct
55 Correct 71 ms 9052 KB Output is correct
56 Correct 73 ms 9088 KB Output is correct
57 Incorrect 87 ms 9068 KB Output isn't correct
58 Correct 59 ms 9044 KB Output is correct
59 Correct 82 ms 9000 KB Output is correct
60 Correct 60 ms 6324 KB Output is correct
61 Correct 38 ms 5184 KB Output is correct
62 Correct 51 ms 9044 KB Output is correct
63 Correct 62 ms 7144 KB Output is correct
64 Correct 48 ms 9084 KB Output is correct
65 Correct 69 ms 8976 KB Output is correct
66 Correct 90 ms 9032 KB Output is correct
67 Correct 66 ms 9084 KB Output is correct
68 Correct 86 ms 9080 KB Output is correct
69 Correct 70 ms 7928 KB Output is correct
70 Incorrect 48 ms 5724 KB Output isn't correct
71 Correct 22 ms 8788 KB Output is correct
72 Incorrect 77 ms 9080 KB Output isn't correct
73 Correct 65 ms 7764 KB Output is correct
74 Correct 73 ms 7768 KB Output is correct
75 Correct 68 ms 7580 KB Output is correct
76 Correct 45 ms 5720 KB Output is correct
77 Incorrect 66 ms 7504 KB Output isn't correct
78 Correct 76 ms 9088 KB Output is correct
79 Correct 80 ms 8668 KB Output is correct
80 Incorrect 54 ms 8992 KB Output isn't correct
81 Incorrect 85 ms 9080 KB Output isn't correct
82 Correct 66 ms 7372 KB Output is correct
83 Correct 68 ms 9004 KB Output is correct
84 Correct 64 ms 7408 KB Output is correct
85 Correct 58 ms 8972 KB Output is correct
86 Correct 43 ms 5760 KB Output is correct
87 Correct 24 ms 3656 KB Output is correct
88 Correct 68 ms 9080 KB Output is correct
89 Correct 54 ms 8992 KB Output is correct
90 Correct 82 ms 9084 KB Output is correct
91 Correct 72 ms 7848 KB Output is correct
92 Incorrect 71 ms 7764 KB Output isn't correct
93 Correct 82 ms 9036 KB Output is correct
94 Correct 68 ms 7756 KB Output is correct
95 Correct 72 ms 9036 KB Output is correct
96 Correct 74 ms 9128 KB Output is correct
97 Correct 67 ms 9040 KB Output is correct
98 Correct 65 ms 7272 KB Output is correct
99 Correct 84 ms 9204 KB Output is correct
100 Incorrect 69 ms 9092 KB Output isn't correct
101 Incorrect 77 ms 8284 KB Output isn't correct
102 Correct 51 ms 9084 KB Output is correct