Submission #753793

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
753793	2023-06-06T04:13:18 Z	minhcool	Art Class (IOI13_artclass)	C++17	93 / 100	64 ms	4552 KB

artclass

#include "artclass.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int xx[] = {0, 1, -1, 0};
int yy[] = {1, 0, 0, -1};

bool vis[500][500];

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]){
	int cnt = 0, cnt2 = 0;
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if((i + 1) < H){
				int sum = abs(R[i][j] - R[i + 1][j]) + abs(G[i][j] - G[i + 1][j]) + abs(B[i][j] - B[i + 1][j]);
				if(sum > 80) cnt++;
			}
			if((j + 1) < W){
				int sum = abs(R[i][j] - R[i][j + 1]) + abs(G[i][j] - G[i][j + 1]) + abs(B[i][j] - B[i][j + 1]);
				if(sum > 80) cnt++;
			}
			if(G[i][j] == max({G[i][j], B[i][j], R[i][j]})) cnt2 += 4;
			if(B[i][j] == min({G[i][j], B[i][j], R[i][j]})) cnt2++;
		}
	}	
	if(cnt * 2 > H * W) return 3;
	else if(cnt *  5 <= H * W){
		int comp = 0;
		for(int i = 0; i < H; i++){
			for(int j = 0; j < W; j++){
				if(vis[i][j]) continue;
				comp++;
				queue<ii> q;
				q.push({i, j});
				vis[i][j] = 1;
				while(!q.empty()){
					int x = q.front().fi, y = q.front().se;
					q.pop();
		//			vis[x][y] = 1;
					for(int dir = 0; dir < 4; dir++){
						int tempx = x + xx[dir], tempy = y + yy[dir];
						if(tempx < 0 || tempy < 0 || tempx >= H || tempy >= W) continue;
						if(vis[tempx][tempy]) continue;
						int diff = abs(R[x][y] - R[tempx][tempy]) + abs(G[x][y] - G[tempx][tempy]) + abs(B[x][y] - B[tempx][tempy]);
						if(diff > 50) continue;
						q.push({tempx, tempy});
						vis[tempx][tempy] = 1;
					}
				}
			}
		}
		if(comp <= 100) return 4;
		else if(comp <= 1500) return 1;
else return 2;
	}
	else{
		return 2;
	}
}

Compilation message

artclass.cpp:18:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   18 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1

