oj.uz

Submission #724170

# Submission time Handle Problem Language Result Execution time Memory
724170 2023-04-14T19:05:46 Z Urvuk3 Art Class (IOI13_artclass) C++17
29 / 100
 78 ms 4500 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)

bool Valid(int i,int j){
    return (0<=i && i<500) && (0<=j && j<500);
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    vector<int> di={-1,1};
    vector<int> dj={0,0};
    ll difRv=0,difGv=0,difBv=0;
    for(int i=0;i<500;i++){
        for(int j=0;j<500;j++){
            for(int d=0;d<2;d++){
                int i1=i+di[d];
                int j1=j+dj[d];
                if(Valid(i1,j1)){
                    difRv+=abs(R[i][j]-R[i1][j1]);
                    difGv+=abs(G[i][j]-G[i1][j1]);
                    difBv+=abs(B[i][j]-B[i1][j1]);
                }
            }
        }
    }
    di={0,0};
    dj={-1,1};
    ll difRh=0,difGh=0,difBh=0;
    for(int i=0;i<500;i++){
        for(int j=0;j<500;j++){
            for(int d=0;d<2;d++){
                int i1=i+di[d];
                int j1=j+dj[d];
                if(Valid(i1,j1)){
                    difRh+=abs(R[i][j]-R[i1][j1]);
                    difGh+=abs(G[i][j]-G[i1][j1]);
                    difBh+=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<500;i++){
        for(int j=0;j<500;j++){
            for(int d=0;d<4;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<=1) similar++;
                    if(dif>=300) disimilar++;
                }
            }
        }
    }
    vector<ll> ret={difRv,difGv,difBv,difRh,difGh,difBh,similar,disimilar};
    if(difRv>=9e6 && difGv>=9e6 && difBv>=9e6){
        return 3;
    }
    else if(difRh<=39e5 && difGh<=39e5 && difBh<=39e5){
        return 4;
    }
    else{
        return 2;
    }
}

Subtask #1
29.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 3524 KB Output isn't correct
2 Correct 46 ms 4416 KB Output is correct
3 Incorrect 61 ms 4428 KB Output isn't correct
4 Correct 46 ms 4496 KB Output is correct
5 Correct 50 ms 3916 KB Output is correct
6 Correct 66 ms 4408 KB Output is correct
7 Correct 40 ms 3464 KB Output is correct
8 Incorrect 52 ms 4072 KB Output isn't correct
9 Correct 44 ms 4412 KB Output is correct
10 Correct 45 ms 4488 KB Output is correct
11 Correct 27 ms 3744 KB Output is correct
12 Correct 56 ms 4448 KB Output is correct
13 Correct 49 ms 4428 KB Output is correct
14 Correct 45 ms 3700 KB Output is correct
15 Incorrect 34 ms 3048 KB Output isn't correct
16 Incorrect 45 ms 3728 KB Output isn't correct
17 Correct 45 ms 4500 KB Output is correct
18 Incorrect 48 ms 3808 KB Output isn't correct
19 Correct 45 ms 3764 KB Output is correct
20 Incorrect 37 ms 2956 KB Output isn't correct
21 Correct 52 ms 3964 KB Output is correct
22 Correct 41 ms 3348 KB Output is correct
23 Incorrect 58 ms 4392 KB Output isn't correct
24 Incorrect 64 ms 4440 KB Output isn't correct
25 Incorrect 48 ms 4388 KB Output isn't correct
26 Correct 47 ms 3996 KB Output is correct
27 Incorrect 57 ms 4468 KB Output isn't correct
28 Correct 55 ms 4276 KB Output is correct
29 Correct 52 ms 3852 KB Output is correct
30 Incorrect 57 ms 4500 KB Output isn't correct
31 Correct 53 ms 4500 KB Output is correct
32 Incorrect 56 ms 4452 KB Output isn't correct
33 Incorrect 50 ms 4388 KB Output isn't correct
34 Incorrect 51 ms 4420 KB Output isn't correct
35 Incorrect 44 ms 2404 KB Output isn't correct
36 Incorrect 63 ms 4380 KB Output isn't correct
37 Incorrect 57 ms 4492 KB Output isn't correct
38 Correct 51 ms 4428 KB Output is correct
39 Incorrect 47 ms 3916 KB Output isn't correct
40 Incorrect 54 ms 3384 KB Output isn't correct
41 Incorrect 60 ms 4496 KB Output isn't correct
42 Correct 45 ms 4420 KB Output is correct
43 Incorrect 56 ms 4468 KB Output isn't correct
44 Correct 49 ms 4496 KB Output is correct
45 Incorrect 66 ms 4456 KB Output isn't correct
46 Correct 51 ms 4100 KB Output is correct
47 Correct 42 ms 3452 KB Output is correct
48 Incorrect 45 ms 4496 KB Output isn't correct
49 Correct 46 ms 3720 KB Output is correct
50 Incorrect 43 ms 4396 KB Output isn't correct
51 Correct 42 ms 4404 KB Output is correct
52 Correct 50 ms 4096 KB Output is correct
53 Incorrect 48 ms 3704 KB Output isn't correct
54 Correct 49 ms 4492 KB Output is correct
55 Incorrect 30 ms 2640 KB Output isn't correct
56 Incorrect 67 ms 4404 KB Output isn't correct
57 Correct 40 ms 4428 KB Output is correct
58 Correct 49 ms 3860 KB Output is correct
59 Incorrect 37 ms 2960 KB Output isn't correct
60 Correct 48 ms 4428 KB Output is correct
61 Correct 63 ms 4424 KB Output is correct
62 Correct 78 ms 4500 KB Output is correct
63 Correct 48 ms 4412 KB Output is correct
64 Correct 48 ms 4464 KB Output is correct
65 Correct 49 ms 4040 KB Output is correct
66 Incorrect 49 ms 3856 KB Output isn't correct
67 Correct 42 ms 4392 KB Output is correct
68 Incorrect 68 ms 4436 KB Output isn't correct
69 Correct 50 ms 4396 KB Output is correct
70 Incorrect 54 ms 4380 KB Output isn't correct
71 Correct 46 ms 4416 KB Output is correct
72 Correct 39 ms 4376 KB Output is correct
73 Incorrect 36 ms 4496 KB Output isn't correct
74 Correct 45 ms 3752 KB Output is correct
75 Correct 46 ms 3860 KB Output is correct
76 Correct 53 ms 3864 KB Output is correct
77 Correct 47 ms 4384 KB Output is correct
78 Correct 52 ms 3920 KB Output is correct
79 Incorrect 44 ms 3716 KB Output isn't correct
80 Correct 49 ms 3968 KB Output is correct
81 Correct 49 ms 4400 KB Output is correct
82 Incorrect 71 ms 4428 KB Output isn't correct
83 Correct 50 ms 3932 KB Output is correct
84 Incorrect 41 ms 4496 KB Output isn't correct
85 Correct 56 ms 4436 KB Output is correct
86 Correct 46 ms 3660 KB Output is correct
87 Incorrect 58 ms 4492 KB Output isn't correct
88 Correct 67 ms 3808 KB Output is correct
89 Incorrect 35 ms 3008 KB Output isn't correct
90 Correct 47 ms 3836 KB Output is correct
91 Correct 45 ms 4476 KB Output is correct
92 Correct 51 ms 4428 KB Output is correct
93 Correct 53 ms 4044 KB Output is correct
94 Correct 57 ms 4420 KB Output is correct
95 Correct 42 ms 4476 KB Output is correct
96 Incorrect 20 ms 1432 KB Output isn't correct
97 Incorrect 57 ms 4428 KB Output isn't correct
98 Incorrect 37 ms 3184 KB Output isn't correct
99 Incorrect 31 ms 2428 KB Output isn't correct
100 Correct 38 ms 4428 KB Output is correct
101 Correct 52 ms 4416 KB Output is correct
102 Correct 48 ms 4396 KB Output is correct