oj.uz

답안 #586680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586680 2022-06-30T14:29:33 Z AlperenT 미술 수업 (IOI13_artclass) C++17
62 / 100
 144 ms 9148 KB 
#include <bits/stdc++.h>
#include "artclass.h"
 
using namespace std;
 
const int N = 500;
const int ISSAME_THRESHOLD = 25;
const int ISGREEN_THRESHOLD = 40;
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
62.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 5012 KB Output is correct
2 Correct 92 ms 9084 KB Output is correct
3 Incorrect 86 ms 9036 KB Output isn't correct
4 Correct 52 ms 9000 KB Output is correct
5 Correct 86 ms 9056 KB Output is correct
6 Incorrect 84 ms 9068 KB Output isn't correct
7 Correct 43 ms 5708 KB Output is correct
8 Correct 76 ms 9036 KB Output is correct
9 Incorrect 83 ms 9080 KB Output isn't correct
10 Correct 133 ms 9080 KB Output is correct
11 Incorrect 70 ms 7600 KB Output isn't correct
12 Correct 77 ms 5704 KB Output is correct
13 Correct 78 ms 8132 KB Output is correct
14 Correct 52 ms 9036 KB Output is correct
15 Correct 87 ms 7500 KB Output is correct
16 Correct 89 ms 8976 KB Output is correct
17 Incorrect 67 ms 8968 KB Output isn't correct
18 Correct 69 ms 7304 KB Output is correct
19 Correct 101 ms 9012 KB Output is correct
20 Correct 35 ms 5032 KB Output is correct
21 Incorrect 77 ms 9020 KB Output isn't correct
22 Incorrect 68 ms 7532 KB Output isn't correct
23 Incorrect 90 ms 9084 KB Output isn't correct
24 Correct 89 ms 8764 KB Output is correct
25 Correct 66 ms 7220 KB Output is correct
26 Correct 99 ms 7956 KB Output is correct
27 Incorrect 67 ms 9084 KB Output isn't correct
28 Correct 76 ms 9092 KB Output is correct
29 Correct 34 ms 8856 KB Output is correct
30 Correct 69 ms 9084 KB Output is correct
31 Correct 62 ms 9080 KB Output is correct
32 Incorrect 84 ms 9148 KB Output isn't correct
33 Correct 48 ms 5068 KB Output is correct
34 Correct 68 ms 9080 KB Output is correct
35 Correct 85 ms 9048 KB Output is correct
36 Correct 90 ms 8968 KB Output is correct
37 Correct 95 ms 7700 KB Output is correct
38 Correct 67 ms 9088 KB Output is correct
39 Correct 50 ms 6016 KB Output is correct
40 Correct 67 ms 9048 KB Output is correct
41 Correct 63 ms 6608 KB Output is correct
42 Correct 57 ms 9084 KB Output is correct
43 Incorrect 97 ms 9080 KB Output isn't correct
44 Correct 51 ms 9080 KB Output is correct
45 Correct 70 ms 7924 KB Output is correct
46 Correct 80 ms 8068 KB Output is correct
47 Correct 70 ms 7252 KB Output is correct
48 Correct 144 ms 9036 KB Output is correct
49 Correct 84 ms 9120 KB Output is correct
50 Correct 56 ms 6312 KB Output is correct
51 Incorrect 91 ms 9036 KB Output isn't correct
52 Incorrect 93 ms 9012 KB Output isn't correct
53 Correct 87 ms 9080 KB Output is correct
54 Correct 114 ms 9012 KB Output is correct
55 Correct 57 ms 5656 KB Output is correct
56 Correct 45 ms 5752 KB Output is correct
57 Incorrect 80 ms 7580 KB Output isn't correct
58 Incorrect 69 ms 9088 KB Output isn't correct
59 Correct 84 ms 7920 KB Output is correct
60 Correct 60 ms 9084 KB Output is correct
61 Correct 98 ms 9092 KB Output is correct
62 Incorrect 83 ms 9012 KB Output isn't correct
63 Incorrect 101 ms 9084 KB Output isn't correct
64 Correct 69 ms 7760 KB Output is correct
65 Correct 101 ms 9084 KB Output is correct
66 Correct 58 ms 6660 KB Output is correct
67 Correct 107 ms 9048 KB Output is correct
68 Correct 101 ms 7384 KB Output is correct
69 Correct 73 ms 9044 KB Output is correct
70 Incorrect 73 ms 9084 KB Output isn't correct
71 Incorrect 82 ms 7740 KB Output isn't correct
72 Incorrect 86 ms 8196 KB Output isn't correct
73 Incorrect 67 ms 7564 KB Output isn't correct
74 Correct 93 ms 9080 KB Output is correct
75 Correct 85 ms 9028 KB Output is correct
76 Correct 130 ms 9036 KB Output is correct
77 Correct 121 ms 9076 KB Output is correct
78 Correct 91 ms 8976 KB Output is correct
79 Correct 73 ms 9056 KB Output is correct
80 Correct 77 ms 8264 KB Output is correct
81 Correct 65 ms 7356 KB Output is correct
82 Correct 57 ms 8972 KB Output is correct
83 Correct 63 ms 9084 KB Output is correct
84 Correct 67 ms 9020 KB Output is correct
85 Incorrect 72 ms 9036 KB Output isn't correct
86 Correct 98 ms 9004 KB Output is correct
87 Correct 20 ms 3652 KB Output is correct
88 Correct 61 ms 6688 KB Output is correct
89 Incorrect 79 ms 8008 KB Output isn't correct
90 Incorrect 71 ms 8980 KB Output isn't correct
91 Correct 70 ms 7512 KB Output is correct
92 Correct 79 ms 8012 KB Output is correct
93 Incorrect 118 ms 7892 KB Output isn't correct
94 Incorrect 65 ms 7456 KB Output isn't correct
95 Correct 87 ms 9080 KB Output is correct
96 Correct 105 ms 7724 KB Output is correct
97 Correct 72 ms 7736 KB Output is correct
98 Correct 74 ms 9084 KB Output is correct
99 Correct 80 ms 9036 KB Output is correct
100 Incorrect 77 ms 7864 KB Output isn't correct
101 Correct 60 ms 6488 KB Output is correct
102 Correct 88 ms 9120 KB Output is correct