oj.uz

Submission #586722

# Submission time Handle Problem Language Result Execution time Memory
586722 2022-06-30T14:56:34 Z AlperenT Art Class (IOI13_artclass) C++17
78 / 100
 137 ms 9164 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 = 40;
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]);
		}
	}
 
	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
78.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 9084 KB Output is correct
2 Incorrect 106 ms 9036 KB Output isn't correct
3 Correct 137 ms 8916 KB Output is correct
4 Correct 84 ms 9084 KB Output is correct
5 Correct 79 ms 7924 KB Output is correct
6 Incorrect 106 ms 9084 KB Output isn't correct
7 Incorrect 114 ms 9088 KB Output isn't correct
8 Correct 84 ms 9012 KB Output is correct
9 Correct 66 ms 9084 KB Output is correct
10 Correct 67 ms 7568 KB Output is correct
11 Incorrect 106 ms 9164 KB Output isn't correct
12 Correct 84 ms 9084 KB Output is correct
13 Correct 67 ms 7536 KB Output is correct
14 Correct 64 ms 9088 KB Output is correct
15 Correct 72 ms 7692 KB Output is correct
16 Incorrect 78 ms 9084 KB Output isn't correct
17 Correct 73 ms 9020 KB Output is correct
18 Correct 86 ms 9088 KB Output is correct
19 Correct 77 ms 8976 KB Output is correct
20 Correct 82 ms 9088 KB Output is correct
21 Correct 86 ms 7352 KB Output is correct
22 Correct 90 ms 9084 KB Output is correct
23 Incorrect 71 ms 7596 KB Output isn't correct
24 Correct 65 ms 9036 KB Output is correct
25 Correct 80 ms 9052 KB Output is correct
26 Correct 72 ms 9032 KB Output is correct
27 Correct 98 ms 9080 KB Output is correct
28 Incorrect 75 ms 8968 KB Output isn't correct
29 Correct 82 ms 9084 KB Output is correct
30 Correct 114 ms 9036 KB Output is correct
31 Correct 25 ms 8788 KB Output is correct
32 Correct 76 ms 7920 KB Output is correct
33 Correct 77 ms 6504 KB Output is correct
34 Correct 52 ms 9080 KB Output is correct
35 Correct 71 ms 8976 KB Output is correct
36 Correct 44 ms 5028 KB Output is correct
37 Correct 71 ms 5644 KB Output is correct
38 Incorrect 69 ms 8988 KB Output isn't correct
39 Correct 54 ms 5028 KB Output is correct
40 Correct 73 ms 7728 KB Output is correct
41 Incorrect 72 ms 7616 KB Output isn't correct
42 Correct 56 ms 6684 KB Output is correct
43 Correct 76 ms 9036 KB Output is correct
44 Correct 99 ms 9080 KB Output is correct
45 Correct 75 ms 7320 KB Output is correct
46 Correct 63 ms 9084 KB Output is correct
47 Correct 76 ms 8160 KB Output is correct
48 Correct 46 ms 5132 KB Output is correct
49 Correct 65 ms 7396 KB Output is correct
50 Correct 47 ms 6396 KB Output is correct
51 Incorrect 68 ms 7560 KB Output isn't correct
52 Correct 61 ms 7140 KB Output is correct
53 Correct 82 ms 8128 KB Output is correct
54 Correct 58 ms 9084 KB Output is correct
55 Incorrect 64 ms 6844 KB Output isn't correct
56 Correct 74 ms 9088 KB Output is correct
57 Correct 112 ms 8068 KB Output is correct
58 Correct 81 ms 8648 KB Output is correct
59 Incorrect 72 ms 7860 KB Output isn't correct
60 Correct 84 ms 9136 KB Output is correct
61 Incorrect 75 ms 9088 KB Output isn't correct
62 Correct 18 ms 3648 KB Output is correct
63 Correct 77 ms 7720 KB Output is correct
64 Correct 46 ms 5608 KB Output is correct
65 Correct 73 ms 7920 KB Output is correct
66 Correct 56 ms 8980 KB Output is correct
67 Correct 91 ms 9088 KB Output is correct
68 Correct 56 ms 8972 KB Output is correct
69 Incorrect 62 ms 9088 KB Output isn't correct
70 Correct 76 ms 8008 KB Output is correct
71 Correct 55 ms 6496 KB Output is correct
72 Correct 67 ms 5696 KB Output is correct
73 Correct 54 ms 9080 KB Output is correct
74 Correct 74 ms 8092 KB Output is correct
75 Correct 60 ms 9084 KB Output is correct
76 Correct 85 ms 9080 KB Output is correct
77 Correct 62 ms 7424 KB Output is correct
78 Correct 55 ms 8988 KB Output is correct
79 Correct 48 ms 9036 KB Output is correct
80 Correct 72 ms 7644 KB Output is correct
81 Correct 54 ms 9080 KB Output is correct
82 Correct 87 ms 9084 KB Output is correct
83 Incorrect 94 ms 8196 KB Output isn't correct
84 Correct 90 ms 9036 KB Output is correct
85 Incorrect 71 ms 9036 KB Output isn't correct
86 Correct 73 ms 9084 KB Output is correct
87 Incorrect 94 ms 9084 KB Output isn't correct
88 Incorrect 87 ms 7860 KB Output isn't correct
89 Correct 96 ms 9060 KB Output is correct
90 Correct 131 ms 9084 KB Output is correct
91 Correct 45 ms 5724 KB Output is correct
92 Incorrect 87 ms 7456 KB Output isn't correct
93 Correct 100 ms 9036 KB Output is correct
94 Correct 71 ms 9080 KB Output is correct
95 Correct 80 ms 9088 KB Output is correct
96 Correct 73 ms 7496 KB Output is correct
97 Correct 83 ms 7700 KB Output is correct
98 Correct 90 ms 9088 KB Output is correct
99 Correct 76 ms 9084 KB Output is correct
100 Correct 77 ms 9024 KB Output is correct
101 Correct 49 ms 6012 KB Output is correct
102 Incorrect 95 ms 8988 KB Output isn't correct