답안 #765351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
765351	2023-06-24T11:19:23 Z	kekw_orz	미술 수업 (IOI13_artclass)	C++14	71 / 100	66 ms	12464 KB

artclass

#include "artclass.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;

#define X		first
#define Y		second
#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

const ll MAXN = 500;
const ld GRTRFACTOR = 0.6;
const ld difflim = 250;

int n, m, A[MAXN][MAXN][3];
vector<pll> adj[MAXN][MAXN];

inline ld dist(int a, int b, int x, int y) {
	ld ans = 0;
	for (int i = 0; i < 3; i++)
		ans += pow(abs(A[a][b][i] - A[x][y][i]), 1);
	
	return ans;
}

inline int wow() {
	int ans = 0;
	for (int i = 0; i < n / 20; i++) {
		for (int j = 0; j < m / 20; j++) {
			bool flag = true;
			for (int a = 0; a < 20; a++) {
				for (int b = 0; b < 20; b++) {
					if (dist(i, j, i + a, j + b) > difflim)
						flag = false;
				}
			}

			ans += flag;
		}
	}

	return ans;
}

int lim;
double test = 0.6;

inline int horz_khat() {
	int fans = 0;
	for (int i = lim; i < n; i++) {
		int ans = 0;
		for (int j = 0; j < m; j++)
			if (dist(i, j, i - lim, j) > difflim)
				ans++;
		
		if (ans > test * m) fans++;
	}

	return fans;	
}

inline int vert_khat() {
	int fans = 0;
	for (int i = lim; i < m; i++) {
		int ans = 0;
		for (int j = 0; j < n; j++)
			if (dist(j, i, j, i - lim) > difflim)
				ans++;
		
		if (ans > test * n) fans++;
	}
	
	return fans;
}

inline ld green_sum() {
	ld s = 0, ts = 0;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			s = s + A[i][j][1], ts = ts + A[i][j][0] + A[i][j][1] + A[i][j][2];

	s /= ts;
	return s;
}

int style(int H_, int W_, int R_[500][500], int G_[500][500], int B_[500][500]) {
	n = H_;
	m = W_;	
	lim = (n + m) / 40;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			A[i][j][0] = R_[i][j], A[i][j][1] = G_[i][j], A[i][j][2] = B_[i][j];

	if (vert_khat() > 10 && vert_khat() > 10) return 1;		
	if (max(vert_khat(), horz_khat()) > 2 && min(vert_khat(), horz_khat()) < 2) return 4;
	if (green_sum() > 0.32 && wow() > 5) return 2;
	if (wow() < 20) return 3;
	return 4;
}

Subtask #1

