Submission #17202

# Submission time Handle Problem Language Result Execution time Memory
17202 2015-11-07T19:02:44 Z erdemkiraz Art Class (IOI13_artclass) C++
100 / 100
448 ms 21228 KB
#include "artclass.h"
#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

const int N = 500;

int n, m, r[N][N], g[N][N], b[N][N];
ii root[N][N];

ii f(int x, int y) {
	if(root[x][y] == ii(0, 0) or root[x][y] == ii(x, y))
		return ii(x, y);
	return root[x][y] = f(root[x][y].first, root[x][y].second);
}

void road(int x1, int y1, int x2, int y2, int A, int B, int C, int x = 0) {
	bool flag = 0;
	if(x2 < n and y2 < m) {
		flag = 1;
		flag &= abs(r[x1][y1] - r[x2][y2]) <= A;
		flag &= abs(g[x1][y1] - g[x2][y2]) <= B;
		flag &= abs(b[x1][y1] - b[x2][y2]) <= C;
		if(x) {
			flag &= g[x1][y1] >= r[x2][y2] - x;
			flag &= g[x1][y1] >= b[x2][y2] - x;
		}
	}
	if(flag) {
		int X1 = f(x1, y1).first;
		int Y1 = f(x1, y1).second;
		int X2 = f(x2, y2).first;
		int Y2 = f(x2, y2).second;
		root[X1][Y1] = ii(X2, Y2);
	}
}

bool h[N][N];

int style(int n, int m, int R[500][500], int G[500][500], int B[500][500]) {
	:: n = n;
	:: m = m;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			r[i][j] = R[i][j];
			g[i][j] = G[i][j];
			b[i][j] = B[i][j];
		}
	}
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			road(i, j, i, j + 1, 20, 20, 20);
			road(i, j, i + 1, j, 20, 20, 20);
		}
	}
	set < ii > cntr;
	multiset < ii > cntrMul;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			cntr.insert(f(i, j));
			cntrMul.insert(f(i, j));
		}
	}
	//printf("cntr.size() %d\n", (int) cntr.size());
	if(cntr.size() <= 50)
		return 4;
	int bigs = 0;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			int x = f(i, j).first;
			int y = f(i, j).second;
			if(!h[x][y]) {
				h[x][y] = 1;
				if(cntrMul.count(ii(x, y)) >= 1000) {
					bigs++;
				}
			}
		}
	}
	if(bigs < 4 and cntr.size() <= 100)
		return 4;
	//printf("n = %d m = %d\n", n, m);
	//printf("bigs = %d\n", bigs);
	//printf("cntr = %d\n", (int) cntr.size());
	if(cntr.size() <= 5000 and bigs >= 5)
		return 1;
	if(bigs > 2 and bigs * 1200 >= cntr.size())
		return 1;

	cntr.clear();
	cntrMul.clear();
	memset(root, 0, sizeof(root));

	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			road(i, j, i, j + 1, 30, 50, 50, 0);
			road(i, j, i + 1, j, 30, 50, 50, 0);
		}
	}

	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			cntr.insert(f(i, j));
			cntrMul.insert(f(i, j));
		}
	}

	memset(h, 0, sizeof(h));

	bigs = 0;

	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			int x = f(i, j).first;
			int y = f(i, j).second;
			if(!h[x][y]) {
				h[x][y] = 1;
				if(cntrMul.count(ii(x, y)) >= 1000) {
					bigs++;
				}
			}
		}
	}

	//printf("bigs = %d\n", bigs);
	//printf("%d\n", (int) cntr.size());

	if(cntr.size() <= 5000)
		return 2;

	return 3;
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:95:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(bigs > 2 and bigs * 1200 >= cntr.size())
                  ~~~~~~~~~~~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 370 ms 21228 KB Output is correct
