oj.uz

답안 #469622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469622 2021-09-01T13:18:44 Z alextodoran 미술 수업 (IOI13_artclass) C++17
76 / 100
 76 ms 6124 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>
#include "artclass.h"

using namespace std;

typedef long long ll;

const int HW_MAX = 500;

ll sq (ll a)
{
    if(a < 0)
        return -sqrt(-a);
    return sqrt(a);
}

int getMess (int H, int W, int R[HW_MAX][HW_MAX], int G[HW_MAX][HW_MAX], int B[HW_MAX][HW_MAX])
{
    ll res = 0;
    for(int i = 0; i < H; i++)
        for(int j = 0; j < W; j++)
        {
            if(i > 0)
            {
                ll val = abs((R[i][j] + G[i][j] + B[i][j]) - (R[i - 1][j] + G[i - 1][j] + B[i - 1][j]));
                res += val * val;
            }
            if(j > 0)
            {
                ll val = abs((R[i][j] + G[i][j] + B[i][j]) - (R[i][j - 1] + G[i][j - 1] + B[i][j - 1]));
                res += val * val;
            }
        }
    res = sq(res) * 1000;
    res /= (H * W);
    return res;
}
int getGreen (int H, int W, int R[HW_MAX][HW_MAX], int G[HW_MAX][HW_MAX], int B[HW_MAX][HW_MAX])
{
    ll res = 0;
    for(int i = 0; i < H; i++)
        for(int j = 0; j < W; j++)
        {
            if(G[i][j] > R[i][j] && G[i][j] > B[i][j] + 30)
                res += 10000;
        }
    res /= (H * W);
    return res;
}
int getWhite (int H, int W, int R[HW_MAX][HW_MAX], int G[HW_MAX][HW_MAX], int B[HW_MAX][HW_MAX])
{
    ll res = 0;
    for(int i = 0; i < H; i++)
        for(int j = 0; j < W; j++)
        {
            int mx = max({R[i][j], G[i][j], B[i][j]});
            int mn = min({R[i][j], G[i][j], B[i][j]});
            if(mx - mn < 40 && R[i][j] + G[i][j] + B[i][j] > 230 * 3)
                res += 10000;
        }
    res /= (H * W);
    return res;
}

int getBlack (int H, int W, int R[HW_MAX][HW_MAX], int G[HW_MAX][HW_MAX], int B[HW_MAX][HW_MAX])
{
    ll res = 0;
    for(int i = 0; i < H; i++)
        for(int j = 0; j < W; j++)
        {
            int mx = max({R[i][j], G[i][j], B[i][j]});
            int mn = min({R[i][j], G[i][j], B[i][j]});
            if(mx - mn < 40 && R[i][j] + G[i][j] + B[i][j] < 30 * 3)
                res += 10000;
        }
    res /= (H * W);
    return res;
}

int style (int H, int W, int R[HW_MAX][HW_MAX], int G[HW_MAX][HW_MAX], int B[HW_MAX][HW_MAX])
{
    int mess = getMess(H, W, R, G, B);
    int green = getGreen(H, W, R, G, B);
    int white = getWhite(H, W, R, G, B);
    int black = getBlack(H, W, R, G, B);
    if(mess > 300)
        return 3;
    if(green > 1500)
        return 2;
    if(mess > 200)
        return 3;
    if(white * 2 + black > 3500)
        return 1;
    if(mess < 100)
        return 4;
    return 2;
}

