Submission #411231

# Submission time Handle Problem Language Result Execution time Memory
411231 2021-05-24T18:22:34 Z faresbasbs Art Class (IOI13_artclass) C++14
47 / 100
112 ms 9268 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(mdv > 80){
		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: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 87 ms 7856 KB Output isn't correct
2 Correct 65 ms 7468 KB Output is correct
3 Correct 82 ms 8076 KB Output is correct
4 Correct 54 ms 4908 KB Output is correct
5 Correct 67 ms 6316 KB Output is correct
6 Correct 82 ms 7176 KB Output is correct
7 Correct 57 ms 7468 KB Output is correct
8 Correct 99 ms 9100 KB Output is correct
9 Incorrect 98 ms 9248 KB Output isn't correct
10 Correct 77 ms 6764 KB Output is correct
11 Correct 80 ms 8064 KB Output is correct
12 Incorrect 87 ms 8612 KB Output isn't correct
13 Correct 90 ms 8792 KB Output is correct
14 Incorrect 85 ms 7460 KB Output isn't correct
15 Incorrect 77 ms 7212 KB Output isn't correct
16 Correct 93 ms 9076 KB Output is correct
17 Incorrect 91 ms 7836 KB Output isn't correct
18 Correct 70 ms 7480 KB Output is correct
19 Incorrect 89 ms 8276 KB Output isn't correct
20 Incorrect 98 ms 9200 KB Output isn't correct
21 Correct 78 ms 6968 KB Output is correct
22 Incorrect 99 ms 9116 KB Output isn't correct
23 Correct 74 ms 7456 KB Output is correct
24 Correct 92 ms 8616 KB Output is correct
25 Correct 75 ms 7420 KB Output is correct
26 Correct 103 ms 9144 KB Output is correct
27 Correct 82 ms 8284 KB Output is correct
28 Correct 44 ms 3880 KB Output is correct
29 Incorrect 72 ms 7412 KB Output isn't correct
30 Correct 63 ms 7496 KB Output is correct
31 Incorrect 85 ms 8200 KB Output isn't correct
32 Correct 87 ms 8032 KB Output is correct
33 Incorrect 85 ms 8096 KB Output isn't correct
34 Incorrect 82 ms 7548 KB Output isn't correct
35 Correct 92 ms 8196 KB Output is correct
36 Incorrect 94 ms 9204 KB Output isn't correct
37 Correct 78 ms 7008 KB Output is correct
38 Correct 79 ms 8060 KB Output is correct
39 Correct 72 ms 8040 KB Output is correct
40 Correct 79 ms 7200 KB Output is correct
41 Incorrect 93 ms 8676 KB Output isn't correct
42 Correct 86 ms 8104 KB Output is correct
43 Correct 68 ms 6296 KB Output is correct
44 Correct 82 ms 8108 KB Output is correct
45 Correct 80 ms 7260 KB Output is correct
46 Correct 89 ms 8256 KB Output is correct
47 Correct 22 ms 2156 KB Output is correct
48 Correct 83 ms 7664 KB Output is correct
49 Incorrect 70 ms 6392 KB Output isn't correct
50 Correct 109 ms 8864 KB Output is correct
51 Incorrect 56 ms 7416 KB Output isn't correct
52 Correct 80 ms 7292 KB Output is correct
53 Correct 59 ms 7380 KB Output is correct
54 Correct 65 ms 6448 KB Output is correct
55 Correct 101 ms 9268 KB Output is correct
56 Correct 81 ms 8176 KB Output is correct
57 Correct 70 ms 7460 KB Output is correct
58 Incorrect 85 ms 7012 KB Output isn't correct
59 Incorrect 70 ms 6084 KB Output isn't correct
60 Correct 80 ms 8116 KB Output is correct
61 Incorrect 70 ms 7460 KB Output isn't correct
62 Incorrect 64 ms 7404 KB Output isn't correct
63 Correct 67 ms 7468 KB Output is correct
64 Correct 72 ms 7464 KB Output is correct
65 Incorrect 88 ms 8120 KB Output isn't correct
66 Incorrect 89 ms 8176 KB Output isn't correct
67 Incorrect 76 ms 7468 KB Output isn't correct
68 Correct 86 ms 7376 KB Output is correct
69 Correct 98 ms 9040 KB Output is correct
70 Correct 23 ms 4672 KB Output is correct
71 Correct 108 ms 7756 KB Output is correct
72 Correct 65 ms 4920 KB Output is correct
73 Correct 91 ms 7408 KB Output is correct
74 Correct 80 ms 8404 KB Output is correct
75 Incorrect 97 ms 7840 KB Output isn't correct
76 Incorrect 53 ms 4912 KB Output isn't correct
77 Correct 46 ms 6200 KB Output is correct
78 Incorrect 61 ms 7416 KB Output isn't correct
79 Correct 87 ms 7672 KB Output is correct
80 Incorrect 79 ms 7932 KB Output isn't correct
81 Correct 82 ms 8076 KB Output is correct
82 Correct 112 ms 7980 KB Output is correct
83 Correct 77 ms 7844 KB Output is correct
84 Correct 87 ms 7888 KB Output is correct
85 Correct 53 ms 4872 KB Output is correct
86 Correct 77 ms 6860 KB Output is correct
87 Correct 44 ms 4020 KB Output is correct
88 Incorrect 65 ms 6316 KB Output isn't correct
89 Correct 87 ms 8648 KB Output is correct
90 Correct 96 ms 9144 KB Output is correct
91 Correct 85 ms 7776 KB Output is correct
92 Correct 97 ms 9020 KB Output is correct
93 Correct 85 ms 7728 KB Output is correct
94 Correct 46 ms 4124 KB Output is correct
95 Correct 105 ms 8456 KB Output is correct
96 Incorrect 85 ms 8068 KB Output isn't correct
97 Incorrect 84 ms 7880 KB Output isn't correct
98 Incorrect 104 ms 9120 KB Output isn't correct
99 Incorrect 76 ms 7096 KB Output isn't correct
100 Correct 87 ms 7720 KB Output is correct
101 Correct 97 ms 9052 KB Output is correct
102 Incorrect 85 ms 7240 KB Output isn't correct