제출 #1223760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223760		Malix	Art Class (IOI13_artclass)	C++20	50 / 100	48 ms	3416 KiB

artclass

#include "artclass.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int style(int n, int m, int R[500][500], int G[500][500], int B[500][500]) {
    int cnt=0;
    vector<pi> loc={{1,0},{-1,0},{0,1},{0,-1}};
    int c=20;
    REP(i,1,n-1)REP(j,1,m-1){
        bool flag=1;
        REP(k,0,4){
            int x=loc[k].F,y=loc[k].S;
            if(abs(R[i][j]-R[i+x][j+y])>c)flag=0;
            if(abs(G[i][j]-G[i+x][j+y])>c)flag=0;
            if(abs(B[i][j]-B[i+x][j+y])>c)flag=0;
        }
        if(flag)cnt++;
    }
    if(cnt>(n*m)/2){
        int k=0;
        REP(i,0,n){
            int p=0;
            REP(j,0,m)if(R[i][j]<50&&G[i][j]<50&&B[i][j]<50)p++;
            if(p>(m/2))k++;
        }
        if(k>0)return 1;
        return 4;
    }
    else{
        int k=0;
        REP(i,0,n)REP(j,0,m)if(R[i][j]>150)k++;
        if(k>(n*m)/3)return 3;
        else return 2;
    }
}

• Subtask 1: 49.7059 / 100