93.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	3404 KB	Output is correct
2	Correct	28 ms	2784 KB	Output is correct
3	Correct	37 ms	4400 KB	Output is correct
4	Correct	48 ms	4420 KB	Output is correct
5	Correct	36 ms	4384 KB	Output is correct
6	Correct	64 ms	4460 KB	Output is correct
7	Correct	46 ms	3644 KB	Output is correct
8	Correct	52 ms	4428 KB	Output is correct
9	Correct	42 ms	3684 KB	Output is correct
10	Incorrect	53 ms	4440 KB	Output isn't correct
11	Incorrect	35 ms	3056 KB	Output isn't correct
12	Correct	57 ms	3152 KB	Output is correct
13	Correct	55 ms	4400 KB	Output is correct
14	Correct	44 ms	3748 KB	Output is correct
15	Correct	42 ms	4476 KB	Output is correct
16	Correct	22 ms	2468 KB	Output is correct
17	Correct	24 ms	2368 KB	Output is correct
18	Correct	44 ms	3660 KB	Output is correct
19	Correct	47 ms	4456 KB	Output is correct
20	Correct	56 ms	4244 KB	Output is correct
21	Correct	54 ms	4476 KB	Output is correct
22	Correct	39 ms	3184 KB	Output is correct
23	Correct	52 ms	4428 KB	Output is correct
24	Correct	44 ms	3568 KB	Output is correct
25	Correct	48 ms	4408 KB	Output is correct
26	Correct	39 ms	4436 KB	Output is correct
27	Correct	45 ms	3852 KB	Output is correct
28	Correct	46 ms	4400 KB	Output is correct
29	Correct	44 ms	4168 KB	Output is correct
30	Correct	45 ms	3516 KB	Output is correct
31	Correct	33 ms	3048 KB	Output is correct
32	Correct	45 ms	3788 KB	Output is correct
33	Correct	40 ms	3576 KB	Output is correct
34	Incorrect	38 ms	4552 KB	Output isn't correct
35	Correct	33 ms	4172 KB	Output is correct
36	Correct	63 ms	4500 KB	Output is correct
37	Correct	30 ms	4392 KB	Output is correct
38	Correct	52 ms	3840 KB	Output is correct
39	Correct	43 ms	3404 KB	Output is correct
40	Correct	49 ms	3776 KB	Output is correct
41	Correct	47 ms	4400 KB	Output is correct
42	Correct	48 ms	4140 KB	Output is correct
43	Correct	11 ms	1444 KB	Output is correct
44	Correct	51 ms	3876 KB	Output is correct
45	Incorrect	61 ms	4448 KB	Output isn't correct
46	Correct	14 ms	4052 KB	Output is correct
47	Correct	50 ms	4072 KB	Output is correct
48	Correct	33 ms	4172 KB	Output is correct
49	Correct	61 ms	4504 KB	Output is correct
50	Incorrect	61 ms	4428 KB	Output isn't correct
51	Correct	54 ms	4496 KB	Output is correct
52	Correct	54 ms	4384 KB	Output is correct
53	Incorrect	53 ms	4020 KB	Output isn't correct
54	Correct	48 ms	4440 KB	Output is correct
55	Correct	43 ms	4200 KB	Output is correct
56	Correct	42 ms	4424 KB	Output is correct
57	Correct	44 ms	4388 KB	Output is correct
58	Correct	33 ms	3000 KB	Output is correct
59	Correct	47 ms	3804 KB	Output is correct
60	Correct	57 ms	3904 KB	Output is correct
61	Correct	44 ms	4396 KB	Output is correct
62	Correct	54 ms	4432 KB	Output is correct
63	Correct	62 ms	4392 KB	Output is correct
64	Incorrect	60 ms	4420 KB	Output isn't correct
65	Correct	45 ms	3520 KB	Output is correct
66	Correct	44 ms	4188 KB	Output is correct
67	Correct	24 ms	2496 KB	Output is correct
68	Incorrect	49 ms	4396 KB	Output isn't correct
69	Correct	43 ms	4332 KB	Output is correct
70	Correct	42 ms	3388 KB	Output is correct
71	Correct	43 ms	4224 KB	Output is correct
72	Correct	30 ms	2780 KB	Output is correct
73	Correct	31 ms	2748 KB	Output is correct
74	Correct	52 ms	3924 KB	Output is correct
75	Correct	42 ms	3684 KB	Output is correct
76	Correct	46 ms	3756 KB	Output is correct
77	Correct	57 ms	4372 KB	Output is correct
78	Correct	38 ms	4144 KB	Output is correct
79	Correct	49 ms	4468 KB	Output is correct
80	Correct	42 ms	4176 KB	Output is correct
81	Correct	36 ms	4136 KB	Output is correct
82	Incorrect	52 ms	4132 KB	Output isn't correct
83	Incorrect	44 ms	3444 KB	Output isn't correct
84	Incorrect	60 ms	4396 KB	Output isn't correct
85	Correct	34 ms	4412 KB	Output is correct
86	Correct	60 ms	4484 KB	Output is correct
87	Correct	28 ms	2824 KB	Output is correct
88	Correct	51 ms	4504 KB	Output is correct
89	Incorrect	58 ms	4500 KB	Output isn't correct
90	Correct	37 ms	4500 KB	Output is correct
91	Correct	60 ms	4376 KB	Output is correct
92	Correct	48 ms	3836 KB	Output is correct
93	Correct	49 ms	3660 KB	Output is correct
94	Correct	56 ms	4408 KB	Output is correct
95	Incorrect	59 ms	4428 KB	Output isn't correct
96	Correct	45 ms	4232 KB	Output is correct
97	Correct	42 ms	3452 KB	Output is correct
98	Correct	38 ms	4492 KB	Output is correct
99	Correct	58 ms	4400 KB	Output is correct
100	Correct	46 ms	3704 KB	Output is correct
101	Correct	42 ms	3604 KB	Output is correct
102	Correct	48 ms	4492 KB	Output is correct