oj.uz

Submission #2958

# Submission time Handle Problem Language Result Execution time Memory
2958 2013-08-18T13:58:47 Z ainta Art Class (IOI13_artclass) C++
100 / 100
 129 ms 8572 KB 
#include "artclass.h"
#include <stdio.h>
int C[500][500],count,h,w,RR[500][500],GG[500][500],BB[500][500],X[500],Y[500],O[100][100][100];
int abs(int a){return a<0?-a:a;}
int F(int x,int y,int r,int g,int b){
    return (RR[x][y]-r)*(RR[x][y]-r)+(GG[x][y]-g)*(GG[x][y]-g)+(BB[x][y]-b)*(BB[x][y]-b);
}
bool chk(int x,int y,int r,int g,int b){
    if(x<0||x>=h)return false;
    if(y<0||y>=w)return false;
    if(C[x][y])return false;
    if(F(x,y,r,g,b)<1000)return true;
    return false;
}

void DFS(int x,int y,int r,int g,int b){
    C[x][y]=count;
    if(chk(x-1,y,r,g,b))DFS(x-1,y,r,g,b);
    if(chk(x+1,y,r,g,b))DFS(x+1,y,r,g,b);
    if(chk(x,y-1,r,g,b))DFS(x,y-1,r,g,b);
    if(chk(x,y+1,r,g,b))DFS(x,y+1,r,g,b);
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    h=H,w=W;
    count=0;
    int i,j,c1=0,c2=0,ck1=0,ck2=0,S=0,S2=0,C1=0,C2=0;
    for(i=0;i<H;i++){
        for(j=0;j<W;j++){
            if(i)S+=abs(R[i][j]-R[i-1][j])+abs(G[i][j]-G[i-1][j])+abs(B[i][j]-B[i-1][j]),C1++;
            if(j)S2+=abs(R[i][j]-R[i][j-1])+abs(G[i][j]-G[i][j-1])+abs(B[i][j]-B[i][j-1]),C2++;
        }
    }
    double K=(S+S2)/(C1+C2);
    if(K<9)return 4;
    if(K>54)return 3;
    if(K>35)return 2;
    if(K<22)return 1;
    for(i=0;i<H;i++){
        for(j=0;j<W;j++){
            RR[i][j]=R[i][j],GG[i][j]=G[i][j],BB[i][j]=B[i][j];
            O[R[i][j]/10][G[i][j]/10][B[i][j]/10]++;
            C[i][j]=0;
            Y[j]=0;
        }
        X[i]=0;
    }
    for(i=0;i<H;i++){
        for(j=0;j<W;j++){
            if(!C[i][j]){
                count++;
                DFS(i,j,R[i][j],G[i][j],B[i][j]);
            }
            if(i && C[i][j]!=C[i-1][j])c1++;
            if(j && C[i][j]!=C[i][j-1])c2++;
        }
    }
    c1/=(H-1);
    c2/=(W-1);
    for(i=0;i<H;i++){
        for(j=0;j<W;j++){
            if(i && C[i][j]!=C[i-1][j])X[i-1]++;
            if(j && C[i][j]!=C[i][j-1])Y[j-1]++;
        }
    }
    for(i=0;i<H-1;i++){
        if(X[i]>c1+(W-1)/2)ck1++;
    }
    for(i=0;i<W-1;i++){
        if(Y[i]>c2+(H-1)/2)ck2++;
    }
    if(ck1&&ck2 && ck1+ck2>2){
        return 1;
    }
    return 2;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 67 ms 8428 KB Output isn't correct
2 Correct 44 ms 8572 KB Output is correct
3 Correct 59 ms 8572 KB Output is correct
4 Correct 40 ms 8572 KB Output is correct
5 Correct 98 ms 8428 KB Output is correct
6 Correct 93 ms 8572 KB Output is correct
7 Correct 90 ms 8572 KB Output is correct
8 Incorrect 77 ms 8572 KB Output isn't correct
9 Incorrect 107 ms 8112 KB Output isn't correct
10 Correct 85 ms 8428 KB Output is correct
11 Correct 75 ms 8572 KB Output is correct
12 Correct 89 ms 8428 KB Output is correct
13 Correct 102 ms 8428 KB Output is correct
14 Correct 70 ms 8428 KB Output is correct
15 Correct 123 ms 8428 KB Output is correct
16 Correct 101 ms 8428 KB Output is correct
17 Correct 92 ms 8428 KB Output is correct
18 Correct 82 ms 8572 KB Output is correct
19 Correct 99 ms 8572 KB Output is correct
20 Correct 77 ms 8572 KB Output is correct
21 Correct 86 ms 3432 KB Output is correct
22 Correct 74 ms 8572 KB Output is correct
23 Correct 84 ms 8572 KB Output is correct
24 Correct 42 ms 8572 KB Output is correct
25 Correct 114 ms 8572 KB Output is correct
26 Correct 66 ms 8572 KB Output is correct
27 Correct 41 ms 8572 KB Output is correct
28 Correct 119 ms 8112 KB Output is correct
29 Correct 97 ms 8112 KB Output is correct
30 Correct 89 ms 8572 KB Output is correct
31 Correct 127 ms 8572 KB Output is correct
32 Correct 96 ms 8428 KB Output is correct
33 Correct 78 ms 8572 KB Output is correct
34 Correct 78 ms 8112 KB Output is correct
35 Correct 88 ms 8572 KB Output is correct
36 Correct 84 ms 8572 KB Output is correct
37 Correct 83 ms 8572 KB Output is correct
38 Correct 79 ms 8572 KB Output is correct
39 Incorrect 96 ms 8112 KB Output isn't correct
40 Correct 82 ms 8572 KB Output is correct
41 Correct 108 ms 8428 KB Output is correct
42 Correct 65 ms 8428 KB Output is correct
43 Correct 64 ms 8572 KB Output is correct
44 Correct 80 ms 8572 KB Output is correct
45 Correct 71 ms 8428 KB Output is correct
46 Correct 107 ms 8112 KB Output is correct
47 Correct 69 ms 8572 KB Output is correct
48 Correct 124 ms 8572 KB Output is correct
49 Correct 81 ms 8428 KB Output is correct
50 Correct 101 ms 3432 KB Output is correct
51 Correct 80 ms 8428 KB Output is correct
52 Correct 74 ms 8572 KB Output is correct
53 Correct 92 ms 8428 KB Output is correct
54 Correct 71 ms 3304 KB Output is correct
55 Correct 67 ms 8572 KB Output is correct
56 Correct 79 ms 8572 KB Output is correct
57 Correct 83 ms 8428 KB Output is correct
58 Correct 50 ms 8572 KB Output is correct
59 Correct 44 ms 8572 KB Output is correct
60 Correct 86 ms 8572 KB Output is correct
61 Correct 76 ms 8572 KB Output is correct
62 Correct 83 ms 8572 KB Output is correct
63 Correct 24 ms 8572 KB Output is correct
64 Correct 90 ms 8428 KB Output is correct
65 Correct 66 ms 8428 KB Output is correct
66 Incorrect 129 ms 8572 KB Output isn't correct
67 Correct 90 ms 8112 KB Output is correct
68 Correct 81 ms 8572 KB Output is correct
69 Correct 74 ms 8112 KB Output is correct
70 Correct 110 ms 8572 KB Output is correct
71 Correct 71 ms 8572 KB Output is correct
72 Correct 53 ms 8572 KB Output is correct
73 Correct 20 ms 8572 KB Output is correct
74 Correct 72 ms 8428 KB Output is correct
75 Correct 92 ms 8572 KB Output is correct
76 Correct 65 ms 8572 KB Output is correct
77 Correct 51 ms 3384 KB Output is correct
78 Correct 63 ms 8572 KB Output is correct
79 Correct 74 ms 3432 KB Output is correct
80 Correct 90 ms 8428 KB Output is correct
81 Correct 37 ms 8572 KB Output is correct
82 Correct 93 ms 8428 KB Output is correct
83 Correct 66 ms 8572 KB Output is correct
84 Correct 77 ms 8572 KB Output is correct
85 Correct 40 ms 8572 KB Output is correct
86 Correct 93 ms 8572 KB Output is correct
87 Incorrect 57 ms 8572 KB Output isn't correct
88 Incorrect 106 ms 8572 KB Output isn't correct
89 Correct 71 ms 8572 KB Output is correct
90 Correct 77 ms 8572 KB Output is correct
91 Correct 69 ms 8572 KB Output is correct
92 Correct 75 ms 8572 KB Output is correct
93 Correct 78 ms 8572 KB Output is correct
94 Correct 59 ms 8572 KB Output is correct
95 Correct 62 ms 8572 KB Output is correct
96 Correct 73 ms 8572 KB Output is correct
97 Correct 109 ms 8428 KB Output is correct
98 Correct 101 ms 8428 KB Output is correct
99 Correct 78 ms 1876 KB Output is correct
100 Correct 89 ms 8572 KB Output is correct
101 Correct 69 ms 8572 KB Output is correct
102 Correct 85 ms 3432 KB Output is correct