oj.uz

Submission #399142

# Submission time Handle Problem Language Result Execution time Memory
399142 2021-05-05T10:57:53 Z prvocislo Art Class (IOI13_artclass) C++17
80 / 100
 85 ms 7224 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <queue>
#include "artclass.h"
typedef long long ll;
using namespace std;

const int dx[4] = { 1, 1, -1, -1 }, dy[4] = { -1, 1, -1, 1 }, maxn = 500;
int h, w;
bool valid(int x, int y) { return 0 <= x && x < h && 0 <= y && y < w; }
vector<vector<int> > vis, r(maxn, vector<int>(maxn)), g(maxn, vector<int>(maxn)), b(maxn, vector<int>(maxn));
bool black(int x, int y) { return r[x][y] + b[x][y] + g[x][y] < 100; }
bool same(int x1, int y1, int x2, int y2) {
	return abs(r[x1][y1] - r[x2][y2]) + abs(g[x1][y1] - g[x2][y2]) + abs(b[x1][y1] - b[x2][y2]) < 75;
}
bool green(int x, int y)
{
	return b[x][y] < g[x][y] && r[x][y] < g[x][y];
}
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
	h = H, w = W; vis.assign(h, vector<int>(w, 0));
	for (int i = 0; i < h; i++) for (int j = 0; j < w; j++)
		r[i][j] = R[i][j], g[i][j] = G[i][j], b[i][j] = B[i][j];
	int big = 0, small = 0, semi = 0, gr = 0;
	int minx = h, miny = w, maxx = 0, maxy = 0;
	for (int i = 0; i < h; i++) for (int j = 0; j < w; j++)
	{
		gr += 2 * g[i][j] - r[i][j] - b[i][j];
		if (black(i, j))
		{
			minx = min(i, minx), maxx = max(i, maxx);
			miny = min(j, miny), maxy = max(j, maxy);
		}
		if (!vis[i][j])
		{
			int siz = 0;
			queue<pair<int, int> > q; q.push({ i, j });
			while (!q.empty())
			{
				int x, y;
				tie(x, y) = q.front(); q.pop(); siz++;
				for (int i = 0; i < 4; i++)
				{
					int xi = x + dx[i], yi = y + dy[i];
					if (!valid(xi, yi) || !same(x, y, xi, yi) || vis[xi][yi]) continue;
					q.push({ xi, yi }); vis[xi][yi] = true;
				}
			}
			if (siz > (h * w) / 50) semi++;
			if (siz > (h * w) / 20) big++;
			else small++;
		}
	}
	//cout << h * w << " " << big << " " << semi << " " << small << " " << gr << "\n";
	int mx = abs(minx - maxx), my = abs(miny - maxy); // pre styl 1 mame vela nahodnej ciernej
	if (small >= (h * w) / 10) return 3;
	if (10 <= semi && mx >= (h / 8) * 7 && my >= (w / 8) * 7) return 1;
	if (gr > (H * W)) return 2;
	if (big) return 4;
	return 3;
}

