답안 #586650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586650	2022-06-30T13:44:25 Z	AlperenT	미술 수업 (IOI13_artclass)	C++17	82 / 100	108 ms	9172 KB

artclass

#include <bits/stdc++.h>
#include "artclass.h"
 
using namespace std;
 
const int N = 500;
const int ISSAME_THRESHOLD = 30;
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

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	8788 KB	Output is correct
2	Correct	87 ms	8996 KB	Output is correct
3	Correct	76 ms	7892 KB	Output is correct
4	Correct	84 ms	7596 KB	Output is correct
5	Correct	74 ms	7924 KB	Output is correct
6	Incorrect	78 ms	9080 KB	Output isn't correct
7	Correct	83 ms	9036 KB	Output is correct
8	Correct	51 ms	8988 KB	Output is correct
9	Correct	50 ms	9084 KB	Output is correct
10	Correct	56 ms	9088 KB	Output is correct
11	Incorrect	68 ms	9080 KB	Output isn't correct
12	Correct	69 ms	7680 KB	Output is correct
13	Incorrect	108 ms	9000 KB	Output isn't correct
14	Incorrect	76 ms	9068 KB	Output isn't correct
15	Correct	37 ms	4948 KB	Output is correct
16	Incorrect	71 ms	7860 KB	Output isn't correct
17	Correct	69 ms	7720 KB	Output is correct
18	Correct	70 ms	9084 KB	Output is correct
19	Correct	79 ms	7844 KB	Output is correct
20	Correct	54 ms	6332 KB	Output is correct
21	Incorrect	88 ms	9084 KB	Output isn't correct
22	Correct	75 ms	8036 KB	Output is correct
23	Correct	67 ms	7392 KB	Output is correct
24	Correct	99 ms	9092 KB	Output is correct
25	Correct	76 ms	7960 KB	Output is correct
26	Correct	73 ms	9020 KB	Output is correct
27	Incorrect	61 ms	7392 KB	Output isn't correct
28	Correct	72 ms	9040 KB	Output is correct
29	Correct	73 ms	8120 KB	Output is correct
30	Correct	43 ms	5712 KB	Output is correct
31	Correct	85 ms	8932 KB	Output is correct
32	Correct	86 ms	9156 KB	Output is correct
33	Correct	69 ms	9084 KB	Output is correct
34	Correct	78 ms	8644 KB	Output is correct
35	Correct	82 ms	9084 KB	Output is correct
36	Correct	42 ms	9044 KB	Output is correct
37	Correct	56 ms	9084 KB	Output is correct
38	Correct	66 ms	7372 KB	Output is correct
39	Correct	51 ms	9064 KB	Output is correct
40	Correct	69 ms	9060 KB	Output is correct
41	Correct	18 ms	3660 KB	Output is correct
42	Correct	58 ms	9060 KB	Output is correct
43	Correct	72 ms	8976 KB	Output is correct
44	Correct	81 ms	8924 KB	Output is correct
45	Correct	87 ms	8924 KB	Output is correct
46	Correct	73 ms	9080 KB	Output is correct
47	Correct	77 ms	9004 KB	Output is correct
48	Incorrect	77 ms	9088 KB	Output isn't correct
49	Correct	65 ms	7296 KB	Output is correct
50	Correct	40 ms	5724 KB	Output is correct
51	Correct	67 ms	7552 KB	Output is correct
52	Correct	78 ms	7484 KB	Output is correct
53	Correct	35 ms	4924 KB	Output is correct
54	Correct	84 ms	8056 KB	Output is correct
55	Incorrect	77 ms	9084 KB	Output isn't correct
56	Correct	76 ms	9048 KB	Output is correct
57	Correct	55 ms	9080 KB	Output is correct
58	Correct	66 ms	9088 KB	Output is correct
59	Correct	74 ms	7476 KB	Output is correct
60	Correct	80 ms	9080 KB	Output is correct
61	Correct	54 ms	6604 KB	Output is correct
62	Correct	55 ms	6492 KB	Output is correct
63	Incorrect	59 ms	9172 KB	Output isn't correct
64	Incorrect	58 ms	9060 KB	Output isn't correct
65	Correct	68 ms	9084 KB	Output is correct
66	Correct	75 ms	8268 KB	Output is correct
67	Correct	68 ms	7744 KB	Output is correct
68	Correct	68 ms	8996 KB	Output is correct
69	Correct	60 ms	8976 KB	Output is correct
70	Correct	69 ms	9080 KB	Output is correct
71	Correct	46 ms	5972 KB	Output is correct
72	Correct	81 ms	8072 KB	Output is correct
73	Correct	65 ms	7352 KB	Output is correct
74	Correct	56 ms	6688 KB	Output is correct
75	Correct	68 ms	7724 KB	Output is correct
76	Correct	90 ms	7844 KB	Output is correct
77	Correct	63 ms	9036 KB	Output is correct
78	Correct	71 ms	9076 KB	Output is correct
79	Correct	102 ms	9076 KB	Output is correct
80	Correct	64 ms	9084 KB	Output is correct
81	Correct	51 ms	9084 KB	Output is correct
82	Correct	65 ms	7320 KB	Output is correct
83	Incorrect	95 ms	8284 KB	Output isn't correct
84	Correct	69 ms	9032 KB	Output is correct
85	Incorrect	83 ms	9088 KB	Output isn't correct
86	Correct	37 ms	5204 KB	Output is correct
87	Correct	97 ms	9064 KB	Output is correct
88	Correct	74 ms	9036 KB	Output is correct
89	Correct	78 ms	9084 KB	Output is correct
90	Incorrect	58 ms	6784 KB	Output isn't correct
91	Correct	82 ms	9080 KB	Output is correct
92	Incorrect	79 ms	9080 KB	Output isn't correct
93	Incorrect	69 ms	7444 KB	Output isn't correct
94	Correct	44 ms	5752 KB	Output is correct
95	Correct	84 ms	9084 KB	Output is correct
96	Correct	70 ms	9080 KB	Output is correct
97	Correct	69 ms	9092 KB	Output is correct
98	Incorrect	54 ms	9084 KB	Output isn't correct
99	Correct	72 ms	9096 KB	Output is correct
100	Correct	66 ms	7768 KB	Output is correct
101	Correct	75 ms	9080 KB	Output is correct
102	Incorrect	44 ms	5716 KB	Output isn't correct