oj.uz

답안 #651738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651738 2022-10-19T22:59:38 Z Lawliet 미술 수업 (IOI13_artclass) C++17
54 / 100
 64 ms 22208 KB 
#include "artclass.h"
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
 
using namespace std;
 
int l, c;
 
int min_sz_comp;
int min_bigcomp;
int min_bigcomp_group14;
int min_qtd_green;
int min_dif;
int min_colors_sum;
int min_qtd_greencomp;
int min_sz_greencomp;
 
struct pixel{
   int red, green, blue;
   pixel(int r = 0, int g = 0, int b = 0){
       red = r;
       green = g;
       blue = b;
   }
  
   bool operator == (pixel b){
       int red_dif = abs((*this).red - b.red);
       int green_dif = abs((*this).green - b.green);
       int blue_dif = abs((*this).blue - b.blue);
       return (red_dif<=min_dif && green_dif<=min_dif && blue_dif<=min_dif);
   }
  
   bool isGreen(){
       int sum = red + green + blue;
       return ((green>red && green>blue) && sum<min_colors_sum);
   }
};
 
pixel image[510][510];
bool green_image[510][510];
int marc[510][510];
 
int dl[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};
 
int find_comp(int li, int ci){
   int qtd_pixel = 1;
   marc[li][ci] = 1;
   for(int i=0;i<4;i++){
       int vizl = li + dl[i];
       int vizc = ci + dc[i];
       if(vizl<0 || vizl>l-1) continue;
       if(vizc<0 || vizc>c-1) continue;
       if(marc[vizl][vizc] == 1) continue;
       if(image[vizl][vizc] == image[li][ci]) qtd_pixel += find_comp(vizl, vizc);
   }
   return qtd_pixel;
}
 
pair<int, int> find_bigcomp(){
   memset(marc, 0, sizeof(marc));
   int qtd_bigcomp_ = 0;
   int qtd_comp_ = 0;
   for(int i=0;i<l;i++){
       for(int j=0;j<c;j++){
           if(marc[i][j] == 0){
               int sz_comp = find_comp(i, j);
               qtd_comp_++;
               if(sz_comp>min_sz_comp) qtd_bigcomp_++;
           }
       }
   }
   return {qtd_bigcomp_, qtd_comp_};
}
 
int do_green_image(){
   int qtd_green_ = 0;
   for(int i=0;i<l;i++){
       for(int j=0;j<c;j++){
           green_image[i][j] = image[i][j].isGreen();
           qtd_green_ += green_image[i][j];
       }
   }
   return qtd_green_;
}
 
int marc_greencomp(int li, int ci){
   int sz_greencomp = 1;
   marc[li][ci] = 1;
   for(int i=0;i<4;i++){
       int vizl = li + dl[i];
       int vizc = ci + dc[i];
       if(vizl<0 || vizl>l-1) continue;
       if(vizc<0 || vizc>c-1) continue;
       if(marc[vizl][vizc] == 1) continue;
       if(green_image[vizl][vizc]) sz_greencomp += marc_greencomp(vizl, vizc);
   }
   return sz_greencomp;
}
 
int find_greencomp(){
   memset(marc, 0, sizeof(marc));
   int max_sz_greencomp = 0;
   int qtd_greencomp_ = 0;
   for(int i=0;i<l;i++){
       for(int j=0;j<c;j++){
           if(marc[i][j] == 0 && green_image[i][j]){
               max_sz_greencomp = max(max_sz_greencomp, marc_greencomp(i, j));
               qtd_greencomp_++;
           }
       }
   }
   return max_sz_greencomp;
}
 
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
   l = H;
   c = W;
   min_sz_comp = ((l*c)/22);
   min_bigcomp = 1;
   min_bigcomp_group14 = 6;
   //min_qtd_green = ((l*c)/4);
   min_dif = 5;
   min_colors_sum = 300;
   //min_qtd_greencomp = 8;
   min_sz_greencomp = ((l*c)/15);
   for(int i=0;i<l;i++){
       for(int j=0;j<c;j++){
           image[i][j] = pixel(R[i][j], G[i][j], B[i][j]);
       }
   }
   pair<int, int> aux = find_bigcomp();
   int qtd_bigcomp = aux.first;
   int qtd_comp = aux.second;

