oj.uz

Submission #724197

# Submission time Handle Problem Language Result Execution time Memory
724197 2023-04-14T20:44:16 Z Urvuk3 Art Class (IOI13_artclass) C++17
67 / 100
 88 ms 3296 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;
    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)){
                    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]);
                }
            }
        }
    }
    vector<ll> ret={Rv,Gv,Bv,Rh,Gh,Bh};
    for(int i=0;i<sz(ret);i++) ret[i]/=(H*W);
    bool b4=true;
    for(int i=0;i<6;i++) b4&=In(ret[i],0,9);
    if(b4) return 4;
    bool b3=true;
    for(int i=0;i<6;i++) b3&=In(ret[i],33,200);
    if(b3) return 3;
    bool b1=true;
    for(int i=0;i<6;i++) b1&=In(ret[i],5,24);
    if(b1) return 1;
    return 2;
}

Subtask #1
67.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 3172 KB Output is correct
2 Incorrect 52 ms 3080 KB Output isn't correct
3 Correct 28 ms 1776 KB Output is correct
4 Correct 40 ms 2436 KB Output is correct
5 Correct 43 ms 2688 KB Output is correct
6 Correct 43 ms 3120 KB Output is correct
7 Correct 42 ms 3212 KB Output is correct
8 Correct 53 ms 3140 KB Output is correct
9 Incorrect 45 ms 2644 KB Output isn't correct
10 Incorrect 61 ms 3172 KB Output isn't correct
11 Incorrect 38 ms 3172 KB Output isn't correct
12 Correct 42 ms 2564 KB Output is correct
13 Correct 42 ms 2636 KB Output is correct
14 Correct 35 ms 3164 KB Output is correct
15 Correct 22 ms 1492 KB Output is correct
16 Correct 45 ms 3200 KB Output is correct
17 Correct 39 ms 1700 KB Output is correct
18 Correct 46 ms 2684 KB Output is correct
19 Correct 48 ms 3148 KB Output is correct
20 Correct 32 ms 2000 KB Output is correct
21 Correct 50 ms 3200 KB Output is correct
22 Incorrect 32 ms 2164 KB Output isn't correct
23 Correct 42 ms 2636 KB Output is correct
24 Correct 71 ms 3120 KB Output is correct
25 Correct 42 ms 3136 KB Output is correct
26 Correct 39 ms 2600 KB Output is correct
27 Correct 45 ms 2764 KB Output is correct
28 Correct 46 ms 3148 KB Output is correct
29 Incorrect 49 ms 3176 KB Output isn't correct
30 Correct 44 ms 2640 KB Output is correct
31 Correct 22 ms 1504 KB Output is correct
32 Correct 43 ms 2676 KB Output is correct
33 Correct 52 ms 3096 KB Output is correct
34 Correct 39 ms 3116 KB Output is correct
35 Incorrect 41 ms 2524 KB Output isn't correct
36 Incorrect 13 ms 3156 KB Output isn't correct
37 Correct 33 ms 3148 KB Output is correct
38 Incorrect 56 ms 3208 KB Output isn't correct
39 Correct 42 ms 3160 KB Output is correct
40 Correct 47 ms 3176 KB Output is correct
41 Incorrect 45 ms 2544 KB Output isn't correct
42 Correct 37 ms 2384 KB Output is correct
43 Correct 23 ms 1468 KB Output is correct
44 Incorrect 33 ms 3152 KB Output isn't correct
45 Correct 49 ms 3240 KB Output is correct
46 Incorrect 88 ms 3148 KB Output isn't correct
47 Correct 47 ms 3220 KB Output is correct
48 Correct 30 ms 3192 KB Output is correct
49 Correct 53 ms 3116 KB Output is correct
50 Correct 25 ms 3156 KB Output is correct
51 Correct 11 ms 852 KB Output is correct
52 Correct 37 ms 2380 KB Output is correct
53 Correct 47 ms 2692 KB Output is correct
54 Correct 70 ms 3148 KB Output is correct
55 Correct 39 ms 2400 KB Output is correct
56 Incorrect 40 ms 2484 KB Output isn't correct
57 Correct 43 ms 2636 KB Output is correct
58 Correct 36 ms 3148 KB Output is correct
59 Incorrect 40 ms 3180 KB Output isn't correct
60 Incorrect 50 ms 3212 KB Output isn't correct
61 Correct 27 ms 1752 KB Output is correct
62 Correct 50 ms 1968 KB Output is correct
63 Incorrect 55 ms 3140 KB Output isn't correct
64 Incorrect 43 ms 3144 KB Output isn't correct
65 Correct 33 ms 3172 KB Output is correct
66 Correct 35 ms 3196 KB Output is correct
67 Correct 49 ms 3156 KB Output is correct
68 Correct 44 ms 2716 KB Output is correct
69 Correct 36 ms 3200 KB Output is correct
70 Correct 47 ms 3216 KB Output is correct
71 Incorrect 48 ms 2512 KB Output isn't correct
72 Incorrect 46 ms 2644 KB Output isn't correct
73 Correct 50 ms 3220 KB Output is correct
74 Correct 44 ms 2788 KB Output is correct
75 Incorrect 41 ms 2560 KB Output isn't correct
76 Correct 36 ms 2208 KB Output is correct
77 Correct 53 ms 3200 KB Output is correct
78 Correct 42 ms 3148 KB Output is correct
79 Correct 41 ms 3168 KB Output is correct
80 Incorrect 44 ms 2852 KB Output isn't correct
81 Correct 45 ms 3220 KB Output is correct
82 Correct 43 ms 3212 KB Output is correct
83 Correct 51 ms 3220 KB Output is correct
84 Incorrect 53 ms 3164 KB Output isn't correct
85 Correct 38 ms 2112 KB Output is correct
86 Correct 44 ms 2560 KB Output is correct
87 Correct 44 ms 3104 KB Output is correct
88 Correct 57 ms 3296 KB Output is correct
89 Correct 43 ms 3100 KB Output is correct
90 Correct 35 ms 3220 KB Output is correct
91 Incorrect 43 ms 2636 KB Output isn't correct
92 Correct 34 ms 3208 KB Output is correct
93 Correct 42 ms 3148 KB Output is correct
94 Correct 42 ms 3132 KB Output is correct
95 Correct 41 ms 3184 KB Output is correct
96 Correct 42 ms 3176 KB Output is correct
97 Incorrect 44 ms 2492 KB Output isn't correct
98 Correct 51 ms 3148 KB Output is correct
99 Correct 41 ms 1756 KB Output is correct
100 Incorrect 44 ms 3212 KB Output isn't correct
101 Correct 30 ms 3192 KB Output is correct
102 Correct 28 ms 1972 KB Output is correct