oj.uz

Submission #534312

# Submission time Handle Problem Language Result Execution time Memory
534312 2022-03-08T04:13:09 Z benson1029 Art Class (IOI13_artclass) C++14
34 / 100
 88 ms 8188 KB 
#include "artclass.h"
#include<bits/stdc++.h>
using namespace std;

bool vis[500][500];
int r[500][500], g[500][500], b[500][500];
int cntcompo = 0;
stack< pair<int,int> > stk;
int h,w;

bool ok(int x, int y) {
    return (x>=0&&y>=0&&x<h&&y<w&&!vis[x][y]);
}

bool close(int X1, int Y1, int X2, int Y2, int eps) {
    int absdiff = abs(r[X1][Y1]-r[X2][Y2]) + abs(g[X1][Y1]-g[X2][Y2]) + abs(b[X1][Y1]-b[X2][Y2]);
    if(absdiff < eps) {
        return true;
    } else return false;
}

bool close2(int X1, int Y1, int X2, int Y2, int eps) {
    if(abs(r[X1][Y1]-r[X2][Y2]) < eps && abs(g[X1][Y1]-g[X2][Y2]) < eps && abs(b[X1][Y1]-b[X2][Y2]) < eps) {
        return true;
    } else return false;
}

void dfs(int x, int y, int eps) {
    stk.push({x, y});
    while(!stk.empty()) {
        int x = stk.top().first;
        int y = stk.top().second;
        vis[x][y] = true;
        stk.pop();
        if(ok(x+1, y) && close(x, y, x+1, y, eps)) stk.push({x+1, y});
        if(ok(x-1, y) && close(x, y, x-1, y, eps)) stk.push({x-1, y});
        if(ok(x, y+1) && close(x, y, x, y+1, eps)) stk.push({x, y+1});
        if(ok(x, y-1) && close(x, y, x, y-1, eps)) stk.push({x, y-1});
    }
}

void dfs2(int X, int Y, int eps) {
    stk.push({X, Y});
    while(!stk.empty()) {
        int x = stk.top().first;
        int y = stk.top().second;
        vis[x][y] = true;
        stk.pop();
        if(ok(x+1, y) && close2(X, Y, x+1, y, eps)) stk.push({x+1, y});
        if(ok(x-1, y) && close2(X, Y, x-1, y, eps)) stk.push({x-1, y});
        if(ok(x, y+1) && close2(X, Y, x, y+1, eps)) stk.push({x, y+1});
        if(ok(x, y-1) && close2(X, Y, x, y-1, eps)) stk.push({x, y-1});
    }
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    h=H; w=W;
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            r[i][j] = R[i][j];
            g[i][j] = G[i][j];
            b[i][j] = B[i][j];
        }
    }
    for(int i=0; i<H; i++) for(int j=0; j<W; j++) vis[i][j] = false;
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            if(!vis[i][j]) {
                dfs(i,j, 50);
                cntcompo++;
            }
        }
    }
    if(cntcompo<100) return 4;
    int speccolor = 0;
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            if(r[i][j]>175 && g[i][j]<100 && b[i][j]<100) speccolor++;
            else if(b[i][j]>175 && r[i][j]<100 && g[i][j]<100) speccolor++;
            else if(r[i][j]>175 && g[i][j]>175 && b[i][j]<100) speccolor++;
        }
    }
    if(speccolor > 4000) return 1;
    int green = 0;
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            if(g[i][j]-b[i][j]>10 && g[i][j]-r[i][j]>10) {
                green++;
            } else if(r[i][j]-g[i][j]<10 && g[i][j]-b[i][j]>30) green++;
        }
    }
    if(green > 3000) return 2;
    else return 3;
}

