oj.uz

Submission #586668

# Submission time Handle Problem Language Result Execution time Memory
586668 2022-06-30T14:16:53 Z AlperenT Art Class (IOI13_artclass) C++17
71 / 100
 119 ms 9096 KB 
#include <bits/stdc++.h>
#include "artclass.h"
 
using namespace std;
 
const int N = 500;
const int ISSAME_THRESHOLD = 20;
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
71.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 6488 KB Output is correct
2 Correct 65 ms 7280 KB Output is correct
3 Correct 82 ms 8972 KB Output is correct
4 Correct 60 ms 9036 KB Output is correct
5 Correct 51 ms 9004 KB Output is correct
6 Correct 59 ms 9028 KB Output is correct
7 Correct 83 ms 9080 KB Output is correct
8 Incorrect 70 ms 9088 KB Output isn't correct
9 Correct 82 ms 9036 KB Output is correct
10 Correct 66 ms 7452 KB Output is correct
11 Incorrect 80 ms 8288 KB Output isn't correct
12 Correct 72 ms 9076 KB Output is correct
13 Correct 82 ms 8088 KB Output is correct
14 Correct 78 ms 9000 KB Output is correct
15 Correct 68 ms 9084 KB Output is correct
16 Correct 49 ms 6016 KB Output is correct
17 Correct 71 ms 9008 KB Output is correct
18 Incorrect 66 ms 9036 KB Output isn't correct
19 Correct 76 ms 7956 KB Output is correct
20 Correct 76 ms 9080 KB Output is correct
21 Correct 54 ms 9084 KB Output is correct
22 Correct 68 ms 8988 KB Output is correct
23 Correct 61 ms 9088 KB Output is correct
24 Incorrect 62 ms 9096 KB Output isn't correct
25 Correct 66 ms 7764 KB Output is correct
26 Correct 96 ms 9092 KB Output is correct
27 Incorrect 62 ms 9084 KB Output isn't correct
28 Correct 65 ms 7568 KB Output is correct
29 Correct 71 ms 7676 KB Output is correct
30 Incorrect 68 ms 9060 KB Output isn't correct
31 Correct 57 ms 5760 KB Output is correct
32 Correct 42 ms 5804 KB Output is correct
33 Correct 66 ms 7172 KB Output is correct
34 Incorrect 86 ms 9084 KB Output isn't correct
35 Incorrect 75 ms 9036 KB Output isn't correct
36 Incorrect 59 ms 6772 KB Output isn't correct
37 Correct 82 ms 9084 KB Output is correct
38 Correct 67 ms 7452 KB Output is correct
39 Correct 77 ms 9032 KB Output is correct
40 Correct 74 ms 9084 KB Output is correct
41 Incorrect 79 ms 7764 KB Output isn't correct
42 Correct 49 ms 9084 KB Output is correct
43 Correct 32 ms 4976 KB Output is correct
44 Correct 45 ms 4968 KB Output is correct
45 Correct 47 ms 5644 KB Output is correct
46 Incorrect 66 ms 8984 KB Output isn't correct
47 Correct 91 ms 8132 KB Output is correct
48 Correct 68 ms 7500 KB Output is correct
49 Correct 71 ms 9004 KB Output is correct
50 Correct 112 ms 8924 KB Output is correct
51 Incorrect 83 ms 9072 KB Output isn't correct
52 Correct 75 ms 7900 KB Output is correct
53 Correct 56 ms 6684 KB Output is correct
54 Correct 29 ms 3540 KB Output is correct
55 Correct 44 ms 9036 KB Output is correct
56 Correct 90 ms 8656 KB Output is correct
57 Correct 95 ms 9084 KB Output is correct
58 Correct 56 ms 9084 KB Output is correct
59 Correct 95 ms 8068 KB Output is correct
60 Correct 64 ms 7396 KB Output is correct
61 Correct 84 ms 8916 KB Output is correct
62 Correct 67 ms 8972 KB Output is correct
63 Correct 50 ms 9080 KB Output is correct
64 Correct 69 ms 8968 KB Output is correct
65 Correct 54 ms 6512 KB Output is correct
66 Correct 86 ms 9072 KB Output is correct
67 Correct 51 ms 9072 KB Output is correct
68 Correct 71 ms 8968 KB Output is correct
69 Correct 66 ms 9088 KB Output is correct
70 Incorrect 95 ms 9036 KB Output isn't correct
71 Correct 61 ms 9084 KB Output is correct
72 Incorrect 77 ms 9080 KB Output isn't correct
73 Correct 69 ms 7304 KB Output is correct
74 Correct 84 ms 9024 KB Output is correct
75 Correct 73 ms 7808 KB Output is correct
76 Correct 67 ms 7600 KB Output is correct
77 Correct 72 ms 9008 KB Output is correct
78 Incorrect 71 ms 7500 KB Output isn't correct
79 Incorrect 87 ms 9080 KB Output isn't correct
80 Incorrect 58 ms 9060 KB Output isn't correct
81 Incorrect 56 ms 7384 KB Output isn't correct
82 Incorrect 54 ms 5608 KB Output isn't correct
83 Correct 71 ms 7720 KB Output is correct
84 Correct 22 ms 8860 KB Output is correct
85 Correct 91 ms 8348 KB Output is correct
86 Incorrect 84 ms 9088 KB Output isn't correct
87 Correct 75 ms 7632 KB Output is correct
88 Correct 54 ms 9036 KB Output is correct
89 Correct 78 ms 7884 KB Output is correct
90 Correct 119 ms 9028 KB Output is correct
91 Incorrect 84 ms 9072 KB Output isn't correct
92 Correct 71 ms 7888 KB Output is correct
93 Correct 83 ms 8972 KB Output is correct
94 Correct 74 ms 8012 KB Output is correct
95 Incorrect 96 ms 9036 KB Output isn't correct
96 Incorrect 57 ms 9068 KB Output isn't correct
97 Correct 82 ms 7936 KB Output is correct
98 Correct 83 ms 8972 KB Output is correct
99 Correct 56 ms 6392 KB Output is correct
100 Correct 80 ms 9084 KB Output is correct
101 Correct 45 ms 5076 KB Output is correct
102 Correct 92 ms 8968 KB Output is correct