//    cout << qtd_bigcomp << endl;
 
   if(qtd_bigcomp>min_bigcomp){
        for(int i = 0 ; i < l ; i++)
        {
            for(int j = 0 ; j < c ; j++)
            {
                int sum = R[i][j] + G[i][j] + B[i][j];
                if( sum < 80 )
                    return 1;
            }
        }
        return 4;
   }
  
  
   int qtd_green = do_green_image();
   /*if(qtd_green<min_qtd_green){
       return 3;
   }*/
  
   int max_sz_greencomp = find_greencomp();
   if(max_sz_greencomp>min_sz_greencomp) return 2;
   else return 3;
   /*if(qtd_greencomp<min_qtd_greencomp) return 2;
   else return 3;*/
  
}
 
// int r[500][500], g[500][500], b[500][500];
 
// int main()
// {
//    int n, m;
//    cin >> n >> m;
 
//    for(int i = 0 ; i < n ; i++)
//        for(int j = 0 ; j < m ; j++)
//            cin >> r[i][j] >> g[i][j] >> b[i][j];
 
//    cout << style(n, m, r, g, b) << endl;
// }

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:135:8: warning: unused variable 'qtd_comp' [-Wunused-variable]
  135 |    int qtd_comp = aux.second;
      |        ^~~~~~~~
artclass.cpp:153:8: warning: unused variable 'qtd_green' [-Wunused-variable]
  153 |    int qtd_green = do_green_image();
      |        ^~~~~~~~~

