oj.uz

Submission #724204

# Submission time Handle Problem Language Result Execution time Memory
724204 2023-04-14T21:14:42 Z Urvuk3 Art Class (IOI13_artclass) C++17
51 / 100
 97 ms 25656 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);
}

void Dfs(int i,int j){
    visited[i][j]=true;
    for(int d=0;d<4;d++){
        int i1=i+di[d];
        int j1=j+dj[d];
        if(!Valid(i1,j1)) continue;
        ll dif=0;
        dif+=abs(Rg[i][j]-Rg[i1][j1]);
        dif+=abs(Gg[i][j]-Gg[i1][j1]);
        dif+=abs(Bg[i][j]-Bg[i1][j1]);
        if(!visited[i1][j1] && dif<=20){
            Dfs(i1,j1);
        }
    }
}

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;
    for(int i=0;i<500;i++){
        for(int j=0;j<500;j++){
            Rg[i][j]=R[i][j];
            Gg[i][j]=G[i][j];
            Bg[i][j]=B[i][j];
        }
    }
    di={-1,0,1,0};
    dj={0,1,0,-1};
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(!visited[i][j]){
                Dfs(i,j);
                comps++;
            }
        }
    }
    di={-1,1};
    dj={0,0};
    ll Rv=0,Gv=0,Bv=0;
    int greens=0;
    int yellows=0;
    for(int i=0;i<Hg;i++){
        for(int j=0;j<Wg;j++){
            if(R[i][j]-G[i][j]>=30 && R[i][j]-B[i][j]>=30) greens++;
            if(R[i][j]-G[i][j]<=30) yellows++;
            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;
    vector<ll> ret={Rv,Gv,Bv,Rh,Gh,Bh};
    //Debug(greens+yellows);
    //Debug(comps);
    bool b1=true;
    for(int i=0;i<3;i++) b1&=In(ret[i],6,20);
    b1|=(comps<11503);
    if(b1) return 1;
    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,10);
    if(b4) return 4;
    bool b3=true;
    for(int i=0;i<6;i++) b3&=In(ret[i],33,100);
    if(b3) return 3;
    return 2;
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:142:8: warning: unused variable 'similar' [-Wunused-variable]
  142 |     ll similar=0;
      |        ^~~~~~~
artclass.cpp:143:8: warning: unused variable 'disimilar' [-Wunused-variable]
  143 |     ll disimilar=0;
      |        ^~~~~~~~~

Subtask #1
51.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 5260 KB Output is correct
2 Correct 56 ms 6596 KB Output is correct
3 Correct 53 ms 6300 KB Output is correct
4 Incorrect 97 ms 6656 KB Output isn't correct
5 Incorrect 59 ms 18440 KB Output isn't correct
6 Correct 54 ms 8424 KB Output is correct
7 Incorrect 71 ms 6548 KB Output isn't correct
8 Correct 67 ms 9408 KB Output is correct
9 Correct 41 ms 6624 KB Output is correct
10 Incorrect 60 ms 17888 KB Output isn't correct
11 Correct 69 ms 6420 KB Output is correct
12 Correct 63 ms 5080 KB Output is correct
13 Correct 58 ms 6576 KB Output is correct
14 Incorrect 64 ms 20296 KB Output isn't correct
15 Correct 60 ms 8876 KB Output is correct
16 Correct 67 ms 10956 KB Output is correct
17 Correct 73 ms 7728 KB Output is correct
18 Incorrect 62 ms 25656 KB Output isn't correct
19 Correct 53 ms 6024 KB Output is correct
20 Correct 56 ms 7488 KB Output is correct
21 Correct 40 ms 6348 KB Output is correct
22 Incorrect 55 ms 12720 KB Output isn't correct
23 Incorrect 42 ms 15592 KB Output isn't correct
24 Incorrect 51 ms 5676 KB Output isn't correct
25 Correct 64 ms 5792 KB Output is correct
26 Correct 87 ms 8948 KB Output is correct
27 Correct 57 ms 5864 KB Output is correct
28 Incorrect 58 ms 16260 KB Output isn't correct
29 Correct 48 ms 6348 KB Output is correct
30 Correct 52 ms 6372 KB Output is correct
31 Correct 74 ms 6796 KB Output is correct
32 Incorrect 58 ms 17552 KB Output isn't correct
33 Incorrect 41 ms 13004 KB Output isn't correct
34 Correct 42 ms 5160 KB Output is correct
35 Correct 85 ms 11716 KB Output is correct
36 Incorrect 74 ms 18108 KB Output isn't correct
37 Correct 62 ms 5656 KB Output is correct
38 Correct 41 ms 4528 KB Output is correct
39 Incorrect 50 ms 16860 KB Output isn't correct
40 Incorrect 72 ms 12688 KB Output isn't correct
41 Correct 45 ms 6348 KB Output is correct
42 Correct 58 ms 6000 KB Output is correct
43 Correct 69 ms 6376 KB Output is correct
44 Correct 16 ms 3796 KB Output is correct
45 Incorrect 64 ms 19120 KB Output isn't correct
46 Correct 67 ms 6928 KB Output is correct
47 Correct 46 ms 10204 KB Output is correct
48 Correct 65 ms 11352 KB Output is correct
49 Incorrect 60 ms 14832 KB Output isn't correct
50 Incorrect 63 ms 19612 KB Output isn't correct
51 Incorrect 75 ms 7372 KB Output isn't correct
52 Incorrect 69 ms 7244 KB Output isn't correct
53 Correct 70 ms 6896 KB Output is correct
54 Correct 59 ms 6148 KB Output is correct
55 Incorrect 67 ms 22172 KB Output isn't correct
56 Correct 53 ms 7168 KB Output is correct
57 Correct 55 ms 5704 KB Output is correct
58 Incorrect 18 ms 8932 KB Output isn't correct
59 Correct 54 ms 5852 KB Output is correct
60 Correct 58 ms 5980 KB Output is correct
61 Correct 61 ms 8208 KB Output is correct
62 Correct 74 ms 6056 KB Output is correct
63 Correct 39 ms 6296 KB Output is correct
64 Correct 36 ms 4940 KB Output is correct
65 Correct 61 ms 6432 KB Output is correct
66 Incorrect 65 ms 17100 KB Output isn't correct
67 Correct 57 ms 6772 KB Output is correct
68 Correct 50 ms 6356 KB Output is correct
69 Correct 60 ms 11120 KB Output is correct
70 Incorrect 75 ms 23884 KB Output isn't correct
71 Correct 55 ms 6320 KB Output is correct
72 Correct 55 ms 6864 KB Output is correct
73 Correct 59 ms 7824 KB Output is correct
74 Correct 34 ms 4752 KB Output is correct
75 Correct 85 ms 12516 KB Output is correct
76 Correct 79 ms 11976 KB Output is correct
77 Correct 51 ms 7876 KB Output is correct
78 Correct 56 ms 6044 KB Output is correct
79 Correct 62 ms 6796 KB Output is correct
80 Incorrect 59 ms 19916 KB Output isn't correct
81 Correct 35 ms 4880 KB Output is correct
82 Incorrect 61 ms 20720 KB Output isn't correct
83 Correct 49 ms 5588 KB Output is correct
84 Incorrect 57 ms 15216 KB Output isn't correct
85 Correct 64 ms 5876 KB Output is correct
86 Correct 39 ms 4760 KB Output is correct
87 Correct 49 ms 5636 KB Output is correct
88 Incorrect 60 ms 17664 KB Output isn't correct
89 Incorrect 50 ms 5624 KB Output isn't correct
90 Correct 31 ms 4532 KB Output is correct
91 Correct 53 ms 6620 KB Output is correct
92 Incorrect 46 ms 17768 KB Output isn't correct
93 Correct 43 ms 9832 KB Output is correct
94 Incorrect 58 ms 12724 KB Output isn't correct
95 Correct 55 ms 7864 KB Output is correct
96 Correct 60 ms 11056 KB Output is correct
97 Correct 67 ms 10692 KB Output is correct
98 Correct 56 ms 5748 KB Output is correct
99 Correct 69 ms 8836 KB Output is correct
100 Correct 29 ms 4464 KB Output is correct
101 Correct 51 ms 5916 KB Output is correct
102 Incorrect 51 ms 13444 KB Output isn't correct