oj.uz

Submission #724185

# Submission time Handle Problem Language Result Execution time Memory
724185 2023-04-14T19:52:59 Z Urvuk3 Art Class (IOI13_artclass) C++17
93 / 100
 164 ms 11224 KB 
#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],33,100);
    if(b3) return 3;
    bool b1=true;
    for(int i=0;i<6;i++) b1&=In(ret[i],6,23);
    if(b1) return 1;
    bool b2=true;
    for(int i=0;i<6;i++) b2&=In(ret[i],13,50);
    if(b2) return 2;
    return 4;
}

Subtask #1
93.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 4252 KB Output is correct
2 Correct 138 ms 9352 KB Output is correct
3 Correct 73 ms 4172 KB Output is correct
4 Correct 100 ms 5896 KB Output is correct
5 Correct 127 ms 7440 KB Output is correct
6 Correct 116 ms 7480 KB Output is correct
7 Correct 90 ms 7668 KB Output is correct
8 Correct 115 ms 9396 KB Output is correct
9 Correct 55 ms 4032 KB Output is correct
10 Correct 84 ms 5604 KB Output is correct
11 Correct 133 ms 8124 KB Output is correct
12 Correct 121 ms 8528 KB Output is correct
13 Correct 72 ms 3404 KB Output is correct
14 Correct 28 ms 2436 KB Output is correct
15 Incorrect 120 ms 8048 KB Output isn't correct
16 Correct 62 ms 4940 KB Output is correct
17 Correct 56 ms 4584 KB Output is correct
18 Correct 98 ms 5204 KB Output is correct
19 Correct 84 ms 4992 KB Output is correct
20 Correct 137 ms 8272 KB Output is correct
21 Correct 68 ms 4928 KB Output is correct
22 Correct 96 ms 6660 KB Output is correct
23 Correct 125 ms 9152 KB Output is correct
24 Correct 114 ms 7992 KB Output is correct
25 Correct 92 ms 6296 KB Output is correct
26 Correct 138 ms 9212 KB Output is correct
27 Incorrect 105 ms 5748 KB Output isn't correct
28 Correct 92 ms 6040 KB Output is correct
29 Correct 52 ms 4112 KB Output is correct
30 Correct 118 ms 9452 KB Output is correct
31 Correct 115 ms 7544 KB Output is correct
32 Correct 104 ms 6348 KB Output is correct
33 Incorrect 81 ms 4728 KB Output isn't correct
34 Correct 91 ms 4536 KB Output is correct
35 Incorrect 90 ms 5716 KB Output isn't correct
36 Correct 109 ms 7248 KB Output is correct
37 Correct 108 ms 5016 KB Output is correct
38 Correct 81 ms 4116 KB Output is correct
39 Correct 64 ms 3364 KB Output is correct
40 Correct 66 ms 5624 KB Output is correct
41 Correct 128 ms 9328 KB Output is correct
42 Correct 107 ms 5068 KB Output is correct
43 Correct 93 ms 5708 KB Output is correct
44 Correct 21 ms 3460 KB Output is correct
45 Correct 84 ms 7492 KB Output is correct
46 Correct 77 ms 3780 KB Output is correct
47 Incorrect 115 ms 7728 KB Output isn't correct
48 Incorrect 77 ms 5852 KB Output isn't correct
49 Correct 91 ms 4224 KB Output is correct
50 Correct 61 ms 6032 KB Output is correct
51 Correct 107 ms 7700 KB Output is correct
52 Correct 73 ms 5308 KB Output is correct
53 Correct 75 ms 4196 KB Output is correct
54 Correct 91 ms 3972 KB Output is correct
55 Correct 137 ms 11224 KB Output is correct
56 Correct 75 ms 5828 KB Output is correct
57 Incorrect 141 ms 7380 KB Output isn't correct
58 Incorrect 92 ms 5468 KB Output isn't correct
59 Correct 86 ms 4096 KB Output is correct
60 Correct 102 ms 4428 KB Output is correct
61 Correct 72 ms 2848 KB Output is correct
62 Incorrect 91 ms 6368 KB Output isn't correct
63 Correct 109 ms 7900 KB Output is correct
64 Correct 81 ms 5616 KB Output is correct
65 Correct 137 ms 6580 KB Output is correct
66 Correct 78 ms 3916 KB Output is correct
67 Correct 90 ms 4116 KB Output is correct
68 Correct 67 ms 4312 KB Output is correct
69 Correct 140 ms 8780 KB Output is correct
70 Correct 93 ms 4980 KB Output is correct
71 Correct 117 ms 5912 KB Output is correct
72 Correct 55 ms 4648 KB Output is correct
73 Correct 99 ms 5144 KB Output is correct
74 Correct 80 ms 4848 KB Output is correct
75 Correct 75 ms 3276 KB Output is correct
76 Correct 58 ms 4328 KB Output is correct
77 Correct 119 ms 9380 KB Output is correct
78 Correct 82 ms 4392 KB Output is correct
79 Correct 106 ms 7572 KB Output is correct
80 Correct 89 ms 3984 KB Output is correct
81 Correct 54 ms 2828 KB Output is correct
82 Correct 66 ms 4420 KB Output is correct
83 Correct 142 ms 7996 KB Output is correct
84 Correct 164 ms 9700 KB Output is correct
85 Correct 65 ms 4316 KB Output is correct
86 Correct 84 ms 4872 KB Output is correct
87 Correct 113 ms 7860 KB Output is correct
88 Correct 91 ms 4172 KB Output is correct
89 Correct 62 ms 4752 KB Output is correct
90 Correct 128 ms 8460 KB Output is correct
91 Correct 134 ms 7812 KB Output is correct
92 Incorrect 129 ms 8676 KB Output isn't correct
93 Correct 105 ms 5436 KB Output is correct
94 Correct 68 ms 4256 KB Output is correct
95 Incorrect 131 ms 6220 KB Output isn't correct
96 Correct 74 ms 4072 KB Output is correct
97 Correct 148 ms 8828 KB Output is correct
98 Incorrect 100 ms 6612 KB Output isn't correct
99 Incorrect 94 ms 5628 KB Output isn't correct
100 Correct 74 ms 5196 KB Output is correct
101 Correct 87 ms 3944 KB Output is correct
102 Correct 75 ms 4240 KB Output is correct