Submission #411234

# Submission time Handle Problem Language Result Execution time Memory
411234 2021-05-24T18:35:29 Z faresbasbs Art Class (IOI13_artclass) C++14
49 / 100
121 ms 9204 KB
#include <bits/stdc++.h>
#include "artclass.h"
using namespace std;

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
	long long sum = 0 , diff = 0 , sum1 = 0 , sum2 = 0 , sum3 = 0 , mx = 0 , mn = 100000000 , p = 0 , p2 = 0;
	long long med1 , med2 , med3;
	vector<long long> all1,all2,all3;
	for(int i = 0 ; i < H ; i += 1){
		for(int j = 0 ; j < W ; j += 1){
			long long f = R[i][j]+G[i][j]+B[i][j];
			mn = min(mn,f);
			mx = max(mx,f);
			sum1 += R[i][j];
			sum2 += G[i][j];
			sum3 += B[i][j];
			all1.push_back(R[i][j]),all2.push_back(G[i][j]),all3.push_back(B[i][j]);
			if(f >= 600){
				p += 1;
			}
			if(f <= 100){
				p2 += 1;
			}
		}
	}
	sort(all1.begin(),all1.end()),sort(all2.begin(),all2.end()),sort(all3.begin(),all3.end());
	med1 = all1[all1.size()/2] , med2 = all2[all2.size()/2] , med3 = all3[all3.size()/2];
	long long mdv = max({med1,med2,med3})-min({med1,med2,med3});
	for(int i = 0 ; i < H ; i += 1){
		for(int j = 0 ; j < W ; j += 1){
			long long f = R[i][j]+G[i][j]+B[i][j];
			mn = min(mn,f);
			mx = max(mx,f);
			if(f >= mx-100){
				p += 1;
			}
			if(f <= mn+100){
				p2 += 1;
			}
		}
	}
	sum = sum1+sum2+sum3 , diff = max({sum1,sum2,sum3})-min({sum1,sum2,sum3});
	// cout << sum1 << " " << sum2 << " " << sum3 << endl;
	// cout << " - " << (sum+diff)/2 << endl;
	// cout << mn << " " << mx << " " << p << " " << p2 << endl;
	int cnt[5];
	memset(cnt,0,sizeof cnt);
	if(sum >= 100000000){
		cnt[1] += 1;
	}
	if(sum2 >= 40000000){
		cnt[1] += 1;
	}
	if(sum1 >= 40000000){
		cnt[1] += 1;
	}
	if(med3 < 190){
		cnt[2] += 1 , cnt[3] += 1 , cnt[4] += 1;
	}
	if(p >= 150000){
		cnt[1] += 1;
	}
	if(mx-mn <= 600){
		cnt[4] += 1;
	}
	if(mn >= 40){
		cnt[4] += 1;
	}
	if(diff >= 5000000 && diff <= 15000000){
		cnt[2] += 1;
	}
	if(diff <= 5000000){
		cnt[3] += 1;
	}
	long long maxi = max({cnt[1],cnt[2],cnt[3],cnt[4]});
	// cout << maxi << " " << cnt[4] << endl;
	for(int i = 4 ; i >= 1 ; i -= 1){
		if(cnt[i] == maxi){
			return i;
		}
	}
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:28:12: warning: unused variable 'mdv' [-Wunused-variable]
   28 |  long long mdv = max({med1,med2,med3})-min({med1,med2,med3});
      |            ^~~
artclass.cpp:8:20: warning: control reaches end of non-void function [-Wreturn-type]
    8 |  vector<long long> all1,all2,all3;
      |                    ^~~~
# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 7316 KB Output isn't correct
2 Correct 61 ms 7468 KB Output is correct
3 Correct 81 ms 8424 KB Output is correct
4 Correct 86 ms 7708 KB Output is correct
5 Correct 81 ms 8240 KB Output is correct
6 Incorrect 81 ms 7036 KB Output isn't correct
7 Incorrect 83 ms 7840 KB Output isn't correct
8 Correct 66 ms 6340 KB Output is correct
9 Correct 60 ms 7468 KB Output is correct
10 Incorrect 55 ms 6064 KB Output isn't correct
11 Correct 80 ms 6904 KB Output is correct
12 Correct 68 ms 7444 KB Output is correct
13 Incorrect 90 ms 9184 KB Output isn't correct
14 Correct 108 ms 8140 KB Output is correct
15 Correct 86 ms 8748 KB Output is correct
16 Incorrect 67 ms 7396 KB Output isn't correct
17 Correct 82 ms 7328 KB Output is correct
18 Correct 84 ms 7668 KB Output is correct
19 Incorrect 87 ms 8096 KB Output isn't correct
20 Correct 89 ms 8116 KB Output is correct
21 Correct 80 ms 7072 KB Output is correct
22 Correct 98 ms 6960 KB Output is correct
23 Correct 80 ms 7564 KB Output is correct
24 Correct 102 ms 9152 KB Output is correct
25 Correct 46 ms 4148 KB Output is correct
26 Correct 85 ms 8608 KB Output is correct
27 Incorrect 87 ms 8224 KB Output isn't correct
28 Correct 99 ms 9172 KB Output is correct
29 Correct 93 ms 8608 KB Output is correct
30 Correct 95 ms 8144 KB Output is correct
31 Correct 68 ms 6448 KB Output is correct
32 Incorrect 80 ms 8136 KB Output isn't correct
33 Incorrect 84 ms 8480 KB Output isn't correct
34 Incorrect 85 ms 7480 KB Output isn't correct
35 Incorrect 77 ms 7088 KB Output isn't correct
36 Correct 100 ms 9204 KB Output is correct
37 Correct 108 ms 8040 KB Output is correct
38 Incorrect 88 ms 8156 KB Output isn't correct
39 Incorrect 84 ms 7840 KB Output isn't correct
40 Correct 85 ms 7712 KB Output is correct
41 Correct 104 ms 7976 KB Output is correct
42 Incorrect 104 ms 9160 KB Output isn't correct
43 Correct 121 ms 9124 KB Output is correct
44 Incorrect 70 ms 7396 KB Output isn't correct
45 Correct 95 ms 9116 KB Output is correct
46 Incorrect 70 ms 6492 KB Output isn't correct
47 Incorrect 98 ms 9116 KB Output isn't correct
48 Correct 83 ms 7144 KB Output is correct
49 Incorrect 54 ms 4908 KB Output isn't correct
50 Correct 80 ms 8012 KB Output is correct
51 Correct 67 ms 6424 KB Output is correct
52 Incorrect 65 ms 6328 KB Output isn't correct
53 Correct 84 ms 7456 KB Output is correct
54 Incorrect 93 ms 8784 KB Output isn't correct
55 Correct 61 ms 4904 KB Output is correct
56 Correct 59 ms 3984 KB Output is correct
57 Correct 79 ms 7448 KB Output is correct
58 Correct 84 ms 7424 KB Output is correct
59 Correct 86 ms 7800 KB Output is correct
60 Correct 86 ms 8228 KB Output is correct
61 Correct 54 ms 4780 KB Output is correct
62 Correct 47 ms 6112 KB Output is correct
63 Correct 84 ms 7712 KB Output is correct
64 Incorrect 56 ms 7384 KB Output isn't correct
65 Correct 82 ms 8084 KB Output is correct
66 Correct 88 ms 7968 KB Output is correct
67 Incorrect 77 ms 7100 KB Output isn't correct
68 Incorrect 82 ms 7796 KB Output isn't correct
69 Correct 66 ms 7420 KB Output is correct
70 Correct 80 ms 8276 KB Output is correct
71 Incorrect 98 ms 8108 KB Output isn't correct
72 Incorrect 90 ms 7816 KB Output isn't correct
73 Correct 90 ms 8360 KB Output is correct
74 Correct 85 ms 7468 KB Output is correct
75 Correct 84 ms 7620 KB Output is correct
76 Correct 54 ms 4912 KB Output is correct
77 Correct 78 ms 6944 KB Output is correct
78 Incorrect 103 ms 9072 KB Output isn't correct
79 Correct 64 ms 7404 KB Output is correct
80 Correct 80 ms 8172 KB Output is correct
81 Correct 77 ms 7372 KB Output is correct
82 Incorrect 93 ms 7580 KB Output isn't correct
83 Correct 102 ms 9160 KB Output is correct
84 Incorrect 98 ms 9180 KB Output isn't correct
85 Correct 77 ms 7840 KB Output is correct
86 Incorrect 78 ms 7968 KB Output isn't correct
87 Correct 97 ms 9048 KB Output is correct
88 Incorrect 72 ms 7456 KB Output isn't correct
89 Correct 78 ms 6792 KB Output is correct
90 Correct 63 ms 7396 KB Output is correct
91 Correct 92 ms 8864 KB Output is correct
92 Correct 108 ms 8056 KB Output is correct
93 Correct 43 ms 3884 KB Output is correct
94 Correct 103 ms 8084 KB Output is correct
95 Correct 81 ms 8096 KB Output is correct
96 Incorrect 63 ms 7456 KB Output isn't correct
97 Correct 22 ms 2116 KB Output is correct
98 Correct 105 ms 9136 KB Output is correct
99 Correct 82 ms 7200 KB Output is correct
100 Correct 74 ms 8000 KB Output is correct
101 Incorrect 82 ms 7484 KB Output isn't correct
102 Correct 23 ms 4752 KB Output is correct