oj.uz

Submission #940528

# Submission time Handle Problem Language Result Execution time Memory
940528 2024-03-07T10:16:14 Z vjudge1 Art Class (IOI13_artclass) C++17
65 / 100
 82 ms 17820 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back

#include "artclass.h"

vector<int> dx = {-1, -1, 1, 1};
vector<int> dy = {-1, 1, 1, -1};

vector<vector<int>> was, r, g, b;
int n, m;

bool good(int x, int y)
{
    return x >= 0 and y >= 0 and x < n and y < m;
}

int dfs1(int x, int y)
{
    was[x][y] = 1;
    int sz = 1;
    for (int d = 0; d < 4; ++d)
    {
        int tox = x + dx[d];
        int toy = y + dy[d];
        if (good(tox, toy) and !was[tox][toy])
        {
            int diff = abs(r[x][y] - r[tox][toy]) + abs(g[x][y] - g[tox][toy]) + abs(b[x][y] - b[tox][toy]);
            if (diff <= 20)
                sz += dfs1(tox, toy);
        }
    }
    return sz;
}

int dfs2(int x, int y)
{
    was[x][y] = 1;
    int sz = 1;
    for (int d = 0; d < 4; ++d)
    {
        int tox = x + dx[d];
        int toy = y + dy[d];
        if (good(tox, toy) and !was[tox][toy])
        {
            int diff = abs(r[x][y] - r[tox][toy]) + abs(g[x][y] - g[tox][toy]) + abs(b[x][y] - b[tox][toy]);
            if (diff <= 10)
                sz += dfs2(tox, toy);
        }
    }
    return sz;
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
    was.resize(H, vector<int>(W));
    r.resize(H, vector<int>(W));
    g.resize(H, vector<int>(W));
    b.resize(H, vector<int>(W));
    n = H;
    m = W;

    vector<int> d;

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
        {
            r[i][j] = R[i][j];
            g[i][j] = G[i][j];
            b[i][j] = B[i][j];
        }
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            if (!was[i][j])
                d.pb(dfs1(i, j));

    sort(all(d));
    reverse(all(d));
    // cout << d[0] << " " << d[1] << ": " << (double)(n * m) * 0.60 << "!\n";
    if (d.size() == 1 or d[0] + d[1] >= (double)(n * m) * 0.60)
        return 4;
    d.clear();
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            was[i][j] = 0;

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            if (!was[i][j])
                d.pb(dfs2(i, j));

    if (((double)d.size() / (double)(H * W)) <= 0.3)
        return 1;
    if (((double)d.size() / (double)(H * W)) >= 0.7)
        return 3;
    return 2;
}

// #include <stdio.h>
// #include "artclass.h"
// #include <assert.h>

// static int DIM[2];
// static int R[500][500];
// static int G[500][500];
// static int B[500][500];

// int main()
// {
//     assert(scanf("%d", &DIM[1]) == 1);
//     assert(scanf("%d", &DIM[0]) == 1);
//     for (int i = 0; i < DIM[0]; i++)
//         for (int j = 0; j < DIM[1]; j++)
//             assert(scanf("%d %d %d", &R[i][j], &G[i][j], &B[i][j]) == 3);
//     printf("%d\n", style(DIM[0], DIM[1], R, G, B));
//     return 0;
// }