Subtask #1
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 7192 KB Output is correct
2 Incorrect 76 ms 7192 KB Output isn't correct
3 Incorrect 52 ms 6832 KB Output isn't correct
4 Correct 49 ms 6780 KB Output is correct
5 Correct 46 ms 5444 KB Output is correct
6 Correct 47 ms 5296 KB Output is correct
7 Correct 66 ms 6204 KB Output is correct
8 Correct 42 ms 5208 KB Output is correct
9 Correct 70 ms 6928 KB Output is correct
10 Incorrect 50 ms 6852 KB Output isn't correct
11 Correct 65 ms 6424 KB Output is correct
12 Correct 47 ms 5212 KB Output is correct
13 Correct 56 ms 5828 KB Output is correct
14 Correct 62 ms 6084 KB Output is correct
15 Correct 71 ms 6476 KB Output is correct
16 Correct 76 ms 7180 KB Output is correct
17 Correct 39 ms 6596 KB Output is correct
18 Correct 53 ms 6804 KB Output is correct
19 Correct 50 ms 6852 KB Output is correct
20 Correct 19 ms 4044 KB Output is correct
21 Correct 68 ms 6868 KB Output is correct
22 Correct 54 ms 6828 KB Output is correct
23 Incorrect 68 ms 7016 KB Output isn't correct
24 Correct 62 ms 6148 KB Output is correct
25 Correct 74 ms 6924 KB Output is correct
26 Correct 76 ms 7128 KB Output is correct
27 Incorrect 43 ms 6724 KB Output isn't correct
28 Incorrect 77 ms 7108 KB Output isn't correct
29 Incorrect 69 ms 7004 KB Output isn't correct
30 Correct 64 ms 6212 KB Output is correct
31 Correct 66 ms 6340 KB Output is correct
32 Incorrect 66 ms 7044 KB Output isn't correct
33 Incorrect 61 ms 6984 KB Output isn't correct
34 Correct 77 ms 7144 KB Output is correct
35 Correct 67 ms 6496 KB Output is correct
36 Correct 56 ms 5688 KB Output is correct
37 Correct 68 ms 6692 KB Output is correct
38 Correct 61 ms 6228 KB Output is correct
39 Correct 55 ms 5576 KB Output is correct
40 Correct 62 ms 7012 KB Output is correct
41 Correct 58 ms 5884 KB Output is correct
42 Correct 59 ms 6212 KB Output is correct
43 Incorrect 74 ms 7072 KB Output isn't correct
44 Correct 54 ms 5704 KB Output is correct
45 Correct 75 ms 7132 KB Output is correct
46 Correct 64 ms 6924 KB Output is correct
47 Correct 60 ms 7020 KB Output is correct
48 Incorrect 75 ms 7108 KB Output isn't correct
49 Correct 61 ms 6552 KB Output is correct
50 Correct 49 ms 6848 KB Output is correct
51 Correct 68 ms 6884 KB Output is correct
52 Correct 46 ms 6788 KB Output is correct
53 Correct 71 ms 6980 KB Output is correct
54 Correct 77 ms 7108 KB Output is correct
55 Correct 79 ms 7132 KB Output is correct
56 Correct 66 ms 6468 KB Output is correct
57 Correct 68 ms 6384 KB Output is correct
58 Correct 65 ms 6528 KB Output is correct
59 Correct 64 ms 6932 KB Output is correct
60 Correct 63 ms 6912 KB Output is correct
61 Incorrect 72 ms 7108 KB Output isn't correct
62 Correct 20 ms 6376 KB Output is correct
63 Incorrect 73 ms 7120 KB Output isn't correct
64 Correct 66 ms 6976 KB Output is correct
65 Correct 63 ms 7028 KB Output is correct
66 Correct 68 ms 6472 KB Output is correct
67 Correct 37 ms 4884 KB Output is correct
68 Incorrect 85 ms 7224 KB Output isn't correct
69 Correct 60 ms 6860 KB Output is correct
70 Incorrect 43 ms 5444 KB Output isn't correct
71 Correct 68 ms 6312 KB Output is correct
72 Correct 56 ms 6900 KB Output is correct
73 Correct 38 ms 4800 KB Output is correct
74 Correct 62 ms 6288 KB Output is correct
75 Correct 70 ms 6724 KB Output is correct
76 Correct 72 ms 6988 KB Output is correct
77 Incorrect 78 ms 7176 KB Output isn't correct
78 Correct 55 ms 6980 KB Output is correct
79 Correct 65 ms 6468 KB Output is correct
80 Correct 46 ms 6724 KB Output is correct
81 Incorrect 84 ms 7144 KB Output isn't correct
82 Correct 66 ms 6596 KB Output is correct
83 Correct 64 ms 7000 KB Output is correct
84 Correct 55 ms 6724 KB Output is correct
85 Correct 63 ms 6160 KB Output is correct
86 Correct 66 ms 6468 KB Output is correct
87 Incorrect 66 ms 6960 KB Output isn't correct
88 Correct 64 ms 7004 KB Output is correct
89 Correct 69 ms 6616 KB Output is correct
90 Correct 76 ms 7200 KB Output is correct
91 Correct 62 ms 6340 KB Output is correct
92 Correct 38 ms 5060 KB Output is correct
93 Correct 72 ms 6624 KB Output is correct
94 Incorrect 67 ms 6952 KB Output isn't correct
95 Correct 63 ms 6296 KB Output is correct
96 Correct 73 ms 6632 KB Output is correct
97 Correct 71 ms 7128 KB Output is correct
98 Correct 67 ms 6976 KB Output is correct
99 Correct 68 ms 6992 KB Output is correct
100 Correct 61 ms 6928 KB Output is correct
101 Correct 63 ms 6936 KB Output is correct
102 Correct 62 ms 6892 KB Output is correct