oj.uz

Submission #471732

# Submission time Handle Problem Language Result Execution time Memory
471732 2021-09-10T14:53:53 Z NhatMinh0208 Art Class (IOI13_artclass) C++14
47 / 100
 78 ms 16576 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.015) return 3; 
    else if (bb<=0.15) return 2;
    else if (aa>=10) return 1;  
    else return 4;
}
// Normie28;

Compilation message

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

Subtask #1
47.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 9528 KB Output is correct
2 Correct 60 ms 9680 KB Output is correct
3 Incorrect 57 ms 7880 KB Output isn't correct
4 Incorrect 37 ms 5060 KB Output isn't correct
5 Incorrect 39 ms 6164 KB Output isn't correct
6 Incorrect 45 ms 9332 KB Output isn't correct
7 Correct 53 ms 7336 KB Output is correct
8 Correct 61 ms 14264 KB Output is correct
9 Correct 48 ms 13040 KB Output is correct
10 Incorrect 69 ms 10340 KB Output isn't correct
11 Correct 72 ms 11728 KB Output is correct
12 Correct 43 ms 6084 KB Output is correct
13 Correct 64 ms 8220 KB Output is correct
14 Correct 51 ms 7232 KB Output is correct
15 Correct 57 ms 14464 KB Output is correct
16 Correct 57 ms 7796 KB Output is correct
17 Correct 45 ms 6184 KB Output is correct
18 Incorrect 63 ms 9844 KB Output isn't correct
19 Correct 70 ms 11760 KB Output is correct
20 Correct 59 ms 14348 KB Output is correct
21 Correct 47 ms 6596 KB Output is correct
22 Incorrect 66 ms 10312 KB Output isn't correct
23 Incorrect 68 ms 10140 KB Output isn't correct
24 Correct 55 ms 9144 KB Output is correct
25 Incorrect 70 ms 11620 KB Output isn't correct
26 Correct 62 ms 12356 KB Output is correct
27 Correct 58 ms 14660 KB Output is correct
28 Incorrect 69 ms 11972 KB Output isn't correct
29 Correct 63 ms 16576 KB Output is correct
30 Correct 58 ms 9380 KB Output is correct
31 Incorrect 58 ms 7876 KB Output isn't correct
32 Incorrect 48 ms 10428 KB Output isn't correct
33 Correct 53 ms 7364 KB Output is correct
34 Correct 60 ms 8156 KB Output is correct
35 Correct 57 ms 9268 KB Output is correct
36 Correct 52 ms 7444 KB Output is correct
37 Correct 57 ms 7804 KB Output is correct
38 Correct 72 ms 16256 KB Output is correct
39 Incorrect 68 ms 10640 KB Output isn't correct
40 Correct 65 ms 12296 KB Output is correct
41 Correct 55 ms 8096 KB Output is correct
42 Correct 60 ms 14048 KB Output is correct
43 Correct 45 ms 5908 KB Output is correct
44 Correct 60 ms 8388 KB Output is correct
45 Correct 21 ms 8652 KB Output is correct
46 Correct 37 ms 5124 KB Output is correct
47 Incorrect 57 ms 8960 KB Output isn't correct
48 Incorrect 69 ms 10828 KB Output isn't correct
49 Incorrect 72 ms 11076 KB Output isn't correct
50 Correct 57 ms 9156 KB Output is correct
51 Correct 63 ms 15448 KB Output is correct
52 Incorrect 45 ms 9564 KB Output isn't correct
53 Correct 52 ms 13592 KB Output is correct
54 Correct 54 ms 10832 KB Output is correct
55 Correct 54 ms 9020 KB Output is correct
56 Correct 64 ms 13160 KB Output is correct
57 Correct 42 ms 8452 KB Output is correct
58 Incorrect 57 ms 10436 KB Output isn't correct
59 Correct 36 ms 5060 KB Output is correct
60 Incorrect 78 ms 9928 KB Output isn't correct
61 Correct 31 ms 4340 KB Output is correct
62 Correct 44 ms 11712 KB Output is correct
63 Correct 70 ms 11612 KB Output is correct
64 Correct 43 ms 8640 KB Output is correct
65 Incorrect 61 ms 7760 KB Output isn't correct
66 Correct 59 ms 9452 KB Output is correct
67 Correct 49 ms 11824 KB Output is correct
68 Correct 42 ms 10820 KB Output is correct
69 Incorrect 58 ms 8056 KB Output isn't correct
70 Incorrect 48 ms 6704 KB Output isn't correct
71 Correct 63 ms 12180 KB Output is correct
72 Incorrect 57 ms 10052 KB Output isn't correct
73 Correct 60 ms 12892 KB Output is correct
74 Correct 61 ms 9260 KB Output is correct
75 Correct 55 ms 7784 KB Output is correct
76 Incorrect 53 ms 7324 KB Output isn't correct
77 Correct 51 ms 8960 KB Output is correct
78 Correct 56 ms 7960 KB Output is correct
79 Correct 50 ms 12224 KB Output is correct
80 Correct 67 ms 14688 KB Output is correct
81 Correct 60 ms 9204 KB Output is correct
82 Correct 63 ms 8384 KB Output is correct
83 Correct 56 ms 9720 KB Output is correct
84 Correct 60 ms 7644 KB Output is correct
85 Incorrect 70 ms 9788 KB Output isn't correct
86 Correct 62 ms 8464 KB Output is correct
87 Correct 14 ms 2124 KB Output is correct
88 Incorrect 69 ms 12012 KB Output isn't correct
89 Correct 41 ms 9976 KB Output is correct
90 Correct 31 ms 3944 KB Output is correct
91 Correct 28 ms 3960 KB Output is correct
92 Correct 39 ms 9848 KB Output is correct
93 Incorrect 58 ms 7856 KB Output isn't correct
94 Incorrect 57 ms 7760 KB Output isn't correct
95 Incorrect 61 ms 10364 KB Output isn't correct
96 Incorrect 68 ms 10708 KB Output isn't correct
97 Correct 54 ms 7468 KB Output is correct
98 Incorrect 54 ms 7320 KB Output isn't correct
99 Incorrect 50 ms 8772 KB Output isn't correct
100 Correct 38 ms 5072 KB Output is correct
101 Incorrect 60 ms 9248 KB Output isn't correct
102 Incorrect 53 ms 7296 KB Output isn't correct