oj.uz

Submission #399122

# Submission time Handle Problem Language Result Execution time Memory
399122 2021-05-05T10:33:56 Z prvocislo Art Class (IOI13_artclass) C++17
51 / 100
 108 ms 7180 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++)
	{
		if (green(i, j)) gr++;
		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 << big << " " << semi << " " << small << " " << gr << "\n";
	int mx = abs(minx - maxx), my = abs(miny - maxy); // pre styl 1 mame vela nahodnej ciernej
	if (10 <= semi && mx >= (h / 8) * 7 && my >= (w / 8) * 7) return 1;
	if (gr >= (H * W) / 2) return 2;
	if (big) return 4;
	return 3;
}

Subtask #1
51.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 6836 KB Output is correct
2 Correct 82 ms 7120 KB Output is correct
3 Incorrect 88 ms 7108 KB Output isn't correct
4 Correct 47 ms 5204 KB Output is correct
5 Incorrect 79 ms 6220 KB Output isn't correct
6 Incorrect 45 ms 5444 KB Output isn't correct
7 Correct 66 ms 7008 KB Output is correct
8 Correct 72 ms 6956 KB Output is correct
9 Correct 57 ms 4856 KB Output is correct
10 Incorrect 65 ms 6112 KB Output isn't correct
11 Incorrect 87 ms 6848 KB Output isn't correct
12 Correct 65 ms 6196 KB Output is correct
13 Correct 54 ms 6724 KB Output is correct
14 Correct 81 ms 7108 KB Output is correct
15 Correct 69 ms 7052 KB Output is correct
16 Correct 64 ms 6452 KB Output is correct
17 Incorrect 47 ms 6696 KB Output isn't correct
18 Correct 81 ms 6344 KB Output is correct
19 Correct 64 ms 6724 KB Output is correct
20 Incorrect 49 ms 6712 KB Output isn't correct
21 Correct 71 ms 6956 KB Output is correct
22 Incorrect 96 ms 6980 KB Output isn't correct
23 Correct 86 ms 7068 KB Output is correct
24 Correct 105 ms 6740 KB Output is correct
25 Incorrect 69 ms 6524 KB Output isn't correct
26 Incorrect 72 ms 6552 KB Output isn't correct
27 Correct 56 ms 6836 KB Output is correct
28 Incorrect 67 ms 7024 KB Output isn't correct
29 Incorrect 64 ms 6964 KB Output isn't correct
30 Incorrect 80 ms 7180 KB Output isn't correct
31 Correct 21 ms 6444 KB Output is correct
32 Incorrect 75 ms 6972 KB Output isn't correct
33 Correct 56 ms 5568 KB Output is correct
34 Correct 104 ms 6964 KB Output is correct
35 Correct 75 ms 6448 KB Output is correct
36 Correct 95 ms 7036 KB Output is correct
37 Correct 81 ms 7108 KB Output is correct
38 Correct 79 ms 7136 KB Output is correct
39 Incorrect 54 ms 5800 KB Output isn't correct
40 Correct 40 ms 4884 KB Output is correct
41 Incorrect 70 ms 6980 KB Output isn't correct
42 Correct 80 ms 6892 KB Output is correct
43 Correct 64 ms 6284 KB Output is correct
44 Incorrect 79 ms 7148 KB Output isn't correct
45 Incorrect 66 ms 6288 KB Output isn't correct
46 Incorrect 62 ms 6224 KB Output isn't correct
47 Incorrect 68 ms 6380 KB Output isn't correct
48 Correct 45 ms 4932 KB Output is correct
49 Correct 57 ms 5284 KB Output is correct
50 Correct 79 ms 7108 KB Output is correct
51 Correct 67 ms 6132 KB Output is correct
52 Correct 66 ms 7004 KB Output is correct
53 Correct 70 ms 6344 KB Output is correct
54 Correct 79 ms 7056 KB Output is correct
55 Correct 104 ms 6968 KB Output is correct
56 Incorrect 108 ms 7144 KB Output isn't correct
57 Correct 69 ms 6212 KB Output is correct
58 Correct 63 ms 6212 KB Output is correct
59 Correct 66 ms 6920 KB Output is correct
60 Incorrect 78 ms 7052 KB Output isn't correct
61 Correct 20 ms 4068 KB Output is correct
62 Correct 73 ms 6712 KB Output is correct
63 Incorrect 67 ms 6240 KB Output isn't correct
64 Correct 71 ms 6968 KB Output is correct
65 Correct 53 ms 6784 KB Output is correct
66 Correct 106 ms 6620 KB Output is correct
67 Correct 66 ms 6900 KB Output is correct
68 Correct 81 ms 6980 KB Output is correct
69 Incorrect 64 ms 6284 KB Output isn't correct
70 Correct 100 ms 6616 KB Output is correct
71 Incorrect 60 ms 5868 KB Output isn't correct
72 Correct 56 ms 6724 KB Output is correct
73 Correct 71 ms 7020 KB Output is correct
74 Incorrect 76 ms 7048 KB Output isn't correct
75 Correct 48 ms 5284 KB Output is correct
76 Incorrect 84 ms 7108 KB Output isn't correct
77 Incorrect 92 ms 6660 KB Output isn't correct
78 Correct 68 ms 6468 KB Output is correct
79 Correct 78 ms 7136 KB Output is correct
80 Correct 60 ms 6860 KB Output is correct
81 Correct 92 ms 7148 KB Output is correct
82 Correct 52 ms 6776 KB Output is correct
83 Correct 67 ms 6936 KB Output is correct
84 Correct 57 ms 5688 KB Output is correct
85 Correct 51 ms 6720 KB Output is correct
86 Correct 40 ms 6596 KB Output is correct
87 Correct 68 ms 7032 KB Output is correct
88 Incorrect 73 ms 6540 KB Output isn't correct
89 Correct 87 ms 6980 KB Output is correct
90 Correct 100 ms 6616 KB Output is correct
91 Correct 57 ms 5720 KB Output is correct
92 Incorrect 65 ms 6924 KB Output isn't correct
93 Correct 55 ms 6796 KB Output is correct
94 Incorrect 66 ms 6980 KB Output isn't correct
95 Correct 81 ms 7172 KB Output is correct
96 Correct 44 ms 5300 KB Output is correct
97 Correct 65 ms 6988 KB Output is correct
98 Correct 71 ms 7012 KB Output is correct
99 Incorrect 94 ms 6392 KB Output isn't correct
100 Correct 52 ms 6852 KB Output is correct
101 Correct 72 ms 6640 KB Output is correct
102 Correct 76 ms 7004 KB Output is correct