oj.uz

Submission #17176

# Submission time Handle Problem Language Result Execution time Memory
17176 2015-11-07T17:34:33 Z erdemkiraz Art Class (IOI13_artclass) C++
100 / 100
 458 ms 21116 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) {
	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(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, 20, 40, 40);
			road(i, j, i + 1, j, 20, 40, 40);
		}
	}

	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("%d\n", (int) cntr.size());

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

	return 3;
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:91:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(bigs > 2 and bigs * 1200 >= cntr.size())
                  ~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 21116 KB Output is correct
2 Correct 381 ms 20968 KB Output is correct
3 Correct 209 ms 20968 KB Output is correct
4 Correct 270 ms 20968 KB Output is correct
5 Correct 127 ms 11428 KB Output is correct
6 Correct 224 ms 21116 KB Output is correct
7 Correct 428 ms 21116 KB Output is correct
8 Incorrect 386 ms 20968 KB Output isn't correct
9 Correct 273 ms 20968 KB Output is correct
10 Correct 155 ms 18020 KB Output is correct
11 Correct 272 ms 20968 KB Output is correct
12 Correct 202 ms 21116 KB Output is correct
13 Correct 362 ms 20968 KB Output is correct
14 Correct 255 ms 20504 KB Output is correct
15 Correct 458 ms 20968 KB Output is correct
16 Correct 332 ms 20968 KB Output is correct
17 Incorrect 383 ms 21116 KB Output isn't correct
18 Correct 263 ms 20968 KB Output is correct
19 Correct 330 ms 20968 KB Output is correct
20 Correct 359 ms 20968 KB Output is correct
21 Correct 158 ms 21116 KB Output is correct
22 Correct 279 ms 20968 KB Output is correct
23 Correct 277 ms 20968 KB Output is correct
24 Correct 237 ms 20968 KB Output is correct
25 Correct 291 ms 20968 KB Output is correct
26 Correct 258 ms 20504 KB Output is correct
27 Incorrect 221 ms 20968 KB Output isn't correct
28 Correct 173 ms 18020 KB Output is correct
29 Correct 178 ms 21116 KB Output is correct
30 Incorrect 344 ms 21116 KB Output isn't correct
31 Correct 392 ms 21116 KB Output is correct
32 Correct 353 ms 21116 KB Output is correct
33 Correct 340 ms 20968 KB Output is correct
34 Correct 217 ms 20968 KB Output is correct
35 Correct 317 ms 20968 KB Output is correct
36 Correct 179 ms 21116 KB Output is correct
37 Incorrect 282 ms 21116 KB Output isn't correct
38 Correct 187 ms 20968 KB Output is correct
39 Correct 346 ms 20968 KB Output is correct
40 Incorrect 84 ms 21116 KB Output isn't correct
41 Correct 167 ms 21116 KB Output is correct
42 Correct 243 ms 21116 KB Output is correct
43 Correct 191 ms 21116 KB Output is correct
44 Correct 182 ms 21116 KB Output is correct
45 Correct 139 ms 21116 KB Output is correct
46 Correct 299 ms 20968 KB Output is correct
47 Correct 392 ms 21116 KB Output is correct
48 Correct 155 ms 21116 KB Output is correct
49 Correct 206 ms 21116 KB Output is correct
50 Correct 354 ms 21116 KB Output is correct
51 Correct 309 ms 20968 KB Output is correct
52 Correct 264 ms 20968 KB Output is correct
53 Correct 172 ms 21116 KB Output is correct
54 Correct 353 ms 21116 KB Output is correct
55 Correct 354 ms 21116 KB Output is correct
56 Correct 389 ms 21116 KB Output is correct
57 Correct 131 ms 21116 KB Output is correct
58 Correct 190 ms 20968 KB Output is correct
59 Correct 101 ms 21116 KB Output is correct
60 Correct 431 ms 20968 KB Output is correct
61 Correct 241 ms 19684 KB Output is correct
62 Correct 247 ms 19684 KB Output is correct
63 Correct 213 ms 20968 KB Output is correct
64 Correct 289 ms 20968 KB Output is correct
65 Correct 227 ms 21116 KB Output is correct
66 Correct 299 ms 20968 KB Output is correct
67 Correct 119 ms 21116 KB Output is correct
68 Correct 329 ms 20968 KB Output is correct
69 Correct 243 ms 20968 KB Output is correct
70 Correct 327 ms 20968 KB Output is correct
71 Correct 245 ms 20968 KB Output is correct
72 Correct 351 ms 21116 KB Output is correct
73 Correct 307 ms 21116 KB Output is correct
74 Correct 323 ms 20968 KB Output is correct
75 Correct 195 ms 21116 KB Output is correct
76 Correct 259 ms 21116 KB Output is correct
77 Correct 205 ms 20968 KB Output is correct
78 Correct 295 ms 20968 KB Output is correct
79 Correct 218 ms 21116 KB Output is correct
80 Incorrect 305 ms 21116 KB Output isn't correct
81 Correct 413 ms 20968 KB Output is correct
82 Correct 264 ms 20052 KB Output is correct
83 Correct 332 ms 20968 KB Output is correct
84 Correct 221 ms 21116 KB Output is correct
85 Correct 322 ms 20968 KB Output is correct
86 Correct 321 ms 21116 KB Output is correct
87 Correct 225 ms 20968 KB Output is correct
88 Correct 196 ms 21116 KB Output is correct
89 Correct 260 ms 20968 KB Output is correct
90 Correct 167 ms 20968 KB Output is correct
91 Correct 187 ms 20968 KB Output is correct
92 Correct 430 ms 21116 KB Output is correct
93 Correct 183 ms 20504 KB Output is correct
94 Correct 362 ms 21116 KB Output is correct
95 Correct 273 ms 20968 KB Output is correct
96 Correct 274 ms 20968 KB Output is correct
97 Correct 249 ms 20968 KB Output is correct
98 Correct 53 ms 21116 KB Output is correct
99 Correct 266 ms 20968 KB Output is correct
100 Incorrect 372 ms 20968 KB Output isn't correct
101 Correct 292 ms 20968 KB Output is correct
102 Correct 331 ms 20968 KB Output is correct