Subtask #1
54.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 39 ms 11212 KB Output isn't correct
2 Correct 44 ms 6608 KB Output is correct
3 Correct 58 ms 9580 KB Output is correct
4 Correct 48 ms 6944 KB Output is correct
5 Incorrect 47 ms 17884 KB Output isn't correct
6 Correct 36 ms 6316 KB Output is correct
7 Correct 52 ms 11948 KB Output is correct
8 Incorrect 50 ms 11080 KB Output isn't correct
9 Correct 42 ms 11952 KB Output is correct
10 Incorrect 53 ms 19604 KB Output isn't correct
11 Correct 36 ms 7912 KB Output is correct
12 Correct 62 ms 12200 KB Output is correct
13 Correct 47 ms 8396 KB Output is correct
14 Incorrect 60 ms 7560 KB Output isn't correct
15 Correct 59 ms 11524 KB Output is correct
16 Correct 47 ms 7628 KB Output is correct
17 Incorrect 39 ms 10980 KB Output isn't correct
18 Incorrect 59 ms 18272 KB Output isn't correct
19 Incorrect 41 ms 6684 KB Output isn't correct
20 Correct 63 ms 11268 KB Output is correct
21 Correct 48 ms 7428 KB Output is correct
22 Incorrect 49 ms 14924 KB Output isn't correct
23 Incorrect 15 ms 9320 KB Output isn't correct
24 Incorrect 50 ms 7160 KB Output isn't correct
25 Correct 50 ms 6980 KB Output is correct
26 Correct 45 ms 7520 KB Output is correct
27 Correct 52 ms 8656 KB Output is correct
28 Correct 30 ms 5952 KB Output is correct
29 Correct 54 ms 8836 KB Output is correct
30 Correct 34 ms 9500 KB Output is correct
31 Correct 49 ms 8584 KB Output is correct
32 Correct 30 ms 5964 KB Output is correct
33 Correct 58 ms 11084 KB Output is correct
34 Incorrect 64 ms 22208 KB Output isn't correct
35 Correct 56 ms 8548 KB Output is correct
36 Correct 57 ms 8100 KB Output is correct
37 Incorrect 56 ms 11952 KB Output isn't correct
38 Correct 53 ms 10900 KB Output is correct
39 Correct 50 ms 9092 KB Output is correct
40 Incorrect 46 ms 6872 KB Output isn't correct
41 Incorrect 60 ms 7600 KB Output isn't correct
42 Correct 48 ms 14528 KB Output is correct
43 Incorrect 58 ms 8132 KB Output isn't correct
44 Incorrect 48 ms 7168 KB Output isn't correct
45 Correct 38 ms 6300 KB Output is correct
46 Correct 60 ms 8112 KB Output is correct
47 Correct 47 ms 7500 KB Output is correct
48 Correct 37 ms 10572 KB Output is correct
49 Incorrect 47 ms 7004 KB Output isn't correct
50 Correct 56 ms 17996 KB Output is correct
51 Correct 54 ms 16252 KB Output is correct
52 Incorrect 46 ms 11852 KB Output isn't correct
53 Correct 26 ms 5652 KB Output is correct
54 Correct 64 ms 11888 KB Output is correct
55 Correct 41 ms 6740 KB Output is correct
56 Incorrect 56 ms 7884 KB Output isn't correct
57 Incorrect 46 ms 7100 KB Output isn't correct
58 Correct 48 ms 10492 KB Output is correct
59 Correct 54 ms 10188 KB Output is correct
60 Correct 39 ms 8344 KB Output is correct
61 Correct 41 ms 7524 KB Output is correct
62 Incorrect 50 ms 7836 KB Output isn't correct
63 Correct 44 ms 8524 KB Output is correct
64 Incorrect 46 ms 7116 KB Output isn't correct
65 Correct 38 ms 6340 KB Output is correct
66 Incorrect 44 ms 13712 KB Output isn't correct
67 Correct 28 ms 5708 KB Output is correct
68 Correct 39 ms 7520 KB Output is correct
69 Correct 38 ms 13068 KB Output is correct
70 Incorrect 55 ms 21580 KB Output isn't correct
71 Correct 30 ms 9784 KB Output is correct
72 Correct 30 ms 5944 KB Output is correct
73 Correct 14 ms 4968 KB Output is correct
74 Correct 32 ms 6988 KB Output is correct
75 Correct 48 ms 7528 KB Output is correct
76 Correct 49 ms 7324 KB Output is correct
77 Incorrect 49 ms 9100 KB Output isn't correct
78 Correct 49 ms 7448 KB Output is correct
79 Correct 47 ms 7244 KB Output is correct
80 Correct 60 ms 11128 KB Output is correct
81 Correct 44 ms 6732 KB Output is correct
82 Incorrect 49 ms 7284 KB Output isn't correct
83 Correct 50 ms 7112 KB Output is correct
84 Correct 51 ms 11852 KB Output is correct
85 Correct 37 ms 7544 KB Output is correct
86 Incorrect 50 ms 8008 KB Output isn't correct
87 Correct 51 ms 6852 KB Output is correct
88 Incorrect 52 ms 7732 KB Output isn't correct
89 Correct 58 ms 11236 KB Output is correct
90 Incorrect 49 ms 7184 KB Output isn't correct
91 Correct 35 ms 7492 KB Output is correct
92 Correct 51 ms 11724 KB Output is correct
93 Correct 32 ms 5652 KB Output is correct
94 Correct 40 ms 10208 KB Output is correct
95 Correct 62 ms 10528 KB Output is correct
96 Correct 43 ms 6732 KB Output is correct
97 Correct 42 ms 13644 KB Output is correct
98 Correct 52 ms 8140 KB Output is correct
99 Correct 53 ms 14088 KB Output is correct
100 Correct 56 ms 14668 KB Output is correct
101 Incorrect 54 ms 12136 KB Output isn't correct
102 Correct 57 ms 13968 KB Output is correct