oj.uz

Submission #681347

# Submission time Handle Problem Language Result Execution time Memory
681347 2023-01-12T19:16:37 Z whqkrtk04 Art Class (IOI13_artclass) C++17
100 / 100
 65 ms 3940 KB 
#include "artclass.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi first
#define se second
const int INF = 1e9+1;
const int P = 1000000007;
const ll LLINF = (ll)1e18+1;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) { for(auto i : v) os << i << " "; os << "\n"; return os; }
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << p.fi << " " << p.se; return os; }

double diffx(int arr[500][500], int i, int j) {
    if(!j) return 0;
    return abs(arr[i][j]-arr[i][j-1]);
}

double diffy(int arr[500][500], int i, int j) {
    if(!i) return 0;
    return abs(arr[i][j]-arr[i-1][j]);
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    double a = 0, b = 0, d = 0, e = 0, f = 0;
    int c = 0;
    vector<double> A(W);
    for(int i = 0; i < H; i++) {
        for(int j = 0; j < W; j++) {
            A[j] += (double)(G[i][j]+R[i][j]+B[i][j])/H;
            double xx = diffx(R, i, j)+diffx(G, i, j)+diffx(B, i, j);
            double yy = diffy(R, i, j)+diffy(G, i, j)+diffy(B, i, j);
            a += xx/H/(W-1)/2;
            a += yy/(H-1)/W/2;
            d += xx/H/(W-1)/2;
            b += (double)G[i][j]/H/W;
            e += (double)R[i][j]/H/W;
            f += (double)B[i][j]/H/W;
            if(R[i][j] < 5 || G[i][j] < 5 || B[i][j] < 5
            || R[i][j] > 250 || G[i][j] > 250 || B[i][j] > 250) c++;
        }
    }
    double w = 0;
    for(int i = 1; i < W; i++) w += abs(A[i]-A[i-1])/(W-1);
    //cout << w << "\n";
    double z = a+5*d;
    if(z < 25 || a < 7.5 || d < 2.5 || w < 2) return 4;
    if(a < 40) {
        //cout << "1 or 2 : " << c << " " << z << " " << f << "\n";
        if(c > 30000 || z < 70 || f > 90 || w > 6) return 1;
    } else {
        //cout << "2 or 3 : " << a << " " << d << "\n";
        if(a > 70 || d > 30 || f > 90 || w > 6) return 3;
    }
    //cout << a << " " << b << " " << c << " " << d << " " << z << " " << e << " " << f << "\n";
    return 2;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 3196 KB Output is correct
2 Incorrect 39 ms 2488 KB Output isn't correct
3 Correct 41 ms 3180 KB Output is correct
4 Correct 41 ms 2500 KB Output is correct
5 Correct 25 ms 3140 KB Output is correct
6 Correct 42 ms 3148 KB Output is correct
7 Correct 42 ms 3148 KB Output is correct
8 Correct 59 ms 2692 KB Output is correct
9 Correct 43 ms 3216 KB Output is correct
10 Incorrect 50 ms 3192 KB Output isn't correct
11 Correct 44 ms 2764 KB Output is correct
12 Correct 39 ms 2568 KB Output is correct
13 Incorrect 43 ms 3172 KB Output isn't correct
14 Correct 60 ms 2712 KB Output is correct
15 Correct 55 ms 2720 KB Output is correct
16 Correct 45 ms 3148 KB Output is correct
17 Correct 34 ms 3216 KB Output is correct
18 Correct 31 ms 3220 KB Output is correct
19 Correct 37 ms 3124 KB Output is correct
20 Correct 51 ms 3192 KB Output is correct
21 Correct 39 ms 2640 KB Output is correct
22 Correct 43 ms 2836 KB Output is correct
23 Correct 11 ms 876 KB Output is correct
24 Correct 44 ms 2656 KB Output is correct
25 Correct 27 ms 1784 KB Output is correct
26 Correct 50 ms 3164 KB Output is correct
27 Correct 43 ms 3156 KB Output is correct
28 Correct 51 ms 3144 KB Output is correct
29 Correct 52 ms 3188 KB Output is correct
30 Correct 38 ms 2380 KB Output is correct
31 Correct 53 ms 3136 KB Output is correct
32 Correct 44 ms 3180 KB Output is correct
33 Correct 44 ms 3284 KB Output is correct
34 Correct 52 ms 3152 KB Output is correct
35 Correct 26 ms 1788 KB Output is correct
36 Correct 50 ms 3156 KB Output is correct
37 Correct 44 ms 3180 KB Output is correct
38 Correct 34 ms 2240 KB Output is correct
39 Correct 42 ms 2588 KB Output is correct
40 Incorrect 41 ms 2388 KB Output isn't correct
41 Correct 40 ms 3156 KB Output is correct
42 Correct 35 ms 3144 KB Output is correct
43 Correct 13 ms 3156 KB Output is correct
44 Correct 48 ms 3100 KB Output is correct
45 Correct 34 ms 3156 KB Output is correct
46 Correct 40 ms 3104 KB Output is correct
47 Correct 41 ms 3224 KB Output is correct
48 Correct 33 ms 3188 KB Output is correct
49 Correct 39 ms 2336 KB Output is correct
50 Incorrect 52 ms 3220 KB Output isn't correct
51 Incorrect 43 ms 2760 KB Output isn't correct
52 Correct 53 ms 3300 KB Output is correct
53 Correct 23 ms 1492 KB Output is correct
54 Correct 47 ms 2616 KB Output is correct
55 Correct 63 ms 3224 KB Output is correct
56 Correct 48 ms 3120 KB Output is correct
57 Correct 45 ms 2608 KB Output is correct
58 Correct 44 ms 2828 KB Output is correct
59 Correct 35 ms 3148 KB Output is correct
60 Correct 41 ms 3308 KB Output is correct
61 Correct 43 ms 3196 KB Output is correct
62 Correct 60 ms 3148 KB Output is correct
63 Correct 44 ms 3220 KB Output is correct
64 Correct 47 ms 3148 KB Output is correct
65 Correct 28 ms 1756 KB Output is correct
66 Correct 28 ms 1760 KB Output is correct
67 Correct 40 ms 2380 KB Output is correct
68 Correct 44 ms 2632 KB Output is correct
69 Correct 53 ms 3196 KB Output is correct
70 Correct 43 ms 3156 KB Output is correct
71 Correct 42 ms 2636 KB Output is correct
72 Correct 46 ms 2800 KB Output is correct
73 Correct 36 ms 2024 KB Output is correct
74 Correct 30 ms 3148 KB Output is correct
75 Incorrect 57 ms 3204 KB Output isn't correct
76 Correct 35 ms 2092 KB Output is correct
77 Correct 40 ms 2492 KB Output is correct
78 Correct 43 ms 3144 KB Output is correct
79 Correct 24 ms 1656 KB Output is correct
80 Correct 45 ms 2800 KB Output is correct
81 Incorrect 51 ms 3124 KB Output isn't correct
82 Correct 50 ms 3144 KB Output is correct
83 Correct 43 ms 3128 KB Output is correct
84 Correct 42 ms 2400 KB Output is correct
85 Correct 47 ms 3144 KB Output is correct
86 Correct 42 ms 2540 KB Output is correct
87 Incorrect 43 ms 3184 KB Output isn't correct
88 Correct 50 ms 3116 KB Output is correct
89 Correct 65 ms 3184 KB Output is correct
90 Correct 51 ms 3620 KB Output is correct
91 Correct 34 ms 3600 KB Output is correct
92 Correct 34 ms 2568 KB Output is correct
93 Correct 38 ms 3556 KB Output is correct
94 Correct 31 ms 3608 KB Output is correct
95 Correct 50 ms 3600 KB Output is correct
96 Correct 41 ms 3940 KB Output is correct
97 Correct 43 ms 3336 KB Output is correct
98 Correct 40 ms 3256 KB Output is correct
99 Correct 38 ms 2864 KB Output is correct
100 Incorrect 32 ms 2636 KB Output isn't correct
101 Correct 61 ms 3876 KB Output is correct
102 Correct 24 ms 1996 KB Output is correct