oj.uz

Submission #586643

# Submission time Handle Problem Language Result Execution time Memory
586643 2022-06-30T13:26:09 Z AlperenT Art Class (IOI13_artclass) C++17
5 / 100
 100 ms 9280 KB 
#include <bits/stdc++.h>
#include "artclass.h"

using namespace std;

const int N = 500;
const int ISSAME_THRESHOLD = 35;
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[2] - a[1] <= ISGREEN_THRESHOLD / 2)) && ((a[1] - a[0] >= ISGREEN_THRESHOLD) || (a[0] - a[1] <= ISGREEN_THRESHOLD / 2));

	// 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
5.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 7948 KB Output is correct
2 Incorrect 53 ms 8992 KB Output isn't correct
3 Correct 69 ms 8988 KB Output is correct
4 Incorrect 94 ms 9004 KB Output isn't correct
5 Incorrect 84 ms 9016 KB Output isn't correct
6 Incorrect 79 ms 9004 KB Output isn't correct
7 Incorrect 34 ms 5024 KB Output isn't correct
8 Incorrect 44 ms 5728 KB Output isn't correct
9 Incorrect 51 ms 6348 KB Output isn't correct
10 Correct 77 ms 7884 KB Output is correct
11 Incorrect 57 ms 6488 KB Output isn't correct
12 Incorrect 70 ms 9036 KB Output isn't correct
13 Incorrect 72 ms 9084 KB Output isn't correct
14 Incorrect 84 ms 9040 KB Output isn't correct
15 Correct 68 ms 7432 KB Output is correct
16 Incorrect 35 ms 8784 KB Output isn't correct
17 Correct 80 ms 8636 KB Output is correct
18 Correct 70 ms 8984 KB Output is correct
19 Correct 71 ms 9044 KB Output is correct
20 Correct 66 ms 7532 KB Output is correct
21 Correct 68 ms 9036 KB Output is correct
22 Incorrect 73 ms 9008 KB Output isn't correct
23 Incorrect 54 ms 9088 KB Output isn't correct
24 Incorrect 76 ms 9040 KB Output isn't correct
25 Incorrect 70 ms 7764 KB Output isn't correct
26 Incorrect 74 ms 8248 KB Output isn't correct
27 Incorrect 55 ms 9080 KB Output isn't correct
28 Incorrect 71 ms 7500 KB Output isn't correct
29 Correct 60 ms 9080 KB Output is correct
30 Incorrect 72 ms 7884 KB Output isn't correct
31 Incorrect 35 ms 4948 KB Output isn't correct
32 Correct 73 ms 7816 KB Output is correct
33 Incorrect 46 ms 6016 KB Output isn't correct
34 Incorrect 42 ms 9076 KB Output isn't correct
35 Correct 68 ms 9044 KB Output is correct
36 Correct 75 ms 9080 KB Output is correct
37 Incorrect 49 ms 5812 KB Output isn't correct
38 Correct 69 ms 9164 KB Output is correct
39 Incorrect 58 ms 8984 KB Output isn't correct
40 Incorrect 73 ms 8260 KB Output isn't correct
41 Correct 65 ms 7568 KB Output is correct
42 Incorrect 84 ms 9060 KB Output isn't correct
43 Correct 73 ms 9084 KB Output is correct
44 Correct 71 ms 7932 KB Output is correct
45 Correct 76 ms 8128 KB Output is correct
46 Correct 61 ms 9084 KB Output is correct
47 Incorrect 72 ms 9024 KB Output isn't correct
48 Incorrect 95 ms 9048 KB Output isn't correct
49 Incorrect 56 ms 8992 KB Output isn't correct
50 Correct 69 ms 9084 KB Output is correct
51 Incorrect 89 ms 9036 KB Output isn't correct
52 Incorrect 76 ms 9076 KB Output isn't correct
53 Correct 87 ms 7760 KB Output is correct
54 Incorrect 81 ms 9008 KB Output isn't correct
55 Incorrect 43 ms 5672 KB Output isn't correct
56 Incorrect 59 ms 9280 KB Output isn't correct
57 Correct 63 ms 7384 KB Output is correct
58 Correct 70 ms 8008 KB Output is correct
59 Correct 68 ms 7624 KB Output is correct
60 Incorrect 100 ms 9036 KB Output isn't correct
61 Correct 55 ms 6704 KB Output is correct
62 Incorrect 54 ms 9036 KB Output isn't correct
63 Incorrect 52 ms 9036 KB Output isn't correct
64 Correct 45 ms 5644 KB Output is correct
65 Incorrect 82 ms 8976 KB Output isn't correct
66 Correct 100 ms 7408 KB Output is correct
67 Incorrect 72 ms 9036 KB Output isn't correct
68 Incorrect 62 ms 7208 KB Output isn't correct
69 Correct 70 ms 8992 KB Output is correct
70 Correct 64 ms 7356 KB Output is correct
71 Incorrect 92 ms 9080 KB Output isn't correct
72 Incorrect 67 ms 9164 KB Output isn't correct
73 Correct 66 ms 7500 KB Output is correct
74 Incorrect 58 ms 8968 KB Output isn't correct
75 Correct 67 ms 7448 KB Output is correct
76 Correct 60 ms 9032 KB Output is correct
77 Incorrect 89 ms 9068 KB Output isn't correct
78 Incorrect 18 ms 3656 KB Output isn't correct
79 Correct 67 ms 7632 KB Output is correct
80 Incorrect 79 ms 9036 KB Output isn't correct
81 Incorrect 90 ms 9064 KB Output isn't correct
82 Incorrect 56 ms 6732 KB Output isn't correct
83 Correct 70 ms 9032 KB Output is correct
84 Incorrect 82 ms 9004 KB Output isn't correct
85 Correct 71 ms 7812 KB Output is correct
86 Correct 73 ms 9052 KB Output is correct
87 Incorrect 91 ms 8044 KB Output isn't correct
88 Incorrect 88 ms 8964 KB Output isn't correct
89 Incorrect 70 ms 9024 KB Output isn't correct
90 Incorrect 81 ms 9080 KB Output isn't correct
91 Incorrect 70 ms 9084 KB Output isn't correct
92 Incorrect 58 ms 9064 KB Output isn't correct
93 Incorrect 68 ms 6604 KB Output isn't correct
94 Correct 77 ms 9064 KB Output is correct
95 Correct 74 ms 9080 KB Output is correct
96 Incorrect 63 ms 7148 KB Output isn't correct
97 Incorrect 41 ms 5084 KB Output isn't correct
98 Incorrect 84 ms 8988 KB Output isn't correct
99 Incorrect 80 ms 9052 KB Output isn't correct
100 Correct 68 ms 7600 KB Output is correct
101 Correct 73 ms 8124 KB Output is correct
102 Incorrect 73 ms 9088 KB Output isn't correct