oj.uz

답안 #708236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
708236 2023-03-11T11:13:17 Z finn__ 미술 수업 (IOI13_artclass) C++17
78 / 100
 186 ms 14372 KB 
#include <bits/stdc++.h>
#include "artclass.h"
using namespace std;

constexpr double DThreshold = 200;
constexpr size_t FRatio = 2;
vector<vector<int64_t>> sobel = vector<vector<int64_t>>({vector<int64_t>({-1, 0, 1}),
                                                         vector<int64_t>({-2, 0, 2}),
                                                         vector<int64_t>({-1, 0, 1})});

void bit_reverse(vector<complex<double>> &y, size_t lgn)
{
    vector<bool> swapped(y.size(), 0);
    for (size_t i = 0; i < y.size(); i++)
    {
        if (swapped[i])
            continue;
        size_t j = 0;
        for (size_t k = 0; k < lgn; k++)
            j |= ((i & (1 << k)) >> k) << (lgn - k - 1);
        swap(y[i], y[j]);
        swapped[i] = swapped[j] = 1;
    }
}

void fft(vector<complex<double>> &y)
{
    size_t const n = y.size(), lgn = __lg(n);
    bit_reverse(y, lgn);

    for (size_t s = 1; s <= lgn; s++)
    {
        size_t const m = 1 << s;
        complex<double> const omega_m = polar(1.0, 2 * M_PI / m);
        for (size_t i = 0; i < n; i += m)
        {
            complex<double> omega = 1.0;
            for (size_t k = i; k < i + m / 2; k++)
            {
                complex<double> const u = y[k], v = omega * y[k + m / 2];
                y[k] = u + v;
                y[k + m / 2] = u - v;
                omega *= omega_m;
            }
        }
    }
}

template <typename T>
void rotate_c(vector<vector<T>> &y)
{
    vector<vector<T>> z(y[0].size(), vector<T>(y.size()));
    for (size_t i = 0; i < y.size(); i++)
        for (size_t j = 0; j < y[0].size(); j++)
            z[j][y.size() - i - 1] = y[i][j];
    swap(y, z);
}

template <typename T>
size_t convolve(vector<vector<T>> const &y, vector<vector<T>> const &kernel)
{
    size_t counter = 0;
    for (size_t i = kernel.size() / 2; i < y.size() - kernel.size() / 2; i++)
        for (size_t j = kernel[0].size() / 2; j < y[i].size() - kernel[0].size() / 2; j++)
        {
            T val = 0;
            for (size_t k = 0; k < kernel.size(); k++)
                for (size_t h = 0; h < kernel[k].size(); h++)
                    val += y[i - kernel.size() / 2 + k][j - kernel.size() / 2 + h] * kernel[k][h];
            if (abs(val) > DThreshold)
                counter++;
        }
    return counter;
}

size_t get_high_deriv(int H, int W, int arr[500][500])
{
    vector<vector<int64_t>> image(H, vector<int64_t>(W));
    for (size_t i = 0; i < H; i++)
        for (size_t j = 0; j < W; j++)
            image[i][j] = arr[i][j];
    size_t ans = convolve(image, sobel);
    rotate_c(sobel);
    ans += convolve(image, sobel);
    rotate_c(sobel);
    rotate_c(sobel);
    rotate_c(sobel);
    return ans;
}

double get_high_freq(int H, int W, int arr[500][500])
{
    size_t n1 = 1 << (32 - __builtin_clz(H)), n2 = 1 << (32 - __builtin_clz(W));
    vector<vector<complex<double>>> y(n1, vector<complex<double>>(n2));
    for (size_t i = 0; i < H; i++)
        for (size_t j = 0; j < W; j++)
            y[i][j] = arr[i][j];
    for (size_t i = 0; i < n1; i++)
        fft(y[i]);
    rotate_c(y);
    for (size_t i = 0; i < n2; i++)
        fft(y[i]);

    double ans = 0.0;
    for (size_t i = n2 - n2 / FRatio; i < n2; i++)
        for (size_t j = n1 - n1 / FRatio; j < n1; j++)
            ans += abs(y[i][j]);
    return ans;
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
    double h = (double)(get_high_deriv(H, W, R) + get_high_deriv(H, W, G) +
                        get_high_deriv(H, W, B)) /
               (double)(H * W);

    double f = (get_high_freq(H, W, R) + get_high_freq(H, W, G) + get_high_freq(H, W, B)) / (H * W);
    // cout << "h : " << h << ", "
    //      << "f : " << f << '\n';

    if (h < 0.15)
    {
        if (h < 0.06)
            return f < 2200 ? 4 : 1;
        return (f < 2500 || h < 0.01) ? 4 : 2;
    }
    return (f > 10000 || f > 7000 && h > 0.7) ? 3 : (f / h > 25000 ? 2 : 1);
}

Compilation message

artclass.cpp: In function 'size_t get_high_deriv(int, int, int (*)[500])':
artclass.cpp:79:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   79 |     for (size_t i = 0; i < H; i++)
      |                        ~~^~~
artclass.cpp:80:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   80 |         for (size_t j = 0; j < W; j++)
      |                            ~~^~~
artclass.cpp: In function 'double get_high_freq(int, int, int (*)[500])':
artclass.cpp:95:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |     for (size_t i = 0; i < H; i++)
      |                        ~~^~~
artclass.cpp:96:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   96 |         for (size_t j = 0; j < W; j++)
      |                            ~~^~~
artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:127:35: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  127 |     return (f > 10000 || f > 7000 && h > 0.7) ? 3 : (f / h > 25000 ? 2 : 1);
      |                          ~~~~~~~~~^~~~~~~~~~