Subtask #1
34.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 7928 KB Output is correct
2 Correct 48 ms 7108 KB Output is correct
3 Correct 52 ms 7392 KB Output is correct
4 Incorrect 56 ms 6612 KB Output isn't correct
5 Correct 88 ms 6832 KB Output is correct
6 Incorrect 39 ms 4040 KB Output isn't correct
7 Correct 16 ms 6532 KB Output is correct
8 Correct 88 ms 6612 KB Output is correct
9 Incorrect 28 ms 2920 KB Output isn't correct
10 Incorrect 52 ms 5576 KB Output isn't correct
11 Correct 57 ms 6052 KB Output is correct
12 Correct 61 ms 6804 KB Output is correct
13 Correct 52 ms 5388 KB Output is correct
14 Correct 59 ms 8112 KB Output is correct
15 Incorrect 82 ms 6948 KB Output isn't correct
16 Correct 50 ms 4852 KB Output is correct
17 Correct 47 ms 7536 KB Output is correct
18 Incorrect 39 ms 6780 KB Output isn't correct
19 Correct 46 ms 5556 KB Output is correct
20 Correct 48 ms 7960 KB Output is correct
21 Incorrect 34 ms 6868 KB Output isn't correct
22 Correct 56 ms 7748 KB Output is correct
23 Correct 51 ms 6084 KB Output is correct
24 Correct 67 ms 5316 KB Output is correct
25 Correct 46 ms 3384 KB Output is correct
26 Correct 51 ms 7968 KB Output is correct
27 Incorrect 53 ms 6408 KB Output isn't correct
28 Correct 66 ms 6980 KB Output is correct
29 Correct 53 ms 7088 KB Output is correct
30 Incorrect 56 ms 8028 KB Output isn't correct
31 Correct 40 ms 4804 KB Output is correct
32 Correct 55 ms 6628 KB Output is correct
33 Correct 48 ms 5060 KB Output is correct
34 Correct 51 ms 5656 KB Output is correct
35 Correct 42 ms 7188 KB Output is correct
36 Correct 41 ms 6804 KB Output is correct
37 Incorrect 37 ms 3924 KB Output isn't correct
38 Correct 53 ms 6928 KB Output is correct
39 Incorrect 66 ms 6552 KB Output isn't correct
40 Correct 51 ms 7532 KB Output is correct
41 Incorrect 54 ms 6360 KB Output isn't correct
42 Correct 44 ms 6312 KB Output is correct
43 Correct 55 ms 7072 KB Output is correct
44 Correct 52 ms 6700 KB Output is correct
45 Correct 52 ms 5988 KB Output is correct
46 Incorrect 61 ms 5388 KB Output isn't correct
47 Correct 44 ms 6724 KB Output is correct
48 Correct 53 ms 5812 KB Output is correct
49 Incorrect 68 ms 6420 KB Output isn't correct
50 Correct 52 ms 6048 KB Output is correct
51 Correct 40 ms 6920 KB Output is correct
52 Correct 50 ms 4908 KB Output is correct
53 Incorrect 45 ms 4172 KB Output isn't correct
54 Correct 39 ms 3384 KB Output is correct
55 Incorrect 26 ms 2684 KB Output isn't correct
56 Correct 79 ms 6608 KB Output is correct
57 Incorrect 58 ms 6700 KB Output isn't correct
58 Incorrect 45 ms 4768 KB Output isn't correct
59 Correct 62 ms 6576 KB Output is correct
60 Correct 60 ms 6832 KB Output is correct
61 Incorrect 65 ms 6360 KB Output isn't correct
62 Correct 52 ms 8004 KB Output is correct
63 Incorrect 40 ms 6360 KB Output isn't correct
64 Correct 44 ms 7536 KB Output is correct
65 Correct 55 ms 5600 KB Output is correct
66 Correct 30 ms 7196 KB Output is correct
67 Correct 75 ms 6972 KB Output is correct
68 Incorrect 52 ms 5824 KB Output isn't correct
69 Correct 49 ms 7416 KB Output is correct
70 Correct 66 ms 6812 KB Output is correct
71 Correct 51 ms 7956 KB Output is correct
72 Correct 40 ms 6540 KB Output is correct
73 Correct 53 ms 5552 KB Output is correct
74 Incorrect 54 ms 6416 KB Output isn't correct
75 Correct 57 ms 8188 KB Output is correct
76 Incorrect 49 ms 7308 KB Output isn't correct
77 Incorrect 51 ms 5124 KB Output isn't correct
78 Incorrect 47 ms 3396 KB Output isn't correct
79 Correct 53 ms 6684 KB Output is correct
80 Incorrect 34 ms 3684 KB Output isn't correct
81 Incorrect 63 ms 4824 KB Output isn't correct
82 Incorrect 64 ms 6724 KB Output isn't correct
83 Incorrect 60 ms 6368 KB Output isn't correct
84 Correct 46 ms 6128 KB Output is correct
85 Incorrect 45 ms 6348 KB Output isn't correct
86 Correct 56 ms 8004 KB Output is correct
87 Correct 54 ms 5764 KB Output is correct
88 Incorrect 62 ms 6900 KB Output isn't correct
89 Incorrect 49 ms 5096 KB Output isn't correct
90 Correct 15 ms 1476 KB Output is correct
91 Incorrect 49 ms 5188 KB Output isn't correct
92 Incorrect 43 ms 4392 KB Output isn't correct
93 Incorrect 50 ms 6340 KB Output isn't correct
94 Incorrect 48 ms 6372 KB Output isn't correct
95 Correct 50 ms 7220 KB Output is correct
96 Correct 53 ms 5960 KB Output is correct
97 Incorrect 31 ms 3640 KB Output isn't correct
98 Correct 76 ms 6240 KB Output is correct
99 Incorrect 25 ms 2668 KB Output isn't correct
100 Incorrect 57 ms 5620 KB Output isn't correct
101 Incorrect 38 ms 6372 KB Output isn't correct
102 Correct 54 ms 6596 KB Output is correct