oj.uz

Submission #586630

# Submission time Handle Problem Language Result Execution time Memory
586630 2022-06-30T13:10:01 Z AlperenT Art Class (IOI13_artclass) C++17
65 / 100
 100 ms 9192 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 = 25;
const int CNTMIN = 10;
const int CNTMAX = 500;

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

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 6776 KB Output isn't correct
2 Correct 52 ms 9044 KB Output is correct
3 Correct 57 ms 6560 KB Output is correct
4 Correct 85 ms 8984 KB Output is correct
5 Correct 81 ms 8712 KB Output is correct
6 Correct 71 ms 7888 KB Output is correct
7 Correct 50 ms 9064 KB Output is correct
8 Incorrect 67 ms 7560 KB Output isn't correct
9 Correct 51 ms 9024 KB Output is correct
10 Correct 71 ms 9088 KB Output is correct
11 Correct 66 ms 7560 KB Output is correct
12 Incorrect 47 ms 5932 KB Output isn't correct
13 Correct 61 ms 9044 KB Output is correct
14 Correct 75 ms 8064 KB Output is correct
15 Correct 83 ms 9080 KB Output is correct
16 Correct 63 ms 9036 KB Output is correct
17 Incorrect 84 ms 9084 KB Output isn't correct
18 Incorrect 74 ms 9080 KB Output isn't correct
19 Correct 82 ms 8992 KB Output is correct
20 Correct 74 ms 9080 KB Output is correct
21 Correct 62 ms 7132 KB Output is correct
22 Correct 35 ms 5032 KB Output is correct
23 Correct 68 ms 9036 KB Output is correct
24 Correct 53 ms 9084 KB Output is correct
25 Correct 66 ms 7512 KB Output is correct
26 Correct 71 ms 8968 KB Output is correct
27 Correct 60 ms 9000 KB Output is correct
28 Correct 83 ms 9068 KB Output is correct
29 Correct 73 ms 7704 KB Output is correct
30 Correct 19 ms 3568 KB Output is correct
31 Incorrect 78 ms 9092 KB Output isn't correct
32 Correct 69 ms 9080 KB Output is correct
33 Incorrect 54 ms 9088 KB Output isn't correct
34 Correct 47 ms 5716 KB Output is correct
35 Correct 84 ms 8984 KB Output is correct
36 Correct 87 ms 9064 KB Output is correct
37 Incorrect 48 ms 5076 KB Output isn't correct
38 Incorrect 76 ms 8268 KB Output isn't correct
39 Correct 76 ms 8116 KB Output is correct
40 Correct 43 ms 5676 KB Output is correct
41 Incorrect 57 ms 9008 KB Output isn't correct
42 Correct 68 ms 9080 KB Output is correct
43 Incorrect 71 ms 7380 KB Output isn't correct
44 Incorrect 73 ms 7764 KB Output isn't correct
45 Correct 76 ms 8100 KB Output is correct
46 Correct 60 ms 9088 KB Output is correct
47 Incorrect 96 ms 9084 KB Output isn't correct
48 Correct 55 ms 9052 KB Output is correct
49 Correct 66 ms 7356 KB Output is correct
50 Incorrect 70 ms 9084 KB Output isn't correct
51 Incorrect 56 ms 9080 KB Output isn't correct
52 Incorrect 52 ms 6304 KB Output isn't correct
53 Incorrect 84 ms 8964 KB Output isn't correct
54 Correct 70 ms 9088 KB Output is correct
55 Correct 83 ms 9096 KB Output is correct
56 Correct 58 ms 6496 KB Output is correct
57 Correct 69 ms 7320 KB Output is correct
58 Incorrect 100 ms 9036 KB Output isn't correct
59 Correct 71 ms 9084 KB Output is correct
60 Correct 71 ms 8996 KB Output is correct
61 Correct 62 ms 8988 KB Output is correct
62 Correct 68 ms 9088 KB Output is correct
63 Correct 73 ms 9064 KB Output is correct
64 Correct 45 ms 5004 KB Output is correct
65 Incorrect 85 ms 9052 KB Output isn't correct
66 Correct 67 ms 7636 KB Output is correct
67 Correct 43 ms 9008 KB Output is correct
68 Correct 72 ms 7960 KB Output is correct
69 Correct 67 ms 7520 KB Output is correct
70 Correct 68 ms 8992 KB Output is correct
71 Incorrect 73 ms 9084 KB Output isn't correct
72 Correct 84 ms 9012 KB Output is correct
73 Correct 68 ms 9028 KB Output is correct
74 Correct 80 ms 8992 KB Output is correct
75 Correct 45 ms 5708 KB Output is correct
76 Correct 86 ms 9080 KB Output is correct
77 Correct 73 ms 9060 KB Output is correct
78 Correct 66 ms 7764 KB Output is correct
79 Correct 72 ms 9084 KB Output is correct
80 Correct 69 ms 7452 KB Output is correct
81 Incorrect 45 ms 5712 KB Output isn't correct
82 Correct 69 ms 7664 KB Output is correct
83 Incorrect 55 ms 9084 KB Output isn't correct
84 Correct 23 ms 8980 KB Output is correct
85 Correct 72 ms 7896 KB Output is correct
86 Correct 87 ms 9084 KB Output is correct
87 Correct 65 ms 7432 KB Output is correct
88 Correct 84 ms 8996 KB Output is correct
89 Correct 70 ms 9192 KB Output is correct
90 Incorrect 74 ms 8268 KB Output isn't correct
91 Correct 63 ms 7280 KB Output is correct
92 Correct 73 ms 9004 KB Output is correct
93 Incorrect 81 ms 9036 KB Output isn't correct
94 Correct 71 ms 8004 KB Output is correct
95 Correct 72 ms 7924 KB Output is correct
96 Correct 55 ms 9088 KB Output is correct
97 Incorrect 68 ms 9084 KB Output isn't correct
98 Correct 73 ms 9084 KB Output is correct
99 Incorrect 69 ms 9044 KB Output isn't correct
100 Correct 68 ms 7720 KB Output is correct
101 Correct 60 ms 6668 KB Output is correct
102 Correct 72 ms 7920 KB Output is correct