oj.uz

Submission #940627

# Submission time Handle Problem Language Result Execution time Memory
940627 2024-03-07T12:06:43 Z vjudge1 Art Class (IOI13_artclass) C++17
84 / 100
 65 ms 25908 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 = {0, 0, 1, -1};
vector<int> dy = {-1, 1, 0, 0};

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)
{
    assert(x < n);
    assert(y < m);
    assert(!was[x][y]);
    assert(x >= 0);
    assert(y >= 0);
    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])
        {
            assert(tox < n and toy < m);
            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 <= 30)
                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 + 100, vector<int>(W + 100));
    r.resize(H + 100, vector<int>(W + 100));
    g.resize(H + 100, vector<int>(W + 100));
    b.resize(H + 100, vector<int>(W + 100));
    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));
    if ((int)d.size() == 1)
        return 4;
    if (d[0] + d[1] >= (double)(n * m) * 0.80)
        return 4;
    // cout << d[0] << " " << d[1] << ": " << (double)(n * m) * 0.60 << "!\n";
    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
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 8264 KB Output isn't correct
2 Correct 52 ms 9420 KB Output is correct
3 Correct 44 ms 8144 KB Output is correct
4 Correct 49 ms 9296 KB Output is correct
5 Correct 13 ms 4952 KB Output is correct
6 Correct 50 ms 11220 KB Output is correct
7 Correct 56 ms 10080 KB Output is correct
8 Correct 48 ms 20100 KB Output is correct
9 Correct 27 ms 6360 KB Output is correct
10 Incorrect 52 ms 9336 KB Output isn't correct
11 Correct 34 ms 13912 KB Output is correct
12 Incorrect 28 ms 8876 KB Output isn't correct
13 Correct 57 ms 11360 KB Output is correct
14 Correct 52 ms 10068 KB Output is correct
15 Correct 40 ms 8396 KB Output is correct
16 Correct 36 ms 8284 KB Output is correct
17 Correct 30 ms 6876 KB Output is correct
18 Correct 51 ms 11836 KB Output is correct
19 Correct 47 ms 24400 KB Output is correct
20 Incorrect 49 ms 8920 KB Output isn't correct
21 Correct 37 ms 7880 KB Output is correct
22 Incorrect 51 ms 9436 KB Output isn't correct
23 Incorrect 51 ms 9968 KB Output isn't correct
24 Incorrect 41 ms 10844 KB Output isn't correct
25 Correct 44 ms 13648 KB Output is correct
26 Correct 40 ms 8788 KB Output is correct
27 Correct 13 ms 7004 KB Output is correct
28 Correct 53 ms 11448 KB Output is correct
29 Correct 47 ms 9164 KB Output is correct
30 Correct 31 ms 6868 KB Output is correct
31 Correct 57 ms 12044 KB Output is correct
32 Incorrect 57 ms 8992 KB Output isn't correct
33 Incorrect 65 ms 10280 KB Output isn't correct
34 Correct 45 ms 8144 KB Output is correct
35 Correct 62 ms 9680 KB Output is correct
36 Correct 40 ms 15188 KB Output is correct
37 Correct 49 ms 9064 KB Output is correct
38 Correct 35 ms 10576 KB Output is correct
39 Correct 48 ms 9172 KB Output is correct
40 Correct 45 ms 10084 KB Output is correct
41 Correct 44 ms 8952 KB Output is correct
42 Incorrect 41 ms 10064 KB Output isn't correct
43 Correct 57 ms 22612 KB Output is correct
44 Incorrect 48 ms 12064 KB Output isn't correct
45 Correct 62 ms 10196 KB Output is correct
46 Correct 25 ms 6364 KB Output is correct
47 Correct 43 ms 19796 KB Output is correct
48 Correct 53 ms 9676 KB Output is correct
49 Correct 50 ms 9468 KB Output is correct
50 Correct 45 ms 20560 KB Output is correct
51 Correct 55 ms 11600 KB Output is correct
52 Correct 52 ms 9940 KB Output is correct
53 Incorrect 52 ms 9160 KB Output isn't correct
54 Correct 41 ms 8652 KB Output is correct
55 Correct 47 ms 9704 KB Output is correct
56 Correct 50 ms 9420 KB Output is correct
57 Correct 50 ms 8908 KB Output is correct
58 Correct 30 ms 11016 KB Output is correct
59 Correct 57 ms 25908 KB Output is correct
60 Incorrect 51 ms 9456 KB Output isn't correct
61 Correct 43 ms 11088 KB Output is correct
62 Correct 39 ms 7532 KB Output is correct
63 Correct 29 ms 12124 KB Output is correct
64 Correct 53 ms 9424 KB Output is correct
65 Correct 57 ms 9168 KB Output is correct
66 Correct 38 ms 7500 KB Output is correct
67 Correct 32 ms 11100 KB Output is correct
68 Incorrect 60 ms 10068 KB Output isn't correct
69 Correct 49 ms 10964 KB Output is correct
70 Correct 48 ms 9812 KB Output is correct
71 Correct 33 ms 12040 KB Output is correct
72 Incorrect 49 ms 10580 KB Output isn't correct
73 Correct 53 ms 15952 KB Output is correct
74 Correct 47 ms 9172 KB Output is correct
75 Correct 58 ms 13600 KB Output is correct
76 Correct 45 ms 9808 KB Output is correct
77 Correct 31 ms 6880 KB Output is correct
78 Correct 35 ms 13288 KB Output is correct
79 Correct 25 ms 10844 KB Output is correct
80 Correct 62 ms 12880 KB Output is correct
81 Correct 42 ms 8964 KB Output is correct
82 Correct 38 ms 14684 KB Output is correct
83 Correct 37 ms 8140 KB Output is correct
84 Correct 58 ms 11760 KB Output is correct
85 Correct 51 ms 9420 KB Output is correct
86 Correct 52 ms 10344 KB Output is correct
87 Correct 48 ms 8452 KB Output is correct
88 Incorrect 44 ms 9852 KB Output isn't correct
89 Correct 41 ms 17680 KB Output is correct
90 Correct 46 ms 10380 KB Output is correct
91 Correct 44 ms 8652 KB Output is correct
92 Correct 48 ms 8952 KB Output is correct
93 Correct 34 ms 7132 KB Output is correct
94 Correct 42 ms 14660 KB Output is correct
95 Correct 45 ms 14008 KB Output is correct
96 Correct 50 ms 23152 KB Output is correct
97 Incorrect 46 ms 9168 KB Output isn't correct
98 Correct 48 ms 20308 KB Output is correct
99 Correct 55 ms 18772 KB Output is correct
100 Correct 58 ms 11376 KB Output is correct
101 Correct 25 ms 6108 KB Output is correct
102 Correct 38 ms 7448 KB Output is correct