Subtask #1
78.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 13504 KB Output is correct
2 Correct 129 ms 13920 KB Output is correct
3 Correct 119 ms 14168 KB Output is correct
4 Correct 127 ms 13376 KB Output is correct
5 Incorrect 124 ms 12460 KB Output isn't correct
6 Incorrect 122 ms 14120 KB Output isn't correct
7 Correct 120 ms 13532 KB Output is correct
8 Correct 33 ms 5760 KB Output is correct
9 Incorrect 120 ms 13540 KB Output isn't correct
10 Correct 102 ms 11996 KB Output is correct
11 Correct 125 ms 14200 KB Output is correct
12 Correct 108 ms 11972 KB Output is correct
13 Correct 104 ms 13232 KB Output is correct
14 Incorrect 100 ms 12932 KB Output isn't correct
15 Correct 127 ms 13304 KB Output is correct
16 Correct 163 ms 14080 KB Output is correct
17 Correct 125 ms 12960 KB Output is correct
18 Correct 118 ms 13116 KB Output is correct
19 Incorrect 127 ms 13548 KB Output isn't correct
20 Correct 140 ms 13612 KB Output is correct
21 Correct 105 ms 12108 KB Output is correct
22 Correct 118 ms 13160 KB Output is correct
23 Correct 111 ms 12680 KB Output is correct
24 Correct 117 ms 12848 KB Output is correct
25 Correct 117 ms 12900 KB Output is correct
26 Correct 109 ms 12612 KB Output is correct
27 Correct 110 ms 13104 KB Output is correct
28 Correct 118 ms 13212 KB Output is correct
29 Correct 112 ms 13368 KB Output is correct
30 Correct 114 ms 13704 KB Output is correct
31 Correct 100 ms 12928 KB Output is correct
32 Correct 114 ms 12996 KB Output is correct
33 Correct 144 ms 13340 KB Output is correct
34 Correct 110 ms 12500 KB Output is correct
35 Correct 122 ms 12992 KB Output is correct
36 Incorrect 109 ms 13308 KB Output isn't correct
37 Correct 186 ms 14124 KB Output is correct
38 Correct 127 ms 14084 KB Output is correct
39 Incorrect 118 ms 13480 KB Output isn't correct
40 Correct 122 ms 14040 KB Output is correct
41 Incorrect 122 ms 13576 KB Output isn't correct
42 Correct 106 ms 12732 KB Output is correct
43 Correct 120 ms 14172 KB Output is correct
44 Correct 124 ms 13080 KB Output is correct
45 Correct 124 ms 13620 KB Output is correct
46 Correct 125 ms 14372 KB Output is correct
47 Correct 132 ms 13464 KB Output is correct
48 Correct 128 ms 12572 KB Output is correct
49 Incorrect 108 ms 13176 KB Output isn't correct
50 Correct 114 ms 13556 KB Output is correct
51 Correct 111 ms 13452 KB Output is correct
52 Incorrect 133 ms 13176 KB Output isn't correct
53 Incorrect 60 ms 7184 KB Output isn't correct
54 Incorrect 116 ms 13452 KB Output isn't correct
55 Correct 110 ms 12616 KB Output is correct
56 Correct 121 ms 12736 KB Output is correct
57 Correct 57 ms 6508 KB Output is correct
58 Correct 104 ms 11524 KB Output is correct
59 Correct 139 ms 12888 KB Output is correct
60 Correct 116 ms 13520 KB Output is correct
61 Correct 109 ms 12808 KB Output is correct
62 Incorrect 109 ms 13148 KB Output isn't correct
63 Correct 115 ms 13616 KB Output is correct
64 Correct 123 ms 12960 KB Output is correct
65 Correct 61 ms 7208 KB Output is correct
66 Correct 132 ms 13836 KB Output is correct
67 Correct 114 ms 13232 KB Output is correct
68 Correct 117 ms 11836 KB Output is correct
69 Incorrect 109 ms 12968 KB Output isn't correct
70 Correct 60 ms 6800 KB Output is correct
71 Incorrect 116 ms 13432 KB Output isn't correct
72 Correct 112 ms 13304 KB Output is correct
73 Correct 58 ms 6536 KB Output is correct
74 Correct 36 ms 3444 KB Output is correct
75 Correct 109 ms 12552 KB Output is correct
76 Correct 111 ms 12540 KB Output is correct
77 Correct 117 ms 12248 KB Output is correct
78 Correct 101 ms 11256 KB Output is correct
79 Correct 105 ms 12984 KB Output is correct
80 Correct 67 ms 7232 KB Output is correct
81 Correct 126 ms 13976 KB Output is correct
82 Correct 134 ms 14124 KB Output is correct
83 Correct 113 ms 12796 KB Output is correct
84 Correct 109 ms 13376 KB Output is correct
85 Correct 124 ms 12908 KB Output is correct
86 Correct 122 ms 13664 KB Output is correct
87 Correct 117 ms 13688 KB Output is correct
88 Correct 110 ms 13380 KB Output is correct
89 Incorrect 137 ms 14244 KB Output isn't correct
90 Incorrect 121 ms 14120 KB Output isn't correct
91 Correct 99 ms 13008 KB Output is correct
92 Incorrect 108 ms 12784 KB Output isn't correct
93 Incorrect 116 ms 13168 KB Output isn't correct
94 Correct 114 ms 13908 KB Output is correct
95 Correct 111 ms 13548 KB Output is correct
96 Incorrect 133 ms 13900 KB Output isn't correct
97 Correct 68 ms 8464 KB Output is correct
98 Correct 130 ms 13896 KB Output is correct
99 Correct 109 ms 12620 KB Output is correct
100 Correct 114 ms 12572 KB Output is correct
101 Correct 127 ms 13304 KB Output is correct
102 Correct 114 ms 13652 KB Output is correct