oj.uz

답안 #471742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
471742 2021-09-10T15:56:26 Z NhatMinh0208 미술 수업 (IOI13_artclass) C++14
0 / 100
 84 ms 15368 KB 
#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.01) return 3; 
    if (bb>=0.2 && aa<=10) return 4;
    if (aa>=15) return 1;
    return 2;
}
// Normie28;

Compilation message

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

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 9164 KB Output isn't correct
2 Incorrect 80 ms 8572 KB Output isn't correct
3 Incorrect 38 ms 4296 KB Output isn't correct
4 Incorrect 74 ms 6468 KB Output isn't correct
5 Incorrect 54 ms 6340 KB Output isn't correct
6 Incorrect 60 ms 8824 KB Output isn't correct
7 Incorrect 65 ms 12012 KB Output isn't correct
8 Incorrect 57 ms 9344 KB Output isn't correct
9 Incorrect 55 ms 8128 KB Output isn't correct
10 Incorrect 75 ms 14448 KB Output isn't correct
11 Incorrect 73 ms 8112 KB Output isn't correct
12 Incorrect 72 ms 8516 KB Output isn't correct
13 Incorrect 45 ms 5188 KB Output isn't correct
14 Incorrect 70 ms 6648 KB Output isn't correct
15 Incorrect 46 ms 5128 KB Output isn't correct
16 Incorrect 77 ms 13916 KB Output isn't correct
17 Incorrect 60 ms 7796 KB Output isn't correct
18 Incorrect 84 ms 7280 KB Output isn't correct
19 Incorrect 62 ms 12952 KB Output isn't correct
20 Incorrect 59 ms 8132 KB Output isn't correct
21 Incorrect 73 ms 9808 KB Output isn't correct
22 Incorrect 58 ms 7000 KB Output isn't correct
23 Incorrect 61 ms 8132 KB Output isn't correct
24 Incorrect 37 ms 4272 KB Output isn't correct
25 Incorrect 73 ms 10052 KB Output isn't correct
26 Incorrect 52 ms 10988 KB Output isn't correct
27 Incorrect 48 ms 8388 KB Output isn't correct
28 Incorrect 29 ms 3572 KB Output isn't correct
29 Incorrect 65 ms 10844 KB Output isn't correct
30 Incorrect 61 ms 7060 KB Output isn't correct
31 Incorrect 36 ms 4164 KB Output isn't correct
32 Incorrect 78 ms 9900 KB Output isn't correct
33 Incorrect 59 ms 6984 KB Output isn't correct
34 Incorrect 62 ms 7108 KB Output isn't correct
35 Incorrect 55 ms 7144 KB Output isn't correct
36 Incorrect 61 ms 9216 KB Output isn't correct
37 Incorrect 75 ms 8232 KB Output isn't correct
38 Incorrect 64 ms 13320 KB Output isn't correct
39 Incorrect 77 ms 9156 KB Output isn't correct
40 Incorrect 42 ms 5236 KB Output isn't correct
41 Incorrect 55 ms 6320 KB Output isn't correct
42 Incorrect 73 ms 8128 KB Output isn't correct
43 Incorrect 77 ms 7384 KB Output isn't correct
44 Incorrect 62 ms 8416 KB Output isn't correct
45 Incorrect 62 ms 7296 KB Output isn't correct
46 Incorrect 57 ms 8136 KB Output isn't correct
47 Incorrect 69 ms 10364 KB Output isn't correct
48 Incorrect 59 ms 6812 KB Output isn't correct
49 Incorrect 78 ms 8100 KB Output isn't correct
50 Incorrect 65 ms 10688 KB Output isn't correct
51 Incorrect 61 ms 8472 KB Output isn't correct
52 Incorrect 44 ms 10068 KB Output isn't correct
53 Incorrect 63 ms 8100 KB Output isn't correct
54 Incorrect 60 ms 6824 KB Output isn't correct
55 Incorrect 60 ms 13036 KB Output isn't correct
56 Incorrect 77 ms 8540 KB Output isn't correct
57 Incorrect 16 ms 2124 KB Output isn't correct
58 Incorrect 56 ms 12832 KB Output isn't correct
59 Incorrect 60 ms 6968 KB Output isn't correct
60 Incorrect 45 ms 11028 KB Output isn't correct
61 Incorrect 44 ms 7588 KB Output isn't correct
62 Incorrect 64 ms 13624 KB Output isn't correct
63 Incorrect 60 ms 6980 KB Output isn't correct
64 Incorrect 34 ms 3732 KB Output isn't correct
65 Incorrect 72 ms 10316 KB Output isn't correct
66 Incorrect 60 ms 10704 KB Output isn't correct
67 Incorrect 55 ms 6336 KB Output isn't correct
68 Incorrect 62 ms 8132 KB Output isn't correct
69 Incorrect 51 ms 11332 KB Output isn't correct
70 Incorrect 54 ms 9716 KB Output isn't correct
71 Incorrect 49 ms 12312 KB Output isn't correct
72 Incorrect 41 ms 9156 KB Output isn't correct
73 Incorrect 63 ms 9024 KB Output isn't correct
74 Incorrect 19 ms 8588 KB Output isn't correct
75 Incorrect 57 ms 6704 KB Output isn't correct
76 Incorrect 46 ms 8616 KB Output isn't correct
77 Incorrect 58 ms 8060 KB Output isn't correct
78 Incorrect 57 ms 6660 KB Output isn't correct
79 Incorrect 62 ms 9924 KB Output isn't correct
80 Incorrect 30 ms 3568 KB Output isn't correct
81 Incorrect 58 ms 6736 KB Output isn't correct
82 Incorrect 63 ms 8164 KB Output isn't correct
83 Incorrect 57 ms 6364 KB Output isn't correct
84 Incorrect 63 ms 6912 KB Output isn't correct
85 Incorrect 69 ms 7968 KB Output isn't correct
86 Incorrect 69 ms 8900 KB Output isn't correct
87 Incorrect 71 ms 9260 KB Output isn't correct
88 Incorrect 55 ms 6404 KB Output isn't correct
89 Incorrect 73 ms 9780 KB Output isn't correct
90 Incorrect 73 ms 8980 KB Output isn't correct
91 Incorrect 65 ms 11204 KB Output isn't correct
92 Incorrect 37 ms 4252 KB Output isn't correct
93 Incorrect 52 ms 7884 KB Output isn't correct
94 Incorrect 71 ms 13344 KB Output isn't correct
95 Incorrect 58 ms 13772 KB Output isn't correct
96 Incorrect 47 ms 5800 KB Output isn't correct
97 Incorrect 66 ms 15368 KB Output isn't correct
98 Incorrect 57 ms 6352 KB Output isn't correct
99 Incorrect 55 ms 6884 KB Output isn't correct
100 Incorrect 62 ms 11952 KB Output isn't correct
101 Incorrect 49 ms 5816 KB Output isn't correct
102 Incorrect 45 ms 5372 KB Output isn't correct