oj.uz

Submission #724184

# Submission time Handle Problem Language Result Execution time Memory
724184 2023-04-14T19:47:29 Z Urvuk3 Art Class (IOI13_artclass) C++17
78 / 100
 173 ms 11164 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],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.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 8560 KB Output is correct
2 Correct 87 ms 7516 KB Output is correct
3 Correct 64 ms 5216 KB Output is correct
4 Incorrect 101 ms 7676 KB Output isn't correct
5 Incorrect 95 ms 6564 KB Output isn't correct
6 Correct 118 ms 7448 KB Output is correct
7 Correct 83 ms 5000 KB Output is correct
8 Correct 108 ms 6680 KB Output is correct
9 Incorrect 86 ms 5732 KB Output isn't correct
10 Correct 84 ms 4872 KB Output is correct
11 Correct 93 ms 7828 KB Output is correct
12 Correct 57 ms 4592 KB Output is correct
13 Correct 114 ms 8060 KB Output is correct
14 Correct 90 ms 4120 KB Output is correct
15 Correct 26 ms 2300 KB Output is correct
16 Correct 111 ms 7852 KB Output is correct
17 Incorrect 91 ms 6220 KB Output isn't correct
18 Correct 103 ms 7976 KB Output is correct
19 Correct 119 ms 5024 KB Output is correct
20 Correct 80 ms 4348 KB Output is correct
21 Correct 141 ms 11164 KB Output is correct
22 Correct 50 ms 2884 KB Output is correct
23 Correct 89 ms 7740 KB Output is correct
24 Correct 108 ms 7608 KB Output is correct
25 Incorrect 55 ms 4292 KB Output isn't correct
26 Correct 122 ms 9356 KB Output is correct
27 Correct 104 ms 7492 KB Output is correct
28 Correct 76 ms 3724 KB Output is correct
29 Correct 126 ms 9260 KB Output is correct
30 Incorrect 92 ms 6560 KB Output isn't correct
31 Correct 64 ms 6012 KB Output is correct
32 Correct 106 ms 7568 KB Output is correct
33 Correct 118 ms 7144 KB Output is correct
34 Incorrect 110 ms 8760 KB Output isn't correct
35 Correct 93 ms 5388 KB Output is correct
36 Correct 127 ms 9448 KB Output is correct
37 Correct 93 ms 4116 KB Output is correct
38 Correct 87 ms 4104 KB Output is correct
39 Correct 77 ms 4300 KB Output is correct
40 Correct 112 ms 9380 KB Output is correct
41 Correct 91 ms 4960 KB Output is correct
42 Correct 93 ms 6420 KB Output is correct
43 Correct 114 ms 8812 KB Output is correct
44 Correct 87 ms 6348 KB Output is correct
45 Incorrect 112 ms 9348 KB Output isn't correct
46 Correct 68 ms 4972 KB Output is correct
47 Correct 86 ms 4484 KB Output is correct
48 Incorrect 70 ms 4068 KB Output isn't correct
49 Incorrect 101 ms 6756 KB Output isn't correct
50 Correct 70 ms 5140 KB Output is correct
51 Correct 73 ms 3292 KB Output is correct
52 Correct 24 ms 3348 KB Output is correct
53 Correct 76 ms 4276 KB Output is correct
54 Correct 66 ms 3416 KB Output is correct
55 Correct 120 ms 9224 KB Output is correct
56 Incorrect 127 ms 7372 KB Output isn't correct
57 Correct 92 ms 3916 KB Output is correct
58 Incorrect 84 ms 5620 KB Output isn't correct
59 Correct 58 ms 5908 KB Output is correct
60 Correct 86 ms 5220 KB Output is correct
61 Incorrect 75 ms 5824 KB Output isn't correct
62 Correct 72 ms 4168 KB Output is correct
63 Correct 64 ms 4520 KB Output is correct
64 Correct 73 ms 4172 KB Output is correct
65 Correct 62 ms 4176 KB Output is correct
66 Correct 72 ms 5712 KB Output is correct
67 Correct 69 ms 3296 KB Output is correct
68 Correct 117 ms 4912 KB Output is correct
69 Correct 57 ms 4128 KB Output is correct
70 Correct 76 ms 4076 KB Output is correct
71 Correct 116 ms 8948 KB Output is correct
72 Correct 119 ms 8276 KB Output is correct
73 Correct 89 ms 7716 KB Output is correct
74 Incorrect 111 ms 7956 KB Output isn't correct
75 Incorrect 81 ms 5552 KB Output isn't correct
76 Incorrect 78 ms 4740 KB Output isn't correct
77 Correct 173 ms 9740 KB Output is correct
78 Correct 85 ms 3968 KB Output is correct
79 Incorrect 97 ms 7880 KB Output isn't correct
80 Correct 107 ms 7884 KB Output is correct
81 Correct 97 ms 4156 KB Output is correct
82 Correct 93 ms 6092 KB Output is correct
83 Correct 84 ms 3836 KB Output is correct
84 Correct 62 ms 4696 KB Output is correct
85 Correct 99 ms 5072 KB Output is correct
86 Correct 101 ms 4516 KB Output is correct
87 Incorrect 83 ms 5804 KB Output isn't correct
88 Correct 98 ms 5844 KB Output is correct
89 Correct 67 ms 3916 KB Output is correct
90 Correct 66 ms 2904 KB Output is correct
91 Correct 132 ms 8452 KB Output is correct
92 Correct 53 ms 4052 KB Output is correct
93 Correct 63 ms 4368 KB Output is correct
94 Incorrect 85 ms 5584 KB Output isn't correct
95 Correct 113 ms 5808 KB Output is correct
96 Incorrect 98 ms 5640 KB Output isn't correct
97 Correct 98 ms 5712 KB Output is correct
98 Correct 81 ms 5196 KB Output is correct
99 Correct 128 ms 9180 KB Output is correct
100 Correct 83 ms 4784 KB Output is correct
101 Correct 51 ms 4852 KB Output is correct
102 Correct 102 ms 4444 KB Output is correct