Submission #64144

#TimeUsernameProblemLanguageResultExecution timeMemory
64144MKopchevArt Class (IOI13_artclass)C++14
7 / 100
139 ms3724 KiB
#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)*2/3)return 2; /* 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>30*H*W)return 3; int a=rand()%2,arr[2]={1,4}; return arr[a]; }
#Verdict Execution timeMemoryGrader output
Fetching results...