oj.uz

Submission #586647

# Submission time Handle Problem Language Result Execution time Memory
586647 2022-06-30T13:39:17 Z AlperenT Art Class (IOI13_artclass) C++17
54 / 100
 103 ms 9164 KB 
#include <bits/stdc++.h>
#include "artclass.h"
 
using namespace std;
 
const int N = 500;
const int ISSAME_THRESHOLD = 45;
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
54.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 7560 KB Output is correct
2 Incorrect 76 ms 9092 KB Output isn't correct
3 Correct 71 ms 7908 KB Output is correct
4 Incorrect 69 ms 7496 KB Output isn't correct
5 Correct 67 ms 9084 KB Output is correct
6 Incorrect 45 ms 5672 KB Output isn't correct
7 Incorrect 47 ms 9052 KB Output isn't correct
8 Incorrect 82 ms 9080 KB Output isn't correct
9 Incorrect 59 ms 6608 KB Output isn't correct
10 Correct 73 ms 8980 KB Output is correct
11 Incorrect 74 ms 9036 KB Output isn't correct
12 Correct 65 ms 7532 KB Output is correct
13 Correct 68 ms 9080 KB Output is correct
14 Correct 81 ms 8996 KB Output is correct
15 Correct 50 ms 9084 KB Output is correct
16 Correct 73 ms 7924 KB Output is correct
17 Correct 76 ms 8120 KB Output is correct
18 Incorrect 81 ms 8992 KB Output isn't correct
19 Correct 64 ms 7416 KB Output is correct
20 Incorrect 69 ms 9024 KB Output isn't correct
21 Correct 65 ms 7512 KB Output is correct
22 Correct 76 ms 9084 KB Output is correct
23 Correct 77 ms 8712 KB Output is correct
24 Incorrect 72 ms 6492 KB Output isn't correct
25 Correct 53 ms 9080 KB Output is correct
26 Incorrect 62 ms 6696 KB Output isn't correct
27 Correct 69 ms 7724 KB Output is correct
28 Incorrect 21 ms 3656 KB Output isn't correct
29 Correct 74 ms 8180 KB Output is correct
30 Correct 57 ms 4940 KB Output is correct
31 Correct 37 ms 5012 KB Output is correct
32 Incorrect 72 ms 7384 KB Output isn't correct
33 Correct 87 ms 9008 KB Output is correct
34 Correct 67 ms 9068 KB Output is correct
35 Incorrect 81 ms 8964 KB Output isn't correct
36 Correct 53 ms 9080 KB Output is correct
37 Incorrect 81 ms 7760 KB Output isn't correct
38 Correct 70 ms 9084 KB Output is correct
39 Correct 68 ms 9036 KB Output is correct
40 Correct 70 ms 7876 KB Output is correct
41 Correct 46 ms 5268 KB Output is correct
42 Correct 73 ms 9088 KB Output is correct
43 Incorrect 73 ms 9076 KB Output isn't correct
44 Correct 66 ms 7396 KB Output is correct
45 Correct 76 ms 7244 KB Output is correct
46 Correct 74 ms 8980 KB Output is correct
47 Correct 71 ms 7968 KB Output is correct
48 Correct 57 ms 6392 KB Output is correct
49 Incorrect 87 ms 7900 KB Output isn't correct
50 Correct 64 ms 7420 KB Output is correct
51 Correct 62 ms 9020 KB Output is correct
52 Incorrect 54 ms 9080 KB Output isn't correct
53 Incorrect 58 ms 9080 KB Output isn't correct
54 Correct 68 ms 9080 KB Output is correct
55 Correct 47 ms 5752 KB Output is correct
56 Correct 54 ms 6604 KB Output is correct
57 Incorrect 85 ms 9016 KB Output isn't correct
58 Correct 42 ms 9084 KB Output is correct
59 Correct 71 ms 9080 KB Output is correct
60 Correct 84 ms 9044 KB Output is correct
61 Correct 77 ms 9084 KB Output is correct
62 Correct 71 ms 9108 KB Output is correct
63 Correct 70 ms 9164 KB Output is correct
64 Correct 92 ms 9076 KB Output is correct
65 Incorrect 66 ms 8980 KB Output isn't correct
66 Correct 74 ms 7924 KB Output is correct
67 Correct 86 ms 9084 KB Output is correct
68 Correct 65 ms 7496 KB Output is correct
69 Correct 75 ms 8012 KB Output is correct
70 Incorrect 77 ms 9000 KB Output isn't correct
71 Correct 75 ms 9084 KB Output is correct
72 Incorrect 54 ms 9088 KB Output isn't correct
73 Correct 103 ms 9112 KB Output is correct
74 Correct 71 ms 7748 KB Output is correct
75 Correct 70 ms 7624 KB Output is correct
76 Incorrect 80 ms 7168 KB Output isn't correct
77 Incorrect 84 ms 9088 KB Output isn't correct
78 Correct 66 ms 9036 KB Output is correct
79 Correct 69 ms 9052 KB Output is correct
80 Correct 54 ms 8980 KB Output is correct
81 Correct 54 ms 5792 KB Output is correct
82 Correct 57 ms 9080 KB Output is correct
83 Correct 22 ms 8788 KB Output is correct
84 Correct 68 ms 8992 KB Output is correct
85 Incorrect 75 ms 8268 KB Output isn't correct
86 Correct 69 ms 7888 KB Output is correct
87 Correct 76 ms 8100 KB Output is correct
88 Correct 74 ms 9088 KB Output is correct
89 Correct 73 ms 9012 KB Output is correct
90 Incorrect 76 ms 9036 KB Output isn't correct
91 Correct 76 ms 9052 KB Output is correct
92 Correct 66 ms 7676 KB Output is correct
93 Incorrect 46 ms 5972 KB Output isn't correct
94 Correct 79 ms 9024 KB Output is correct
95 Correct 52 ms 5708 KB Output is correct
96 Incorrect 83 ms 9088 KB Output isn't correct
97 Incorrect 84 ms 8936 KB Output isn't correct
98 Incorrect 76 ms 8972 KB Output isn't correct
99 Correct 77 ms 8996 KB Output is correct
100 Correct 60 ms 9008 KB Output is correct
101 Correct 67 ms 9032 KB Output is correct
102 Correct 62 ms 9036 KB Output is correct