oj.uz

Submission #651740

# Submission time Handle Problem Language Result Execution time Memory
651740 2022-10-19T23:13:04 Z LucaGreg Art Class (IOI13_artclass) C++17
60 / 100
 77 ms 23684 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+6>red && green+6>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;
   memset(marc, 0, sizeof(marc));
  int mx = 0;
  for(int i=0;i<l;i++){
      for(int j=0;j<c;j++){
          if(marc[i][j] == 0){
               mx = max(mx, find_comp(i,j));
           //    int sz_comp = find_comp(i, j);
           //    qtd_comp_++;
           //    if(sz_comp>min_sz_comp) qtd_bigcomp_++;
          }
      }
  }
 
  return mx;
}
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 = 350;
  //min_qtd_greencomp = 8;
  min_sz_greencomp = ((l*c)/30);
  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;
  }
    min_dif=10;
   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:7: warning: unused variable 'qtd_comp' [-Wunused-variable]
  135 |   int qtd_comp = aux.second;
      |       ^~~~~~~~
artclass.cpp:151:8: warning: unused variable 'qtd_green' [-Wunused-variable]
  151 |    int qtd_green = do_green_image();
      |        ^~~~~~~~~

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 11964 KB Output isn't correct
2 Correct 28 ms 5704 KB Output is correct
3 Correct 58 ms 7756 KB Output is correct
4 Correct 42 ms 10240 KB Output is correct
5 Incorrect 38 ms 11044 KB Output isn't correct
6 Correct 50 ms 7972 KB Output is correct
7 Incorrect 67 ms 22200 KB Output isn't correct
8 Correct 61 ms 8756 KB Output is correct
9 Correct 50 ms 10560 KB Output is correct
10 Correct 27 ms 5580 KB Output is correct
11 Correct 44 ms 13620 KB Output is correct
12 Correct 61 ms 12112 KB Output is correct
13 Correct 60 ms 9548 KB Output is correct
14 Correct 62 ms 11316 KB Output is correct
15 Correct 56 ms 7552 KB Output is correct
16 Correct 49 ms 7600 KB Output is correct
17 Correct 59 ms 8652 KB Output is correct
18 Incorrect 50 ms 11052 KB Output isn't correct
19 Incorrect 60 ms 7100 KB Output isn't correct
20 Incorrect 52 ms 7936 KB Output isn't correct
21 Correct 35 ms 6124 KB Output is correct
22 Correct 71 ms 9308 KB Output is correct
23 Incorrect 67 ms 8184 KB Output isn't correct
24 Incorrect 55 ms 7552 KB Output isn't correct
25 Incorrect 59 ms 19612 KB Output isn't correct
26 Correct 57 ms 10188 KB Output is correct
27 Incorrect 49 ms 6808 KB Output isn't correct
28 Incorrect 46 ms 15708 KB Output isn't correct
29 Correct 31 ms 9804 KB Output is correct
30 Correct 59 ms 11004 KB Output is correct
31 Correct 42 ms 6372 KB Output is correct
32 Correct 55 ms 17996 KB Output is correct
33 Incorrect 39 ms 11212 KB Output isn't correct
34 Incorrect 68 ms 22216 KB Output isn't correct
35 Correct 59 ms 8140 KB Output is correct
36 Correct 52 ms 7488 KB Output is correct
37 Incorrect 49 ms 14924 KB Output isn't correct
38 Correct 36 ms 12932 KB Output is correct
39 Correct 54 ms 14760 KB Output is correct
40 Incorrect 51 ms 7004 KB Output isn't correct
41 Correct 56 ms 8552 KB Output is correct
42 Correct 56 ms 9388 KB Output is correct
43 Correct 41 ms 7552 KB Output is correct
44 Correct 37 ms 9624 KB Output is correct
45 Incorrect 77 ms 8164 KB Output isn't correct
46 Correct 49 ms 14668 KB Output is correct
47 Correct 33 ms 6984 KB Output is correct
48 Correct 32 ms 5964 KB Output is correct
49 Correct 32 ms 5972 KB Output is correct
50 Incorrect 17 ms 9320 KB Output isn't correct
51 Incorrect 45 ms 11824 KB Output isn't correct
52 Correct 53 ms 8136 KB Output is correct
53 Correct 55 ms 7536 KB Output is correct
54 Correct 52 ms 16204 KB Output is correct
55 Correct 43 ms 11980 KB Output is correct
56 Correct 52 ms 8080 KB Output is correct
57 Incorrect 66 ms 6988 KB Output isn't correct
58 Correct 16 ms 4948 KB Output is correct
59 Correct 68 ms 11520 KB Output is correct
60 Correct 34 ms 10572 KB Output is correct
61 Correct 61 ms 11120 KB Output is correct
62 Correct 50 ms 7440 KB Output is correct
63 Correct 55 ms 7500 KB Output is correct
64 Correct 49 ms 6772 KB Output is correct
65 Correct 50 ms 6660 KB Output is correct
66 Correct 50 ms 13996 KB Output is correct
67 Correct 54 ms 7372 KB Output is correct
68 Correct 59 ms 7984 KB Output is correct
69 Correct 33 ms 5900 KB Output is correct
70 Correct 50 ms 11784 KB Output is correct
71 Correct 29 ms 5664 KB Output is correct
72 Correct 65 ms 11348 KB Output is correct
73 Correct 44 ms 6240 KB Output is correct
74 Correct 51 ms 7540 KB Output is correct
75 Correct 56 ms 7300 KB Output is correct
76 Correct 58 ms 8116 KB Output is correct
77 Incorrect 60 ms 23684 KB Output isn't correct
78 Correct 56 ms 10380 KB Output is correct
79 Correct 39 ms 6292 KB Output is correct
80 Correct 51 ms 9292 KB Output is correct
81 Correct 41 ms 8164 KB Output is correct
82 Incorrect 69 ms 7620 KB Output isn't correct
83 Correct 57 ms 6916 KB Output is correct
84 Incorrect 49 ms 12044 KB Output isn't correct
85 Incorrect 57 ms 18880 KB Output isn't correct
86 Correct 51 ms 6964 KB Output is correct
87 Incorrect 58 ms 7932 KB Output isn't correct
88 Incorrect 51 ms 6728 KB Output isn't correct
89 Incorrect 56 ms 7248 KB Output isn't correct
90 Correct 59 ms 8876 KB Output is correct
91 Correct 60 ms 8464 KB Output is correct
92 Correct 56 ms 9084 KB Output is correct
93 Correct 57 ms 9288 KB Output is correct
94 Correct 53 ms 6744 KB Output is correct
95 Correct 55 ms 10868 KB Output is correct
96 Correct 56 ms 7140 KB Output is correct
97 Incorrect 38 ms 6688 KB Output isn't correct
98 Correct 58 ms 10516 KB Output is correct
99 Correct 61 ms 7932 KB Output is correct
100 Incorrect 54 ms 6788 KB Output isn't correct
101 Correct 38 ms 7548 KB Output is correct
102 Correct 49 ms 8540 KB Output is correct