# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64184 | MKopchev | Art Class (IOI13_artclass) | C++14 | 136 ms | 3704 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "artclass.h"
#include <bits/stdc++.h>
using namespace std;
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
srand(time(0));
int total_r=0,total_g=0,total_b=0;
for(int i=0;i<H;i++)
for(int j=0;j<W;j++)
{
total_r+=R[i][j];
total_g+=G[i][j];
total_b+=B[i][j];
}
if(total_g>(total_b+total_r)*/*0.56*/3/5)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)<=15)black++;
}
if(total<10*H*W)return 4;
//if(black>H*W*5/100)return 1;
if(total_g>(total_b+total_r)*0.54)return 2;
return 1;
}
/*
int main()
{
}
*/
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |