oj.uz

Submission #534310

# Submission time Handle Problem Language Result Execution time Memory
534310 2022-03-08T04:05:43 Z benson1029 Art Class (IOI13_artclass) C++14
40 / 100
 84 ms 8244 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]>200 && g[i][j]<100 && b[i][j]<100) speccolor++;
            else if(b[i][j]>200 && r[i][j]<100 && g[i][j]<100) speccolor++;
            else if(r[i][j]>200 && g[i][j]>200 && b[i][j]<100) speccolor++;
        }
    }
    if(speccolor > 3000) 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
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 6324 KB Output isn't correct
2 Correct 53 ms 6660 KB Output is correct
3 Correct 51 ms 5504 KB Output is correct
4 Incorrect 51 ms 6372 KB Output isn't correct
5 Correct 46 ms 3396 KB Output is correct
6 Correct 44 ms 7648 KB Output is correct
7 Incorrect 63 ms 6408 KB Output isn't correct
8 Correct 55 ms 8076 KB Output is correct
9 Correct 42 ms 3684 KB Output is correct
10 Correct 12 ms 1552 KB Output is correct
11 Correct 49 ms 5544 KB Output is correct
12 Incorrect 56 ms 5040 KB Output isn't correct
13 Correct 42 ms 7848 KB Output is correct
14 Correct 36 ms 7236 KB Output is correct
15 Correct 46 ms 5048 KB Output is correct
16 Incorrect 39 ms 4124 KB Output isn't correct
17 Incorrect 67 ms 6728 KB Output isn't correct
18 Incorrect 56 ms 6560 KB Output isn't correct
19 Correct 45 ms 7656 KB Output is correct
20 Incorrect 49 ms 6388 KB Output isn't correct
21 Correct 65 ms 6576 KB Output is correct
22 Incorrect 31 ms 3404 KB Output isn't correct
23 Correct 59 ms 6596 KB Output is correct
24 Correct 51 ms 5956 KB Output is correct
25 Correct 50 ms 7292 KB Output is correct
26 Correct 15 ms 6476 KB Output is correct
27 Correct 49 ms 7220 KB Output is correct
28 Correct 39 ms 6920 KB Output is correct
29 Incorrect 26 ms 2764 KB Output isn't correct
30 Correct 50 ms 5700 KB Output is correct
31 Correct 59 ms 8024 KB Output is correct
32 Incorrect 84 ms 6484 KB Output isn't correct
33 Incorrect 51 ms 5880 KB Output isn't correct
34 Correct 53 ms 6224 KB Output is correct
35 Incorrect 26 ms 2756 KB Output isn't correct
36 Correct 77 ms 6764 KB Output is correct
37 Correct 45 ms 6120 KB Output is correct
38 Incorrect 45 ms 4308 KB Output isn't correct
39 Incorrect 63 ms 6640 KB Output isn't correct
40 Correct 63 ms 6812 KB Output is correct
41 Correct 35 ms 3360 KB Output is correct
42 Correct 50 ms 5452 KB Output is correct
43 Incorrect 54 ms 6440 KB Output isn't correct
44 Correct 50 ms 5956 KB Output is correct
45 Correct 59 ms 6776 KB Output is correct
46 Correct 64 ms 4800 KB Output is correct
47 Correct 38 ms 7084 KB Output is correct
48 Incorrect 53 ms 5284 KB Output isn't correct
49 Correct 51 ms 8168 KB Output is correct
50 Incorrect 49 ms 7428 KB Output isn't correct
51 Correct 58 ms 8244 KB Output is correct
52 Correct 57 ms 6648 KB Output is correct
53 Correct 49 ms 5868 KB Output is correct
54 Correct 41 ms 6368 KB Output is correct
55 Incorrect 66 ms 4784 KB Output isn't correct
56 Correct 77 ms 7552 KB Output is correct
57 Correct 48 ms 6972 KB Output is correct
58 Correct 48 ms 5064 KB Output is correct
59 Incorrect 58 ms 6372 KB Output isn't correct
60 Correct 52 ms 7056 KB Output is correct
61 Correct 73 ms 6736 KB Output is correct
62 Correct 53 ms 6012 KB Output is correct
63 Incorrect 59 ms 8156 KB Output isn't correct
64 Correct 39 ms 6528 KB Output is correct
65 Correct 46 ms 5484 KB Output is correct
66 Incorrect 53 ms 5488 KB Output isn't correct
67 Incorrect 54 ms 4952 KB Output isn't correct
68 Incorrect 60 ms 6468 KB Output isn't correct
69 Correct 44 ms 4828 KB Output is correct
70 Correct 52 ms 5316 KB Output is correct
71 Incorrect 46 ms 6368 KB Output isn't correct
72 Correct 54 ms 5472 KB Output is correct
73 Incorrect 39 ms 4068 KB Output isn't correct
74 Correct 64 ms 8164 KB Output is correct
75 Correct 41 ms 7116 KB Output is correct
76 Correct 51 ms 6636 KB Output is correct
77 Incorrect 51 ms 6596 KB Output isn't correct
78 Correct 77 ms 5868 KB Output is correct
79 Correct 52 ms 8184 KB Output is correct
80 Incorrect 35 ms 6812 KB Output isn't correct
81 Correct 57 ms 8028 KB Output is correct
82 Incorrect 47 ms 6424 KB Output isn't correct
83 Correct 49 ms 6828 KB Output is correct
84 Incorrect 51 ms 6696 KB Output isn't correct
85 Incorrect 61 ms 6340 KB Output isn't correct
86 Correct 52 ms 7524 KB Output is correct
87 Correct 57 ms 6816 KB Output is correct
88 Correct 57 ms 8116 KB Output is correct
89 Correct 74 ms 5984 KB Output is correct
90 Correct 50 ms 6952 KB Output is correct
91 Correct 51 ms 7732 KB Output is correct
92 Incorrect 62 ms 6924 KB Output isn't correct
93 Incorrect 44 ms 3940 KB Output isn't correct
94 Incorrect 29 ms 2836 KB Output isn't correct
95 Incorrect 33 ms 3660 KB Output isn't correct
96 Incorrect 38 ms 6376 KB Output isn't correct
97 Correct 56 ms 4804 KB Output is correct
98 Correct 33 ms 7344 KB Output is correct
99 Correct 48 ms 6600 KB Output is correct
100 Incorrect 60 ms 6980 KB Output isn't correct
101 Correct 45 ms 5700 KB Output is correct
102 Correct 49 ms 5516 KB Output is correct