제출 #724184

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
724184		Urvuk3	미술 수업 (IOI13_artclass)	C++17	78 / 100	173 ms	11164 KiB

artclass

#include "artclass.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define pb push_back

void PRINT(int x) {cerr << x;}
void PRINT(ll x) {cerr << x;}
void PRINT(double x) {cerr << x;}
void PRINT(char x) {cerr << '\'' << x << '\'';}
void PRINT(string x) {cerr << '\"' << x << '\"';}
void PRINT(bool x) {cerr << (x ? "true" : "false");}

template<typename T,typename V>
void PRINT(pair<T,V>& x){
    cerr<<"{";
    PRINT(x.fi);
    cerr<<",";
    PRINT(x.se);
    cerr<<"}";
}
template<typename T>
void PRINT(T &x){
    int id=0;
    cerr<<"{";
    for(auto _i:x){
        cerr<<(id++ ? "," : "");
        PRINT(_i);
    }
    cerr<<"}";
}
void _PRINT(){
    cerr<<"]\n";
}
template<typename Head,typename... Tail>
void _PRINT(Head h,Tail... t){
    PRINT(h);
    if(sizeof...(t)) cerr<<", ";
    _PRINT(t...);
}

#define Debug(x...) cerr<<"["<<#x<<"]=["; _PRINT(x)

int Hg,Wg;

bool Valid(int i,int j){
    return (0<=i && i<Hg) && (0<=j && j<Wg);
}

bool In(int x,int l,int r){
    return (l<=x && x<=r);
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    Hg=H,Wg=W;
    vector<int> di={-1,1};
    vector<int> dj={0,0};
    ll Rv=0,Gv=0,Bv=0;
    set<pair<pii,int>> s;
    for(int i=0;i<Hg;i++){
        for(int j=0;j<Wg;j++){
            s.insert({{R[i][j],G[i][j]},B[i][j]});
            for(int d=0;d<2;d++){
                int i1=i+di[d];
                int j1=j+dj[d];
                if(Valid(i1,j1)){
                    Rv+=abs(R[i][j]-R[i1][j1]);
                    Gv+=abs(G[i][j]-G[i1][j1]);
                    Bv+=abs(B[i][j]-B[i1][j1]);
                }
            }
        }
    }
    di={0,0};
    dj={-1,1};
    ll Rh=0,Gh=0,Bh=0;
    for(int i=0;i<Hg;i++){
        for(int j=0;j<Wg;j++){
            for(int d=0;d<2;d++){
                int i1=i+di[d];
                int j1=j+dj[d];
                if(Valid(i1,j1)){
                    Rh+=abs(R[i][j]-R[i1][j1]);
                    Gh+=abs(G[i][j]-G[i1][j1]);
                    Bh+=abs(B[i][j]-B[i1][j1]);
                }
            }
        }
    }
    di={-1,0,1,0};
    dj={0,1,0,-1};
    ll similar=0;
    ll disimilar=0;
    for(int i=0;i<Hg;i++){
        for(int j=0;j<Wg;j++){
            for(int d=0;d<8;d++){
                int i1=i+di[d];
                int j1=j+dj[d];
                ll dif=0;
                if(Valid(i1,j1)){
                    dif+=abs(R[i][j]-R[i1][j1]);
                    dif+=abs(G[i][j]-G[i1][j1]);
                    dif+=abs(B[i][j]-B[i1][j1]);
                    if(dif==0) similar++;
                    if(0<dif && dif<=5) disimilar++;
                }
            }
        }
    }
    ll se=sz(s);
    vector<ll> ret={Rv,Gv,Bv,Rh,Gh,Bh,similar,disimilar};
    ret.pb(se);
    for(int i=0;i<sz(ret);i++) ret[i]/=(H*W);
    bool b3=true;
    for(int i=0;i<6;i++) b3&=In(ret[i],34,84);
    if(b3) return 3;
    bool b1=true;
    for(int i=0;i<6;i++) b1&=In(ret[i],5,24);
    if(b1) return 1;
    bool b2=true;
    for(int i=0;i<6;i++) b2&=In(ret[i],13,40);
    if(b2) return 2;
    return 4;
}

• Subtask 1: 78 / 100