Subtask #1
65.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 7004 KB Output is correct
2 Correct 32 ms 10184 KB Output is correct
3 Correct 44 ms 13580 KB Output is correct
4 Incorrect 51 ms 9420 KB Output isn't correct
5 Incorrect 47 ms 8584 KB Output isn't correct
6 Correct 25 ms 5596 KB Output is correct
7 Correct 46 ms 9168 KB Output is correct
8 Correct 45 ms 8172 KB Output is correct
9 Incorrect 49 ms 8648 KB Output isn't correct
10 Correct 37 ms 7628 KB Output is correct
11 Correct 24 ms 5648 KB Output is correct
12 Correct 57 ms 9200 KB Output is correct
13 Incorrect 50 ms 8896 KB Output isn't correct
14 Correct 45 ms 8396 KB Output is correct
15 Correct 48 ms 9300 KB Output is correct
16 Correct 54 ms 9504 KB Output is correct
17 Correct 46 ms 15708 KB Output is correct
18 Incorrect 59 ms 11292 KB Output isn't correct
19 Incorrect 55 ms 12720 KB Output isn't correct
20 Correct 54 ms 9392 KB Output is correct
21 Correct 61 ms 12188 KB Output is correct
22 Correct 49 ms 8656 KB Output is correct
23 Correct 82 ms 11724 KB Output is correct
24 Correct 42 ms 12352 KB Output is correct
25 Incorrect 63 ms 10196 KB Output isn't correct
26 Correct 35 ms 8224 KB Output is correct
27 Correct 52 ms 9156 KB Output is correct
28 Correct 41 ms 8312 KB Output is correct
29 Incorrect 54 ms 13412 KB Output isn't correct
30 Correct 47 ms 9116 KB Output is correct
31 Correct 61 ms 9932 KB Output is correct
32 Correct 51 ms 9140 KB Output is correct
33 Correct 38 ms 8020 KB Output is correct
34 Incorrect 66 ms 10444 KB Output isn't correct
35 Correct 53 ms 8700 KB Output is correct
36 Incorrect 43 ms 10608 KB Output isn't correct
37 Correct 44 ms 8400 KB Output is correct
38 Correct 51 ms 8912 KB Output is correct
39 Incorrect 50 ms 11344 KB Output isn't correct
40 Correct 50 ms 9236 KB Output is correct
41 Correct 63 ms 11332 KB Output is correct
42 Correct 48 ms 9160 KB Output is correct
43 Incorrect 35 ms 6604 KB Output isn't correct
44 Incorrect 47 ms 8604 KB Output isn't correct
45 Correct 31 ms 6608 KB Output is correct
46 Correct 37 ms 12112 KB Output is correct
47 Correct 53 ms 9388 KB Output is correct
48 Correct 51 ms 9168 KB Output is correct
49 Correct 56 ms 8656 KB Output is correct
50 Incorrect 57 ms 9792 KB Output isn't correct
51 Incorrect 56 ms 13004 KB Output isn't correct
52 Correct 51 ms 8744 KB Output is correct
53 Correct 61 ms 11032 KB Output is correct
54 Correct 44 ms 8192 KB Output is correct
55 Correct 56 ms 9028 KB Output is correct
56 Correct 61 ms 11088 KB Output is correct
57 Incorrect 69 ms 9880 KB Output isn't correct
58 Correct 55 ms 9416 KB Output is correct
59 Incorrect 53 ms 9476 KB Output isn't correct
60 Correct 81 ms 11584 KB Output is correct
61 Correct 30 ms 6616 KB Output is correct
62 Incorrect 60 ms 9936 KB Output isn't correct
63 Correct 63 ms 8556 KB Output is correct
64 Correct 52 ms 9164 KB Output is correct
65 Correct 39 ms 10840 KB Output is correct
66 Incorrect 51 ms 8912 KB Output isn't correct
67 Correct 39 ms 7952 KB Output is correct
68 Correct 60 ms 10836 KB Output is correct
69 Correct 26 ms 5840 KB Output is correct
70 Correct 47 ms 8396 KB Output is correct
71 Correct 56 ms 9296 KB Output is correct
72 Incorrect 17 ms 5976 KB Output isn't correct
73 Correct 35 ms 11304 KB Output is correct
74 Correct 55 ms 17820 KB Output is correct
75 Correct 44 ms 8656 KB Output is correct
76 Incorrect 45 ms 8300 KB Output isn't correct
77 Incorrect 49 ms 8532 KB Output isn't correct
78 Correct 31 ms 6356 KB Output is correct
79 Correct 61 ms 10580 KB Output is correct
80 Correct 45 ms 7676 KB Output is correct
81 Correct 49 ms 8968 KB Output is correct
82 Correct 12 ms 4184 KB Output is correct
83 Correct 31 ms 10144 KB Output is correct
84 Correct 47 ms 15204 KB Output is correct
85 Correct 61 ms 9252 KB Output is correct
86 Correct 49 ms 8388 KB Output is correct
87 Correct 50 ms 10088 KB Output is correct
88 Correct 36 ms 7884 KB Output is correct
89 Correct 49 ms 15188 KB Output is correct
90 Correct 61 ms 11532 KB Output is correct
91 Incorrect 28 ms 8016 KB Output isn't correct
92 Incorrect 43 ms 7988 KB Output isn't correct
93 Correct 61 ms 8472 KB Output is correct
94 Incorrect 63 ms 11832 KB Output isn't correct
95 Correct 67 ms 16212 KB Output is correct
96 Correct 38 ms 8752 KB Output is correct
97 Incorrect 50 ms 9028 KB Output isn't correct
98 Correct 56 ms 10288 KB Output is correct
99 Correct 45 ms 14676 KB Output is correct
100 Correct 42 ms 14164 KB Output is correct
101 Correct 37 ms 7888 KB Output is correct
102 Correct 44 ms 15948 KB Output is correct