Submission #64170

#TimeUsernameProblemLanguageResultExecution timeMemory
64170MKopchevArt Class (IOI13_artclass)C++14
0 / 100
125 ms6924 KiB
#include "artclass.h"
#include <bits/stdc++.h>
using namespace std;
const int C=25;
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
srand(time(0));
int green=0;
for(int i=0;i<H;i++)
    for(int j=0;j<W;j++)
    {
        int s=R[i][j]*R[i][j]+(G[i][j]-255)*(G[i][j]-255)+B[i][j]*B[i][j];
        if(sqrt(s)<=C)green++;
    }
if(green>H*W*15/100)return 2;
assert(0==1);
/*
int val=255*2;
if(total_b+total_g+total_r>val/3*H*W)return 1;
if(total_b+total_g+total_r<(255*3-val)/3*H*W)return 3;
return 4;
*/
double total=0;
for(int i=0;i<H-1;i++)
    for(int j=0;j<W-1;j++)
    {
    total=total+sqrt((R[i][j]-R[i+1][j])*(R[i][j]-R[i+1][j])+(G[i][j]-G[i+1][j])*(G[i][j]-G[i+1][j])+(B[i][j]-B[i+1][j])*(B[i][j]-B[i+1][j]));
    total=total+sqrt((R[i][j]-R[i][j+1])*(R[i][j]-R[i][j+1])+(G[i][j]-G[i][j+1])*(G[i][j]-G[i][j+1])+(B[i][j]-B[i][j+1])*(B[i][j]-B[i][j+1]));
    }
if(total>60*H*W)return 3;

int black=0;
for(int i=0;i<H;i++)
    for(int j=0;j<W;j++)
    {
        int s=R[i][j]*R[i][j]+G[i][j]*G[i][j]+B[i][j]*B[i][j];
        if(sqrt(s)<=C)black++;
    }
if(total<10*H*W)return 4;
//if(black>H*W*5/100)return 1;
return 1;
}
/*
int main()
{

}
*/
#Verdict Execution timeMemoryGrader output
Fetching results...