oj.uz

Submission #586688

# Submission time Handle Problem Language Result Execution time Memory
586688 2022-06-30T14:36:12 Z AlperenT Art Class (IOI13_artclass) C++17
80 / 100
 205 ms 9096 KB 
#include <bits/stdc++.h>
#include "artclass.h"
 
using namespace std;
 
const int N = 500;
const int ISSAME_THRESHOLD = 25;
const int ISGREEN_THRESHOLD = 25;
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]);
		}
	}
 
	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
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 7652 KB Output is correct
2 Correct 106 ms 8980 KB Output is correct
3 Correct 82 ms 9036 KB Output is correct
4 Correct 61 ms 5660 KB Output is correct
5 Correct 64 ms 8992 KB Output is correct
6 Correct 51 ms 6312 KB Output is correct
7 Correct 104 ms 9044 KB Output is correct
8 Correct 73 ms 7508 KB Output is correct
9 Incorrect 80 ms 7368 KB Output isn't correct
10 Correct 130 ms 8988 KB Output is correct
11 Correct 80 ms 9080 KB Output is correct
12 Incorrect 73 ms 7768 KB Output isn't correct
13 Correct 78 ms 9084 KB Output is correct
14 Correct 156 ms 9084 KB Output is correct
15 Incorrect 104 ms 9080 KB Output isn't correct
16 Correct 96 ms 8632 KB Output is correct
17 Incorrect 57 ms 6668 KB Output isn't correct
18 Correct 106 ms 8204 KB Output is correct
19 Correct 66 ms 7164 KB Output is correct
20 Correct 61 ms 8984 KB Output is correct
21 Correct 90 ms 7928 KB Output is correct
22 Correct 86 ms 8088 KB Output is correct
23 Incorrect 150 ms 9080 KB Output isn't correct
24 Correct 64 ms 9080 KB Output is correct
25 Correct 81 ms 9084 KB Output is correct
26 Correct 67 ms 6604 KB Output is correct
27 Incorrect 40 ms 5076 KB Output isn't correct
28 Correct 77 ms 7892 KB Output is correct
29 Correct 144 ms 6688 KB Output is correct
30 Incorrect 70 ms 9088 KB Output isn't correct
31 Correct 49 ms 5688 KB Output is correct
32 Correct 77 ms 9080 KB Output is correct
33 Incorrect 124 ms 9068 KB Output isn't correct
34 Correct 108 ms 9080 KB Output is correct
35 Correct 101 ms 9084 KB Output is correct
36 Correct 89 ms 9080 KB Output is correct
37 Correct 102 ms 9032 KB Output is correct
38 Correct 93 ms 8216 KB Output is correct
39 Correct 49 ms 5724 KB Output is correct
40 Correct 89 ms 9016 KB Output is correct
41 Correct 110 ms 8968 KB Output is correct
42 Correct 100 ms 9012 KB Output is correct
43 Correct 36 ms 5032 KB Output is correct
44 Correct 79 ms 8004 KB Output is correct
45 Correct 87 ms 9084 KB Output is correct
46 Correct 99 ms 8952 KB Output is correct
47 Correct 87 ms 9088 KB Output is correct
48 Correct 77 ms 9080 KB Output is correct
49 Incorrect 106 ms 9000 KB Output isn't correct
50 Correct 205 ms 9084 KB Output is correct
51 Correct 80 ms 9048 KB Output is correct
52 Incorrect 157 ms 9084 KB Output isn't correct
53 Correct 87 ms 7572 KB Output is correct
54 Correct 106 ms 7592 KB Output is correct
55 Correct 87 ms 7720 KB Output is correct
56 Correct 90 ms 9096 KB Output is correct
57 Correct 50 ms 8844 KB Output is correct
58 Incorrect 93 ms 9084 KB Output isn't correct
59 Correct 109 ms 9084 KB Output is correct
60 Incorrect 90 ms 9080 KB Output isn't correct
61 Correct 63 ms 7188 KB Output is correct
62 Incorrect 104 ms 9088 KB Output isn't correct
63 Incorrect 99 ms 9036 KB Output isn't correct
64 Correct 98 ms 7720 KB Output is correct
65 Correct 26 ms 3548 KB Output is correct
66 Correct 83 ms 7600 KB Output is correct
67 Correct 81 ms 7760 KB Output is correct
68 Incorrect 76 ms 9080 KB Output isn't correct
69 Correct 65 ms 5756 KB Output is correct
70 Correct 57 ms 9080 KB Output is correct
71 Correct 107 ms 9012 KB Output is correct
72 Correct 81 ms 7348 KB Output is correct
73 Correct 89 ms 9088 KB Output is correct
74 Correct 95 ms 7452 KB Output is correct
75 Correct 101 ms 9080 KB Output is correct
76 Correct 99 ms 9056 KB Output is correct
77 Correct 87 ms 9088 KB Output is correct
78 Correct 87 ms 8016 KB Output is correct
79 Correct 61 ms 9084 KB Output is correct
80 Correct 76 ms 9088 KB Output is correct
81 Correct 91 ms 6488 KB Output is correct
82 Correct 75 ms 9084 KB Output is correct
83 Incorrect 87 ms 9032 KB Output isn't correct
84 Correct 86 ms 9004 KB Output is correct
85 Correct 72 ms 7920 KB Output is correct
86 Incorrect 82 ms 8288 KB Output isn't correct
87 Correct 82 ms 7356 KB Output is correct
88 Incorrect 64 ms 9020 KB Output isn't correct
89 Correct 78 ms 9080 KB Output is correct
90 Correct 36 ms 4948 KB Output is correct
91 Correct 64 ms 9084 KB Output is correct
92 Correct 159 ms 9080 KB Output is correct
93 Correct 159 ms 9080 KB Output is correct
94 Correct 51 ms 5964 KB Output is correct
95 Correct 72 ms 8980 KB Output is correct
96 Correct 72 ms 7448 KB Output is correct
97 Correct 84 ms 9044 KB Output is correct
98 Correct 168 ms 9084 KB Output is correct
99 Correct 81 ms 7956 KB Output is correct
100 Correct 58 ms 9084 KB Output is correct
101 Correct 83 ms 7884 KB Output is correct
102 Incorrect 92 ms 7564 KB Output isn't correct