71.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	39 ms	11964 KB	Output is correct
2	Correct	52 ms	12316 KB	Output is correct
3	Correct	49 ms	12464 KB	Output is correct
4	Correct	45 ms	10748 KB	Output is correct
5	Correct	39 ms	10372 KB	Output is correct
6	Correct	41 ms	12368 KB	Output is correct
7	Correct	30 ms	11948 KB	Output is correct
8	Correct	45 ms	12420 KB	Output is correct
9	Correct	39 ms	11980 KB	Output is correct
10	Correct	44 ms	11740 KB	Output is correct
11	Correct	28 ms	9068 KB	Output is correct
12	Correct	22 ms	8464 KB	Output is correct
13	Correct	41 ms	11112 KB	Output is correct
14	Correct	39 ms	10684 KB	Output is correct
15	Correct	37 ms	11980 KB	Output is correct
16	Correct	44 ms	11980 KB	Output is correct
17	Correct	34 ms	12028 KB	Output is correct
18	Incorrect	49 ms	12144 KB	Output isn't correct
19	Correct	23 ms	8576 KB	Output is correct
20	Incorrect	26 ms	12128 KB	Output isn't correct
21	Correct	40 ms	11604 KB	Output is correct
22	Correct	44 ms	11852 KB	Output is correct
23	Incorrect	16 ms	11916 KB	Output isn't correct
24	Incorrect	32 ms	11936 KB	Output isn't correct
25	Correct	42 ms	12196 KB	Output is correct
26	Incorrect	32 ms	11988 KB	Output isn't correct
27	Correct	43 ms	12460 KB	Output is correct
28	Incorrect	32 ms	11976 KB	Output isn't correct
29	Correct	52 ms	12136 KB	Output is correct
30	Correct	52 ms	12172 KB	Output is correct
31	Incorrect	48 ms	12160 KB	Output isn't correct
32	Incorrect	42 ms	11936 KB	Output isn't correct
33	Incorrect	44 ms	11312 KB	Output isn't correct
34	Correct	42 ms	11984 KB	Output is correct
35	Correct	32 ms	9800 KB	Output is correct
36	Correct	41 ms	11000 KB	Output is correct
37	Incorrect	50 ms	12148 KB	Output isn't correct
38	Incorrect	31 ms	9516 KB	Output isn't correct
39	Correct	41 ms	11972 KB	Output is correct
40	Correct	38 ms	10692 KB	Output is correct
41	Correct	40 ms	11984 KB	Output is correct
42	Incorrect	54 ms	12020 KB	Output isn't correct
43	Incorrect	41 ms	10936 KB	Output isn't correct
44	Incorrect	34 ms	12384 KB	Output isn't correct
45	Correct	48 ms	12140 KB	Output is correct
46	Correct	48 ms	12344 KB	Output is correct
47	Correct	41 ms	11240 KB	Output is correct
48	Incorrect	45 ms	11940 KB	Output isn't correct
49	Correct	32 ms	11988 KB	Output is correct
50	Correct	39 ms	10932 KB	Output is correct
51	Correct	55 ms	10812 KB	Output is correct
52	Correct	50 ms	12020 KB	Output is correct
53	Correct	27 ms	9152 KB	Output is correct
54	Incorrect	41 ms	11980 KB	Output isn't correct
55	Correct	41 ms	11224 KB	Output is correct
56	Correct	27 ms	9224 KB	Output is correct
57	Correct	66 ms	12112 KB	Output is correct
58	Correct	35 ms	11988 KB	Output is correct
59	Correct	27 ms	9156 KB	Output is correct
60	Correct	42 ms	10772 KB	Output is correct
61	Incorrect	40 ms	10744 KB	Output isn't correct
62	Correct	51 ms	11264 KB	Output is correct
63	Correct	41 ms	11980 KB	Output is correct
64	Correct	48 ms	9744 KB	Output is correct
65	Correct	43 ms	12224 KB	Output is correct
66	Correct	40 ms	12320 KB	Output is correct
67	Correct	47 ms	10444 KB	Output is correct
68	Correct	34 ms	9708 KB	Output is correct
69	Correct	39 ms	10788 KB	Output is correct
70	Correct	36 ms	12300 KB	Output is correct
71	Correct	45 ms	11220 KB	Output is correct
72	Correct	47 ms	12028 KB	Output is correct
73	Incorrect	44 ms	12232 KB	Output isn't correct
74	Correct	37 ms	10340 KB	Output is correct
75	Correct	35 ms	11976 KB	Output is correct
76	Correct	41 ms	11988 KB	Output is correct
77	Correct	55 ms	11028 KB	Output is correct
78	Correct	32 ms	11932 KB	Output is correct
79	Correct	42 ms	11228 KB	Output is correct
80	Correct	41 ms	11948 KB	Output is correct
81	Correct	47 ms	12248 KB	Output is correct
82	Correct	43 ms	11528 KB	Output is correct
83	Correct	28 ms	12012 KB	Output is correct
84	Correct	12 ms	7252 KB	Output is correct
85	Correct	64 ms	12240 KB	Output is correct
86	Correct	65 ms	11468 KB	Output is correct
87	Incorrect	49 ms	11912 KB	Output isn't correct
88	Correct	52 ms	12020 KB	Output is correct
89	Correct	41 ms	11008 KB	Output is correct
90	Correct	46 ms	12256 KB	Output is correct
91	Correct	46 ms	11596 KB	Output is correct
92	Correct	41 ms	10936 KB	Output is correct
93	Incorrect	22 ms	8564 KB	Output isn't correct
94	Incorrect	36 ms	12380 KB	Output isn't correct
95	Correct	44 ms	11980 KB	Output is correct
96	Correct	32 ms	9868 KB	Output is correct
97	Incorrect	48 ms	11952 KB	Output isn't correct
98	Incorrect	49 ms	12168 KB	Output isn't correct
99	Correct	36 ms	11992 KB	Output is correct
100	Correct	40 ms	12120 KB	Output is correct
101	Correct	40 ms	11196 KB	Output is correct
102	Correct	37 ms	10316 KB	Output is correct