oj.uz

Submission #586656

# Submission time Handle Problem Language Result Execution time Memory
586656 2022-06-30T13:55:38 Z AlperenT Art Class (IOI13_artclass) C++17
82 / 100
 117 ms 9168 KB 
#include <bits/stdc++.h>
#include "artclass.h"
 
using namespace std;
 
const int N = 500;
const int ISSAME_THRESHOLD = 25;
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
82.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 9044 KB Output is correct
2 Correct 59 ms 9060 KB Output is correct
3 Correct 18 ms 3540 KB Output is correct
4 Correct 76 ms 9036 KB Output is correct
5 Correct 85 ms 9012 KB Output is correct
6 Incorrect 86 ms 9084 KB Output isn't correct
7 Correct 68 ms 8976 KB Output is correct
8 Correct 71 ms 8996 KB Output is correct
9 Incorrect 84 ms 9032 KB Output isn't correct
10 Correct 88 ms 9036 KB Output is correct
11 Correct 69 ms 9040 KB Output is correct
12 Correct 72 ms 8968 KB Output is correct
13 Correct 90 ms 8012 KB Output is correct
14 Correct 84 ms 9012 KB Output is correct
15 Incorrect 55 ms 8980 KB Output isn't correct
16 Correct 43 ms 9084 KB Output is correct
17 Correct 86 ms 8708 KB Output is correct
18 Correct 33 ms 5028 KB Output is correct
19 Correct 63 ms 7408 KB Output is correct
20 Correct 75 ms 7592 KB Output is correct
21 Incorrect 69 ms 7528 KB Output isn't correct
22 Correct 71 ms 9012 KB Output is correct
23 Incorrect 73 ms 8268 KB Output isn't correct
24 Correct 64 ms 5924 KB Output is correct
25 Correct 73 ms 9084 KB Output is correct
26 Correct 98 ms 9168 KB Output is correct
27 Correct 89 ms 7496 KB Output is correct
28 Correct 84 ms 9092 KB Output is correct
29 Correct 45 ms 5756 KB Output is correct
30 Correct 78 ms 9032 KB Output is correct
31 Correct 56 ms 9036 KB Output is correct
32 Incorrect 43 ms 5688 KB Output isn't correct
33 Correct 48 ms 9084 KB Output is correct
34 Correct 83 ms 9084 KB Output is correct
35 Correct 85 ms 9032 KB Output is correct
36 Correct 75 ms 9084 KB Output is correct
37 Correct 54 ms 9036 KB Output is correct
38 Correct 77 ms 8268 KB Output is correct
39 Correct 72 ms 9080 KB Output is correct
40 Incorrect 86 ms 9016 KB Output isn't correct
41 Correct 52 ms 9084 KB Output is correct
42 Correct 72 ms 7724 KB Output is correct
43 Correct 77 ms 8992 KB Output is correct
44 Correct 95 ms 8128 KB Output is correct
45 Correct 101 ms 9168 KB Output is correct
46 Correct 86 ms 7832 KB Output is correct
47 Correct 62 ms 9076 KB Output is correct
48 Incorrect 67 ms 9008 KB Output isn't correct
49 Correct 94 ms 7884 KB Output is correct
50 Incorrect 57 ms 6688 KB Output isn't correct
51 Correct 59 ms 6604 KB Output is correct
52 Correct 65 ms 7252 KB Output is correct
53 Correct 38 ms 5180 KB Output is correct
54 Correct 71 ms 7600 KB Output is correct
55 Correct 69 ms 7956 KB Output is correct
56 Correct 69 ms 7396 KB Output is correct
57 Correct 43 ms 4940 KB Output is correct
58 Incorrect 71 ms 7644 KB Output isn't correct
59 Incorrect 58 ms 7380 KB Output isn't correct
60 Correct 73 ms 8172 KB Output is correct
61 Correct 67 ms 7428 KB Output is correct
62 Correct 83 ms 8908 KB Output is correct
63 Incorrect 85 ms 8968 KB Output isn't correct
64 Correct 55 ms 9016 KB Output is correct
65 Correct 70 ms 9084 KB Output is correct
66 Correct 117 ms 9012 KB Output is correct
67 Correct 81 ms 9000 KB Output is correct
68 Correct 72 ms 7816 KB Output is correct
69 Correct 71 ms 9088 KB Output is correct
70 Correct 95 ms 9128 KB Output is correct
71 Correct 84 ms 9084 KB Output is correct
72 Correct 79 ms 8968 KB Output is correct
73 Correct 73 ms 9080 KB Output is correct
74 Correct 68 ms 7292 KB Output is correct
75 Correct 72 ms 7872 KB Output is correct
76 Incorrect 63 ms 8992 KB Output isn't correct
77 Correct 50 ms 6376 KB Output is correct
78 Correct 39 ms 5708 KB Output is correct
79 Correct 53 ms 6416 KB Output is correct
80 Correct 42 ms 5764 KB Output is correct
81 Correct 71 ms 9080 KB Output is correct
82 Correct 69 ms 7880 KB Output is correct
83 Correct 53 ms 6612 KB Output is correct
84 Correct 68 ms 7724 KB Output is correct
85 Correct 77 ms 9092 KB Output is correct
86 Correct 78 ms 7668 KB Output is correct
87 Correct 53 ms 8992 KB Output is correct
88 Incorrect 77 ms 9084 KB Output isn't correct
89 Incorrect 82 ms 9088 KB Output isn't correct
90 Correct 71 ms 8968 KB Output is correct
91 Incorrect 67 ms 8984 KB Output isn't correct
92 Correct 61 ms 7128 KB Output is correct
93 Correct 74 ms 9036 KB Output is correct
94 Correct 24 ms 8844 KB Output is correct
95 Incorrect 87 ms 9084 KB Output isn't correct
96 Correct 94 ms 8984 KB Output is correct
97 Correct 72 ms 8960 KB Output is correct
98 Correct 80 ms 7956 KB Output is correct
99 Correct 102 ms 9088 KB Output is correct
100 Incorrect 82 ms 9056 KB Output isn't correct
101 Correct 82 ms 9064 KB Output is correct
102 Correct 66 ms 7532 KB Output is correct