oj.uz

Submission #7594

# Submission time Handle Problem Language Result Execution time Memory
7594 2014-08-12T00:30:40 Z Namnamseo Art Class (IOI13_artclass) C++
100 / 100
 150 ms 6568 KB 
#include "artclass.h"
#define BSIZE 256
#include <algorithm>
//#include <cstdio>
#include <cmath>

double r1=31;
double r2=1;
double rg=30000;
double r3=700000;
double r4=0.11;

long long sqr(long long x) { return x*x;}

int colorcnt[BSIZE];
int allcnt;

//extern int image_type, image_num;

int dx[8] = {-1,-1,-1,0,0,1,1,1};
int dy[8] = {-1,0,1,-1,1,-1,0,1};

int R[500][500];
int G[500][500];
int B[500][500];

int rcount;
int gcount;
int bcount;

int diff(int ax,int ay, int bx,int by){
    return (sqr(R[ax][ay]-R[bx][by])+
    sqr(G[ax][ay]-G[bx][by])+
    sqr(B[ax][ay]-B[bx][by]))/3/256/(256/BSIZE)/8;
}

double square(double x)  { return x*x; }
double foursquare(double x)  { return square(square(x)); }
double abs(double x)  { return (x>0)?x:-x; }

double check1(){
    double ret = 0;
    int i;
    if(1.0*colorcnt[0]/allcnt <= 0.4) {
        //printf("skip ");
        return 0;
    }
    double sample[10]={0.9019166465,0.0118866004,
                       0.0086173976,0.0141395687,
                       0.0047904047,0.0037785316,
                       0.0048340199,0.0027482433,
                       0.0022108069,0.0022844681};
    for(i=0;i<10;i++){
        ret += foursquare(((1.0*colorcnt[i]/allcnt)-sample[i]));
    }
    ret = 1/ret;
    ret *= r1;
    //printf("%15lf ",ret);
    return ret;
}

double check2(){
    double ret = 0;
    int i;
    if(1.0*colorcnt[0]/allcnt <= 0.4) {
        //printf("skip ");
        return 0;
    }
    double sample[10]={ 0.8484479226,0.0524667046,0.0232874217,0.0135344337,0.0085207740,
                        0.0057063176,0.0040614684,0.0030028458,0.0022692089,0.0016602163};
    for(i=0;i<10;i++){
        ret += foursquare(((1.0*colorcnt[i]/allcnt)-sample[i]));
    }
    
    ret = 1/ret;
    if(bcount >= 60000 && (1.0*bcount/(1+rcount))>=1.7 && (1.0*bcount/(1+gcount))>=1.7) {
        //printf("#");
        ret *= rg;
    }
    ret *= r2;
    //printf("%15lf ",ret);
    return ret;
}

double check3() {
    if(1.0*colorcnt[0]/allcnt > 0.6) {
        //printf("skip ");
        return 0;
    }
    double ret = 0;
    int i;
    double sample[10]={ 0.3627259093,0.3640176228,0.1051308586,0.1001394826,
                        0.0586884139,0.0507251594,0.0348496438,0.1098590176,
                        0.0257210349,0.0225976753};
    for(i=0;i<10;i++){
        ret += foursquare((1.0*colorcnt[i]/allcnt)-sample[i]);
    }
    ret = 1/ret;
    ret *= r3;
    //printf("%15lf ",ret);
    return ret;
}

double check4() {
    double ret = 0;
    int i;
    double sample[10] = {1,0.0000000780,0.0000005723,0.0000009647,
                         0.0000000030,0.0000000031,0.0000000828,0.0000000121,
                         0.0000000087,0.0000000015};
    for(i=0;i<10;i++){
        ret += 0.8*foursquare((1.0*colorcnt[i]/allcnt)-sample[i]);
    }
    ret = 1/ret;
    ret *= r4;
    //printf("%15lf\n",ret);
    return ret;
}

