제출 #471732

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
471732		NhatMinh0208	미술 수업 (IOI13_artclass)	C++14	47 / 100	78 ms	16576 KiB

artclass

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
#include "artclass.h"


const int DIFF_LIM = 20;
const ld CC_LIM = 0.005;
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a;
int used[500][500],r[500][500],g[500][500],b[500][500];
void dfs(int i, int j){
    used[i][j]=1;
    a++;
    int _i, _j;
    _i=i+1;
    _j=j+1;
    if (_i>=0 && _i<n && _j>=0 && _j<m && !used[_i][_j] && abs(r[i][j]-r[_i][_j])+abs(g[i][j]-g[_i][_j])+abs(b[i][j]-b[_i][_j])<=DIFF_LIM) {
        dfs(_i, _j);
    }
    _i=i-1;
    _j=j+1;
    if (_i>=0 && _i<n && _j>=0 && _j<m && !used[_i][_j] && abs(r[i][j]-r[_i][_j])+abs(g[i][j]-g[_i][_j])+abs(b[i][j]-b[_i][_j])<=DIFF_LIM) {
        dfs(_i, _j);
    }
    _i=i+1;
    _j=j-1;
    if (_i>=0 && _i<n && _j>=0 && _j<m && !used[_i][_j] && abs(r[i][j]-r[_i][_j])+abs(g[i][j]-g[_i][_j])+abs(b[i][j]-b[_i][_j])<=DIFF_LIM) {
        dfs(_i, _j);
    }
    _i=i-1;
    _j=j-1;
    if (_i>=0 && _i<n && _j>=0 && _j<m && !used[_i][_j] && abs(r[i][j]-r[_i][_j])+abs(g[i][j]-g[_i][_j])+abs(b[i][j]-b[_i][_j])<=DIFF_LIM) {
        dfs(_i, _j);
    }
}
int style( int H,int W,
        int R[500][500],int G[500][500],int B[500][500]) {
    for (i=0;i<H;i++) for (j=0;j<W;j++) {
        used[i][j]=0;
        r[i][j]=R[i][j];
        g[i][j]=G[i][j];
        b[i][j]=B[i][j];
    }
    n=H;
    m=W;
    
    for (i=0;i<n;i++) for (j=0;j<m;j++) if (!used[i][j]) {
        a=0;
        dfs(i,j);       
        if ((ld)a/(n*m)>=CC_LIM) vec.push_back(a);
    }
    
    sort(vec.begin(),vec.end());
    int aa=vec.size();
    ld bb=((vec.size())?((ld)vec[vec.size()-1]/(n*m)):(0));
    // cout<<vec.size()<<" "<<((vec.size())?((ld)vec[vec.size()-1]/(n*m)):(0))<<endl;
    if (bb<=0.015) return 3; 
    else if (bb<=0.15) return 2;
    else if (aa>=10) return 1;  
    else return 4;
}
// Normie28;

컴파일 시 표준 에러 (stderr) 메시지

artclass.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 47 / 100