2 Correct 360 ms 21228 KB Output is correct
3 Correct 335 ms 21228 KB Output is correct
4 Incorrect 295 ms 21228 KB Output isn't correct
5 Correct 267 ms 19644 KB Output is correct
6 Correct 257 ms 20536 KB Output is correct
7 Correct 249 ms 21228 KB Output is correct
8 Correct 178 ms 21228 KB Output is correct
9 Correct 250 ms 21228 KB Output is correct
10 Correct 267 ms 20468 KB Output is correct
11 Correct 223 ms 21228 KB Output is correct
12 Correct 268 ms 21228 KB Output is correct
13 Correct 254 ms 21228 KB Output is correct
14 Correct 165 ms 11384 KB Output is correct
15 Correct 448 ms 21228 KB Output is correct
16 Correct 299 ms 21228 KB Output is correct
17 Correct 382 ms 21228 KB Output is correct
18 Correct 327 ms 21228 KB Output is correct
19 Correct 335 ms 21228 KB Output is correct
20 Incorrect 340 ms 21228 KB Output isn't correct
21 Correct 156 ms 21228 KB Output is correct
22 Correct 223 ms 21228 KB Output is correct
23 Correct 209 ms 21228 KB Output is correct
24 Correct 177 ms 21228 KB Output is correct
25 Correct 265 ms 21228 KB Output is correct
26 Correct 249 ms 21228 KB Output is correct
27 Correct 193 ms 21228 KB Output is correct
28 Correct 187 ms 21228 KB Output is correct
29 Correct 188 ms 21228 KB Output is correct
30 Correct 321 ms 21228 KB Output is correct
31 Correct 274 ms 21228 KB Output is correct
32 Incorrect 316 ms 21228 KB Output isn't correct
33 Correct 244 ms 21228 KB Output is correct
34 Correct 309 ms 21228 KB Output is correct
35 Correct 136 ms 21228 KB Output is correct
36 Correct 221 ms 21228 KB Output is correct
37 Correct 208 ms 21228 KB Output is correct
38 Correct 348 ms 21228 KB Output is correct
39 Incorrect 313 ms 21228 KB Output isn't correct
40 Correct 209 ms 21228 KB Output is correct
41 Correct 125 ms 17920 KB Output is correct
42 Correct 300 ms 21228 KB Output is correct
43 Correct 280 ms 21228 KB Output is correct
44 Correct 133 ms 21228 KB Output is correct
45 Correct 189 ms 21228 KB Output is correct
46 Correct 198 ms 21228 KB Output is correct
47 Correct 398 ms 21228 KB Output is correct
48 Correct 346 ms 21228 KB Output is correct
49 Correct 185 ms 21228 KB Output is correct
50 Correct 201 ms 21228 KB Output is correct
51 Correct 298 ms 21228 KB Output is correct
52 Incorrect 368 ms 21228 KB Output isn't correct
53 Incorrect 201 ms 21228 KB Output isn't correct
54 Correct 215 ms 21228 KB Output is correct
55 Correct 235 ms 21228 KB Output is correct
56 Correct 208 ms 21228 KB Output is correct
57 Correct 364 ms 21228 KB Output is correct
58 Correct 209 ms 20536 KB Output is correct
59 Correct 259 ms 21228 KB Output is correct
60 Correct 346 ms 21228 KB Output is correct
61 Correct 357 ms 21228 KB Output is correct
62 Correct 221 ms 19644 KB Output is correct
63 Correct 184 ms 21228 KB Output is correct
64 Correct 297 ms 21228 KB Output is correct
65 Correct 305 ms 21228 KB Output is correct
66 Correct 360 ms 21228 KB Output is correct
67 Correct 321 ms 21228 KB Output is correct
68 Incorrect 374 ms 21228 KB Output isn't correct
69 Correct 169 ms 21228 KB Output is correct
70 Correct 306 ms 21228 KB Output is correct
71 Correct 298 ms 21228 KB Output is correct
72 Correct 55 ms 21228 KB Output is correct
73 Correct 205 ms 21228 KB Output is correct
74 Correct 327 ms 21228 KB Output is correct
75 Correct 263 ms 21228 KB Output is correct
76 Correct 353 ms 21228 KB Output is correct
77 Correct 335 ms 21228 KB Output is correct
78 Correct 272 ms 21228 KB Output is correct
79 Correct 163 ms 21228 KB Output is correct
80 Correct 239 ms 21228 KB Output is correct
81 Correct 253 ms 21228 KB Output is correct
82 Incorrect 344 ms 21228 KB Output isn't correct
83 Correct 112 ms 21228 KB Output is correct
84 Correct 158 ms 21228 KB Output is correct
85 Correct 401 ms 21228 KB Output is correct
86 Correct 182 ms 17920 KB Output is correct
87 Correct 171 ms 21228 KB Output is correct
88 Correct 156 ms 21228 KB Output is correct
89 Incorrect 87 ms 21228 KB Output isn't correct
90 Correct 313 ms 21228 KB Output is correct
91 Correct 174 ms 21228 KB Output is correct
92 Correct 208 ms 21228 KB Output is correct
93 Correct 411 ms 21228 KB Output is correct
94 Correct 376 ms 21228 KB Output is correct
95 Correct 231 ms 21228 KB Output is correct
96 Correct 226 ms 20108 KB Output is correct
97 Correct 256 ms 21228 KB Output is correct
98 Correct 402 ms 21228 KB Output is correct
99 Correct 327 ms 21228 KB Output is correct
100 Correct 278 ms 21228 KB Output is correct
101 Correct 368 ms 21228 KB Output is correct
102 Correct 190 ms 21228 KB Output is correct