int style(int H, int W, int _R[500][500], int _G[500][500], int _B[500][500]) {
    int i,j,dir;
    int nx,ny;
    
    allcnt=0;
    
    rcount=0;
    gcount=0;
    bcount=0;
    
    for(i=0;i<H;i++) for(j=0;j<W;j++) {
        R[i][j]=_R[i][j];
        G[i][j]=_G[i][j];
        B[i][j]=_B[i][j];
        if(7<=R[i][j] && R[i][j]<=50) rcount++;
        if(7<=G[i][j] && G[i][j]<=50) gcount++;
        if(7<=B[i][j] && B[i][j]<=50) bcount++;
    }
    
    //printf("%lf %lf\n",1.0*bcount/(1+rcount),1.0*bcount/(1+gcount));
    
    for(i=0;i<BSIZE;i++) colorcnt[i]=0;
    
    int tmp;
    
    for(i=0;i<H;i++){
        for(j=0;j<W;j++){
            tmp=0;
            for(dir=0; dir<8; dir++){
                nx = i+dx[dir];
                ny = j+dy[dir];
                if(nx>=0 && ny>=0 && nx<H && ny<W){
                    tmp+=diff(i,j,nx,ny);
                }
            }
            colorcnt[tmp]++;
            allcnt++;
        }
    }
    
    std::pair<double,int> expect[4];
    for(i=0;i<4;i++){
        expect[i].second = i;
    }
    expect[0].first=check1();
    expect[1].first=check2();
    expect[2].first=check3();
    expect[3].first=check4();
    std::sort(expect,expect+4);
    return expect[3].second+1;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 6568 KB Output is correct
2 Correct 84 ms 6568 KB Output is correct
3 Correct 75 ms 6568 KB Output is correct
4 Correct 70 ms 6568 KB Output is correct
5 Correct 95 ms 6568 KB Output is correct
6 Correct 85 ms 6568 KB Output is correct
7 Incorrect 85 ms 6568 KB Output isn't correct
8 Correct 90 ms 6568 KB Output is correct
9 Correct 66 ms 6568 KB Output is correct
10 Correct 149 ms 6380 KB Output is correct
11 Correct 89 ms 6568 KB Output is correct
12 Correct 86 ms 6568 KB Output is correct
13 Correct 119 ms 6568 KB Output is correct
14 Correct 99 ms 6568 KB Output is correct
15 Correct 84 ms 6568 KB Output is correct
16 Correct 58 ms 6460 KB Output is correct
17 Correct 58 ms 6568 KB Output is correct
18 Correct 134 ms 6380 KB Output is correct
19 Correct 23 ms 6568 KB Output is correct
20 Incorrect 79 ms 6568 KB Output isn't correct
21 Incorrect 112 ms 6568 KB Output isn't correct
22 Correct 55 ms 6568 KB Output is correct
23 Correct 37 ms 6568 KB Output is correct
24 Correct 122 ms 6244 KB Output is correct
25 Correct 109 ms 6568 KB Output is correct
26 Correct 95 ms 6568 KB Output is correct
27 Correct 99 ms 6568 KB Output is correct
28 Correct 135 ms 6440 KB Output is correct
29 Incorrect 136 ms 6568 KB Output isn't correct
30 Correct 138 ms 6440 KB Output is correct
31 Correct 110 ms 6568 KB Output is correct
32 Correct 112 ms 6320 KB Output is correct
33 Correct 67 ms 3448 KB Output is correct
34 Correct 116 ms 6568 KB Output is correct
35 Incorrect 117 ms 6568 KB Output isn't correct
36 Correct 88 ms 6568 KB Output is correct
37 Correct 126 ms 6568 KB Output is correct
38 Correct 96 ms 6568 KB Output is correct
39 Incorrect 99 ms 6568 KB Output isn't correct
40 Correct 103 ms 6440 KB Output is correct
41 Correct 76 ms 6568 KB Output is correct
42 Correct 120 ms 6380 KB Output is correct
43 Correct 103 ms 6568 KB Output is correct
44 Correct 76 ms 6568 KB Output is correct
45 Correct 66 ms 6568 KB Output is correct
46 Correct 98 ms 6568 KB Output is correct
47 Correct 86 ms 6568 KB Output is correct
48 Correct 90 ms 6568 KB Output is correct
49 Correct 119 ms 6460 KB Output is correct
50 Correct 103 ms 6568 KB Output is correct
51 Correct 66 ms 6568 KB Output is correct
52 Correct 104 ms 6568 KB Output is correct
53 Correct 111 ms 6568 KB Output is correct
54 Correct 53 ms 6568 KB Output is correct
55 Correct 93 ms 6568 KB Output is correct
56 Correct 84 ms 6568 KB Output is correct
57 Correct 117 ms 6568 KB Output is correct
58 Correct 50 ms 6568 KB Output is correct
59 Correct 82 ms 6568 KB Output is correct
60 Correct 80 ms 6568 KB Output is correct
61 Correct 106 ms 6568 KB Output is correct
62 Correct 87 ms 6568 KB Output is correct
63 Correct 94 ms 6568 KB Output is correct
64 Correct 98 ms 6568 KB Output is correct
65 Correct 97 ms 6568 KB Output is correct
66 Correct 129 ms 6568 KB Output is correct
67 Correct 82 ms 6568 KB Output is correct
68 Correct 127 ms 6380 KB Output is correct
69 Correct 83 ms 6568 KB Output is correct
70 Incorrect 45 ms 6568 KB Output isn't correct
71 Correct 120 ms 6568 KB Output is correct
72 Correct 83 ms 6568 KB Output is correct
73 Correct 63 ms 6568 KB Output is correct
74 Incorrect 83 ms 6568 KB Output isn't correct
75 Correct 150 ms 6568 KB Output is correct
76 Correct 69 ms 6320 KB Output is correct
77 Correct 102 ms 6460 KB Output is correct
78 Correct 74 ms 6568 KB Output is correct
79 Correct 91 ms 6568 KB Output is correct
80 Correct 95 ms 6568 KB Output is correct
81 Incorrect 121 ms 6568 KB Output isn't correct
82 Correct 65 ms 6568 KB Output is correct
83 Correct 99 ms 6568 KB Output is correct
84 Correct 97 ms 6568 KB Output is correct
85 Incorrect 104 ms 6568 KB Output isn't correct
86 Correct 82 ms 6568 KB Output is correct
87 Correct 85 ms 6568 KB Output is correct
88 Correct 101 ms 6568 KB Output is correct
89 Correct 96 ms 6568 KB Output is correct
90 Correct 124 ms 6460 KB Output is correct
91 Correct 135 ms 6568 KB Output is correct
92 Correct 82 ms 6568 KB Output is correct
93 Correct 80 ms 6568 KB Output is correct
94 Correct 85 ms 6568 KB Output is correct
95 Correct 73 ms 6568 KB Output is correct
96 Correct 64 ms 6568 KB Output is correct
97 Correct 118 ms 6440 KB Output is correct
98 Correct 79 ms 6568 KB Output is correct
99 Correct 80 ms 6568 KB Output is correct
100 Correct 88 ms 6568 KB Output is correct
101 Correct 118 ms 6380 KB Output is correct
102 Correct 100 ms 6568 KB Output is correct