Subtask #1
76.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 64 ms 5816 KB Output isn't correct
2 Correct 52 ms 5004 KB Output is correct
3 Correct 41 ms 3772 KB Output is correct
4 Incorrect 60 ms 5772 KB Output isn't correct
5 Incorrect 64 ms 5680 KB Output isn't correct
6 Correct 28 ms 2464 KB Output is correct
7 Correct 48 ms 4928 KB Output is correct
8 Correct 54 ms 5292 KB Output is correct
9 Correct 47 ms 4548 KB Output is correct
10 Incorrect 62 ms 5164 KB Output isn't correct
11 Correct 63 ms 5848 KB Output is correct
12 Correct 50 ms 5364 KB Output is correct
13 Correct 65 ms 5948 KB Output is correct
14 Incorrect 56 ms 5704 KB Output isn't correct
15 Correct 49 ms 4420 KB Output is correct
16 Correct 51 ms 5060 KB Output is correct
17 Incorrect 61 ms 5668 KB Output isn't correct
18 Correct 76 ms 4864 KB Output is correct
19 Correct 53 ms 5388 KB Output is correct
20 Incorrect 62 ms 5700 KB Output isn't correct
21 Correct 49 ms 4960 KB Output is correct
22 Correct 51 ms 5128 KB Output is correct
23 Correct 42 ms 4036 KB Output is correct
24 Correct 63 ms 6124 KB Output is correct
25 Correct 53 ms 5444 KB Output is correct
26 Correct 50 ms 5236 KB Output is correct
27 Correct 65 ms 5820 KB Output is correct
28 Correct 53 ms 5240 KB Output is correct
29 Correct 32 ms 2764 KB Output is correct
30 Correct 50 ms 4336 KB Output is correct
31 Correct 46 ms 4876 KB Output is correct
32 Correct 33 ms 2988 KB Output is correct
33 Correct 58 ms 5328 KB Output is correct
34 Correct 52 ms 5248 KB Output is correct
35 Correct 53 ms 4708 KB Output is correct
36 Correct 40 ms 4672 KB Output is correct
37 Correct 37 ms 4548 KB Output is correct
38 Correct 47 ms 4272 KB Output is correct
39 Correct 54 ms 4828 KB Output is correct
40 Correct 51 ms 5316 KB Output is correct
41 Correct 53 ms 4676 KB Output is correct
42 Incorrect 40 ms 4664 KB Output isn't correct
43 Incorrect 53 ms 4644 KB Output isn't correct
44 Correct 54 ms 5312 KB Output is correct
45 Correct 52 ms 4548 KB Output is correct
46 Correct 55 ms 5316 KB Output is correct
47 Correct 45 ms 5008 KB Output is correct
48 Correct 35 ms 4720 KB Output is correct
49 Correct 49 ms 4308 KB Output is correct
50 Correct 53 ms 5116 KB Output is correct
51 Correct 33 ms 3008 KB Output is correct
52 Incorrect 55 ms 4676 KB Output isn't correct
53 Correct 54 ms 5316 KB Output is correct
54 Correct 49 ms 4292 KB Output is correct
55 Correct 56 ms 4840 KB Output is correct
56 Incorrect 52 ms 4332 KB Output isn't correct
57 Correct 49 ms 5028 KB Output is correct
58 Correct 41 ms 4792 KB Output is correct
59 Incorrect 52 ms 5288 KB Output isn't correct
60 Incorrect 64 ms 5444 KB Output isn't correct
61 Correct 67 ms 5884 KB Output is correct
62 Correct 41 ms 4572 KB Output is correct
63 Incorrect 30 ms 4372 KB Output isn't correct
64 Correct 41 ms 3524 KB Output is correct
65 Correct 53 ms 4676 KB Output is correct
66 Correct 50 ms 4292 KB Output is correct
67 Correct 56 ms 5264 KB Output is correct
68 Correct 48 ms 4164 KB Output is correct
69 Correct 13 ms 1336 KB Output is correct
70 Correct 41 ms 3744 KB Output is correct
71 Correct 57 ms 5240 KB Output is correct
72 Correct 50 ms 4316 KB Output is correct
73 Correct 63 ms 6004 KB Output is correct
74 Incorrect 63 ms 5836 KB Output isn't correct
75 Incorrect 64 ms 5928 KB Output isn't correct
76 Correct 27 ms 2356 KB Output is correct
77 Correct 34 ms 3036 KB Output is correct
78 Correct 51 ms 5456 KB Output is correct
79 Incorrect 16 ms 3672 KB Output isn't correct
80 Correct 46 ms 5044 KB Output is correct
81 Correct 53 ms 4556 KB Output is correct
82 Correct 40 ms 3732 KB Output is correct
83 Correct 47 ms 4392 KB Output is correct
84 Correct 56 ms 5040 KB Output is correct
85 Correct 52 ms 4676 KB Output is correct
86 Correct 53 ms 4788 KB Output is correct
87 Correct 55 ms 5364 KB Output is correct
88 Correct 54 ms 4580 KB Output is correct
89 Correct 42 ms 5020 KB Output is correct
90 Correct 48 ms 4304 KB Output is correct
91 Correct 58 ms 5296 KB Output is correct
92 Incorrect 35 ms 3268 KB Output isn't correct
93 Correct 55 ms 5828 KB Output is correct
94 Correct 34 ms 3100 KB Output is correct
95 Incorrect 43 ms 4828 KB Output isn't correct
96 Correct 58 ms 5364 KB Output is correct
97 Correct 55 ms 4484 KB Output is correct
98 Correct 65 ms 5956 KB Output is correct
99 Correct 57 ms 4760 KB Output is correct
100 Correct 50 ms 4436 KB Output is correct
101 Incorrect 63 ms 5856 KB Output isn't correct
102 Incorrect 53 ms 5316 KB Output isn't correct