oj.uz

Submission #651720

# Submission time Handle Problem Language Result Execution time Memory
651720 2022-10-19T21:56:51 Z LucaGreg Art Class (IOI13_artclass) C++17
5 / 100
 72 ms 25312 KB 
#include <bits/stdc++.h>

using namespace std;

#include "artclass.h"

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;

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_;
}

void marc_greencomp(int li, int ci){
    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]) marc_greencomp(vizl, vizc);
    }
}

int find_greencomp(){
    memset(marc, 0, sizeof(marc));
    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]){
                marc_greencomp(i, j);
                qtd_greencomp_++;
            }
        }
    }
    return qtd_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)/20);
    min_bigcomp = 2;
    min_bigcomp_group14 = 5;
    min_qtd_green = ((l*c)/4);
    min_dif = 15;
    min_colors_sum = 310;
    min_qtd_greencomp = 5;
    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;

    if(qtd_bigcomp>min_bigcomp){
        
        if(qtd_bigcomp<min_bigcomp_group14) return 4;
        else return 1;
    }
    
    int qtd_green = do_green_image();
    if(qtd_green<min_qtd_green){
        return 3;
    }
    
    int qtd_greencomp = find_greencomp();
    if(qtd_greencomp<min_qtd_greencomp) return 2;
    else return 3;
}

Compilation message

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

Subtask #1
5.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6156 KB Output is correct
2 Incorrect 56 ms 8192 KB Output isn't correct
3 Incorrect 40 ms 10576 KB Output isn't correct
4 Incorrect 52 ms 18712 KB Output isn't correct
5 Correct 37 ms 7648 KB Output is correct
6 Correct 26 ms 5700 KB Output is correct
7 Correct 38 ms 6608 KB Output is correct
8 Correct 40 ms 7208 KB Output is correct
9 Correct 49 ms 7948 KB Output is correct
10 Incorrect 58 ms 22692 KB Output isn't correct
11 Incorrect 48 ms 15932 KB Output isn't correct
12 Incorrect 50 ms 8808 KB Output isn't correct
13 Incorrect 50 ms 8256 KB Output isn't correct
14 Correct 47 ms 7592 KB Output is correct
15 Correct 47 ms 9052 KB Output is correct
16 Incorrect 47 ms 7492 KB Output isn't correct
17 Correct 49 ms 7268 KB Output is correct
18 Incorrect 57 ms 19944 KB Output isn't correct
19 Incorrect 48 ms 14368 KB Output isn't correct
20 Incorrect 51 ms 8700 KB Output isn't correct
21 Incorrect 39 ms 13824 KB Output isn't correct
22 Incorrect 55 ms 19508 KB Output isn't correct
23 Correct 48 ms 10268 KB Output is correct
24 Incorrect 30 ms 12876 KB Output isn't correct
25 Correct 39 ms 7628 KB Output is correct
26 Incorrect 68 ms 25312 KB Output isn't correct
27 Correct 37 ms 10692 KB Output is correct
28 Incorrect 34 ms 11244 KB Output isn't correct
29 Incorrect 54 ms 9644 KB Output isn't correct
30 Incorrect 57 ms 9220 KB Output isn't correct
31 Incorrect 51 ms 14284 KB Output isn't correct
32 Incorrect 52 ms 7480 KB Output isn't correct
33 Correct 41 ms 7708 KB Output is correct
34 Incorrect 54 ms 9572 KB Output isn't correct
35 Correct 49 ms 7612 KB Output is correct
36 Incorrect 54 ms 23776 KB Output isn't correct
37 Correct 32 ms 6088 KB Output is correct
38 Incorrect 39 ms 14924 KB Output isn't correct
39 Incorrect 60 ms 12844 KB Output isn't correct
40 Correct 53 ms 7264 KB Output is correct
41 Correct 32 ms 6100 KB Output is correct
42 Incorrect 58 ms 10968 KB Output isn't correct
43 Incorrect 58 ms 12748 KB Output isn't correct
44 Correct 55 ms 11348 KB Output is correct
45 Incorrect 58 ms 19660 KB Output isn't correct
46 Incorrect 36 ms 7860 KB Output isn't correct
47 Incorrect 57 ms 13668 KB Output isn't correct
48 Incorrect 54 ms 10720 KB Output isn't correct
49 Incorrect 51 ms 8652 KB Output isn't correct
50 Incorrect 59 ms 11788 KB Output isn't correct
51 Incorrect 44 ms 17928 KB Output isn't correct
52 Incorrect 60 ms 11216 KB Output isn't correct
53 Correct 56 ms 12620 KB Output is correct
54 Correct 35 ms 6336 KB Output is correct
55 Incorrect 41 ms 17516 KB Output isn't correct
56 Incorrect 58 ms 20300 KB Output isn't correct
57 Correct 51 ms 7716 KB Output is correct
58 Incorrect 54 ms 15888 KB Output isn't correct
59 Incorrect 52 ms 20288 KB Output isn't correct
60 Correct 49 ms 8724 KB Output is correct
61 Correct 46 ms 7592 KB Output is correct
62 Incorrect 46 ms 7100 KB Output isn't correct
63 Correct 32 ms 7428 KB Output is correct
64 Correct 44 ms 7032 KB Output is correct
65 Incorrect 50 ms 19784 KB Output isn't correct
66 Correct 59 ms 11840 KB Output is correct
67 Correct 27 ms 5844 KB Output is correct
68 Correct 58 ms 13092 KB Output is correct
69 Correct 49 ms 7092 KB Output is correct
70 Incorrect 45 ms 11200 KB Output isn't correct
71 Correct 26 ms 5708 KB Output is correct
72 Incorrect 38 ms 9272 KB Output isn't correct
73 Incorrect 17 ms 9936 KB Output isn't correct
74 Incorrect 52 ms 20428 KB Output isn't correct
75 Incorrect 54 ms 15092 KB Output isn't correct
76 Correct 56 ms 11168 KB Output is correct
77 Incorrect 72 ms 22756 KB Output isn't correct
78 Incorrect 58 ms 7880 KB Output isn't correct
79 Incorrect 53 ms 8576 KB Output isn't correct
80 Correct 44 ms 6820 KB Output is correct
81 Incorrect 55 ms 8508 KB Output isn't correct
82 Incorrect 48 ms 10112 KB Output isn't correct
83 Incorrect 51 ms 17328 KB Output isn't correct
84 Correct 38 ms 6368 KB Output is correct
85 Correct 51 ms 14296 KB Output is correct
86 Incorrect 57 ms 16008 KB Output isn't correct
87 Correct 48 ms 10088 KB Output is correct
88 Incorrect 52 ms 17356 KB Output isn't correct
89 Incorrect 35 ms 14156 KB Output isn't correct
90 Incorrect 44 ms 17356 KB Output isn't correct
91 Incorrect 43 ms 13780 KB Output isn't correct
92 Correct 43 ms 7860 KB Output is correct
93 Correct 45 ms 10728 KB Output is correct
94 Incorrect 57 ms 13216 KB Output isn't correct
95 Incorrect 50 ms 9296 KB Output isn't correct
96 Correct 44 ms 6944 KB Output is correct
97 Incorrect 49 ms 8688 KB Output isn't correct
98 Incorrect 53 ms 11248 KB Output isn't correct
99 Correct 14 ms 5076 KB Output is correct
100 Correct 54 ms 11304 KB Output is correct
101 Incorrect 48 ms 12236 KB Output isn't correct
102 Incorrect 47 ms 12420 KB Output isn't correct