oj.uz

Submission #724211

# Submission time Handle Problem Language Result Execution time Memory
724211 2023-04-14T21:45:37 Z Urvuk3 Art Class (IOI13_artclass) C++17
100 / 100
 109 ms 13688 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 visited[500][500];
int Rg[500][500],Gg[500][500],Bg[500][500];
vector<int> di,dj;
int comps;

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;
    di={-1,1};
    dj={0,0};
    ll Rv=0,Gv=0,Bv=0;
    set<pair<pii,int>> yellows,greens;
    for(int i=0;i<Hg;i++){
        for(int j=0;j<Wg;j++){
            Rg[i][j]=R[i][j];
            Gg[i][j]=G[i][j];
            Bg[i][j]=B[i][j];
            if(G[i][j]>R[i][j] && G[i][j]>B[i][j]) greens.insert({{R[i][j],G[i][j]},B[i][j]});
            else if(abs(R[i][j]-G[i][j])<=50 && max(R[i][j],G[i][j])-B[i][j]>40) yellows.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]);
                }
            }
        }
    }
    //Debug(sz(yellows));
    //Debug(sz(greens));
    vector<ll> ret={Rv,Gv,Bv,Rh,Gh,Bh};
    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;
    if(sz(yellows)+sz(greens)>=30000) return 2;
    bool b1=true;
    for(int i=0;i<3;i++) b1&=In(ret[i],6,20);
    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
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 8036 KB Output is correct
2 Incorrect 65 ms 9736 KB Output isn't correct
3 Correct 77 ms 8972 KB Output is correct
4 Correct 69 ms 10316 KB Output is correct
5 Correct 93 ms 13232 KB Output is correct
6 Incorrect 48 ms 7956 KB Output isn't correct
7 Correct 79 ms 11340 KB Output is correct
8 Correct 63 ms 9576 KB Output is correct
9 Correct 54 ms 5944 KB Output is correct
10 Incorrect 80 ms 8148 KB Output isn't correct
11 Correct 44 ms 6592 KB Output is correct
12 Correct 105 ms 13004 KB Output is correct
13 Correct 46 ms 9580 KB Output is correct
14 Correct 50 ms 8576 KB Output is correct
15 Incorrect 73 ms 10540 KB Output isn't correct
16 Correct 75 ms 10724 KB Output is correct
17 Correct 70 ms 10188 KB Output is correct
18 Correct 40 ms 7920 KB Output is correct
19 Correct 48 ms 8476 KB Output is correct
20 Correct 89 ms 10700 KB Output is correct
21 Correct 74 ms 10092 KB Output is correct
22 Correct 52 ms 8652 KB Output is correct
23 Correct 84 ms 11716 KB Output is correct
24 Correct 88 ms 11556 KB Output is correct
25 Correct 43 ms 8256 KB Output is correct
26 Correct 60 ms 8772 KB Output is correct
27 Correct 52 ms 5464 KB Output is correct
28 Correct 50 ms 8148 KB Output is correct
29 Correct 69 ms 10516 KB Output is correct
30 Correct 54 ms 8700 KB Output is correct
31 Correct 81 ms 10344 KB Output is correct
32 Correct 50 ms 8504 KB Output is correct
33 Correct 41 ms 5204 KB Output is correct
34 Correct 91 ms 13000 KB Output is correct
35 Correct 34 ms 7964 KB Output is correct
36 Correct 57 ms 7252 KB Output is correct
37 Correct 33 ms 7968 KB Output is correct
38 Correct 92 ms 11748 KB Output is correct
39 Correct 76 ms 11940 KB Output is correct
40 Correct 47 ms 8116 KB Output is correct
41 Correct 65 ms 8712 KB Output is correct
42 Correct 16 ms 2572 KB Output is correct
43 Correct 61 ms 8036 KB Output is correct
44 Correct 78 ms 11152 KB Output is correct
45 Correct 52 ms 8776 KB Output is correct
46 Correct 69 ms 8748 KB Output is correct
47 Correct 17 ms 6688 KB Output is correct
48 Correct 80 ms 10984 KB Output is correct
49 Correct 53 ms 7708 KB Output is correct
50 Correct 42 ms 6716 KB Output is correct
51 Correct 72 ms 9696 KB Output is correct
52 Correct 72 ms 9076 KB Output is correct
53 Correct 61 ms 9024 KB Output is correct
54 Correct 84 ms 7308 KB Output is correct
55 Correct 55 ms 8004 KB Output is correct
56 Correct 36 ms 5284 KB Output is correct
57 Correct 65 ms 9436 KB Output is correct
58 Incorrect 57 ms 9352 KB Output isn't correct
59 Correct 43 ms 7868 KB Output is correct
60 Incorrect 86 ms 10264 KB Output isn't correct
61 Correct 75 ms 10920 KB Output is correct
62 Incorrect 86 ms 11256 KB Output isn't correct
63 Correct 59 ms 8752 KB Output is correct
64 Correct 97 ms 12212 KB Output is correct
65 Correct 61 ms 8484 KB Output is correct
66 Correct 109 ms 12680 KB Output is correct
67 Correct 63 ms 9060 KB Output is correct
68 Correct 95 ms 13688 KB Output is correct
69 Correct 65 ms 8536 KB Output is correct
70 Correct 86 ms 9388 KB Output is correct
71 Correct 70 ms 8868 KB Output is correct
72 Correct 53 ms 8716 KB Output is correct
73 Correct 65 ms 9944 KB Output is correct
74 Correct 89 ms 11716 KB Output is correct
75 Correct 79 ms 10684 KB Output is correct
76 Correct 70 ms 8500 KB Output is correct
77 Incorrect 78 ms 9076 KB Output isn't correct
78 Correct 60 ms 10424 KB Output is correct
79 Correct 92 ms 10968 KB Output is correct
80 Correct 36 ms 7576 KB Output is correct
81 Correct 94 ms 9496 KB Output is correct
82 Incorrect 67 ms 9676 KB Output isn't correct
83 Correct 59 ms 9032 KB Output is correct
84 Correct 51 ms 8804 KB Output is correct
85 Correct 88 ms 12964 KB Output is correct
86 Correct 70 ms 8172 KB Output is correct
87 Correct 39 ms 5592 KB Output is correct
88 Correct 86 ms 11260 KB Output is correct
89 Correct 79 ms 10660 KB Output is correct
90 Correct 65 ms 8156 KB Output is correct
91 Correct 86 ms 10636 KB Output is correct
92 Correct 45 ms 6344 KB Output is correct
93 Correct 63 ms 9816 KB Output is correct
94 Correct 56 ms 9028 KB Output is correct
95 Correct 40 ms 7904 KB Output is correct
96 Correct 45 ms 6732 KB Output is correct
97 Correct 78 ms 11084 KB Output is correct
98 Correct 48 ms 8528 KB Output is correct
99 Correct 42 ms 7916 KB Output is correct
100 Correct 69 ms 9420 KB Output is correct
101 Correct 80 ms 9024 KB Output is correct
102 Correct 44 ms 8292 KB Output is correct