oj.uz

Submission #586638

# Submission time Handle Problem Language Result Execution time Memory
586638 2022-06-30T13:15:13 Z AlperenT Art Class (IOI13_artclass) C++17
0 / 100
 98 ms 9164 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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 5716 KB Output isn't correct
2 Incorrect 70 ms 7292 KB Output isn't correct
3 Incorrect 44 ms 5732 KB Output isn't correct
4 Incorrect 43 ms 5716 KB Output isn't correct
5 Incorrect 62 ms 9036 KB Output isn't correct
6 Incorrect 80 ms 9004 KB Output isn't correct
7 Incorrect 69 ms 8964 KB Output isn't correct
8 Incorrect 79 ms 9064 KB Output isn't correct
9 Incorrect 69 ms 9036 KB Output isn't correct
10 Incorrect 63 ms 7396 KB Output isn't correct
11 Incorrect 83 ms 9080 KB Output isn't correct
12 Incorrect 73 ms 9088 KB Output isn't correct
13 Incorrect 75 ms 8332 KB Output isn't correct
14 Incorrect 46 ms 9080 KB Output isn't correct
15 Incorrect 77 ms 9084 KB Output isn't correct
16 Incorrect 73 ms 7928 KB Output isn't correct
17 Incorrect 55 ms 9000 KB Output isn't correct
18 Incorrect 86 ms 9044 KB Output isn't correct
19 Incorrect 71 ms 7756 KB Output isn't correct
20 Incorrect 98 ms 9108 KB Output isn't correct
21 Incorrect 90 ms 9040 KB Output isn't correct
22 Incorrect 56 ms 6680 KB Output isn't correct
23 Incorrect 56 ms 9108 KB Output isn't correct
24 Incorrect 67 ms 7628 KB Output isn't correct
25 Incorrect 86 ms 9008 KB Output isn't correct
26 Incorrect 70 ms 9040 KB Output isn't correct
27 Incorrect 67 ms 7576 KB Output isn't correct
28 Incorrect 63 ms 9144 KB Output isn't correct
29 Incorrect 62 ms 7372 KB Output isn't correct
30 Incorrect 70 ms 9008 KB Output isn't correct
31 Incorrect 56 ms 9084 KB Output isn't correct
32 Incorrect 65 ms 7560 KB Output isn't correct
33 Incorrect 76 ms 9084 KB Output isn't correct
34 Incorrect 78 ms 9164 KB Output isn't correct
35 Incorrect 53 ms 9084 KB Output isn't correct
36 Incorrect 80 ms 9036 KB Output isn't correct
37 Incorrect 81 ms 8108 KB Output isn't correct
38 Incorrect 35 ms 5012 KB Output isn't correct
39 Incorrect 69 ms 7756 KB Output isn't correct
40 Incorrect 77 ms 8212 KB Output isn't correct
41 Incorrect 72 ms 8072 KB Output isn't correct
42 Incorrect 84 ms 9084 KB Output isn't correct
43 Incorrect 68 ms 7648 KB Output isn't correct
44 Incorrect 67 ms 9084 KB Output isn't correct
45 Incorrect 57 ms 9044 KB Output isn't correct
46 Incorrect 82 ms 9068 KB Output isn't correct
47 Incorrect 17 ms 3540 KB Output isn't correct
48 Incorrect 67 ms 9036 KB Output isn't correct
49 Incorrect 67 ms 9080 KB Output isn't correct
50 Incorrect 74 ms 9080 KB Output isn't correct
51 Incorrect 54 ms 6616 KB Output isn't correct
52 Incorrect 53 ms 6396 KB Output isn't correct
53 Incorrect 67 ms 7664 KB Output isn't correct
54 Incorrect 75 ms 7840 KB Output isn't correct
55 Incorrect 66 ms 9080 KB Output isn't correct
56 Incorrect 71 ms 9084 KB Output isn't correct
57 Incorrect 48 ms 6048 KB Output isn't correct
58 Incorrect 22 ms 8788 KB Output isn't correct
59 Incorrect 51 ms 9088 KB Output isn't correct
60 Incorrect 73 ms 8120 KB Output isn't correct
61 Incorrect 45 ms 9036 KB Output isn't correct
62 Incorrect 65 ms 7388 KB Output isn't correct
63 Incorrect 51 ms 9084 KB Output isn't correct
64 Incorrect 79 ms 9088 KB Output isn't correct
65 Incorrect 64 ms 7556 KB Output isn't correct
66 Incorrect 53 ms 8984 KB Output isn't correct
67 Incorrect 62 ms 7192 KB Output isn't correct
68 Incorrect 80 ms 9008 KB Output isn't correct
69 Incorrect 90 ms 8936 KB Output isn't correct
70 Incorrect 67 ms 9080 KB Output isn't correct
71 Incorrect 63 ms 7244 KB Output isn't correct
72 Incorrect 58 ms 9040 KB Output isn't correct
73 Incorrect 71 ms 9080 KB Output isn't correct
74 Incorrect 64 ms 7480 KB Output isn't correct
75 Incorrect 70 ms 7816 KB Output isn't correct
76 Incorrect 73 ms 9084 KB Output isn't correct
77 Incorrect 72 ms 9084 KB Output isn't correct
78 Incorrect 83 ms 8992 KB Output isn't correct
79 Incorrect 53 ms 8980 KB Output isn't correct
80 Incorrect 84 ms 9020 KB Output isn't correct
81 Incorrect 83 ms 9032 KB Output isn't correct
82 Incorrect 38 ms 5184 KB Output isn't correct
83 Incorrect 72 ms 9080 KB Output isn't correct
84 Incorrect 83 ms 9020 KB Output isn't correct
85 Incorrect 79 ms 9036 KB Output isn't correct
86 Incorrect 81 ms 9080 KB Output isn't correct
87 Incorrect 60 ms 8988 KB Output isn't correct
88 Incorrect 44 ms 5732 KB Output isn't correct
89 Incorrect 87 ms 8024 KB Output isn't correct
90 Incorrect 69 ms 7888 KB Output isn't correct
91 Incorrect 58 ms 9040 KB Output isn't correct
92 Incorrect 66 ms 7544 KB Output isn't correct
93 Incorrect 74 ms 9068 KB Output isn't correct
94 Incorrect 90 ms 8872 KB Output isn't correct
95 Incorrect 79 ms 8652 KB Output isn't correct
96 Incorrect 68 ms 7764 KB Output isn't correct
97 Incorrect 73 ms 8984 KB Output isn't correct
98 Incorrect 50 ms 6396 KB Output isn't correct
99 Incorrect 34 ms 4948 KB Output isn't correct
100 Incorrect 69 ms 7956 KB Output isn't correct
101 Incorrect 57 ms 6660 KB Output isn't correct
102 Incorrect 67 ms 9016 KB Output isn't correct