oj.uz

Submission #940624

# Submission time Handle Problem Language Result Execution time Memory
940624 2024-03-07T11:56:19 Z vjudge1 Art Class (IOI13_artclass) C++17
71 / 100
 65 ms 25936 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.60)
        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
71.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 13652 KB Output is correct
2 Correct 55 ms 11344 KB Output is correct
3 Correct 41 ms 7632 KB Output is correct
4 Correct 51 ms 9108 KB Output is correct
5 Incorrect 42 ms 10068 KB Output isn't correct
6 Correct 44 ms 11088 KB Output is correct
7 Correct 52 ms 9944 KB Output is correct
8 Correct 48 ms 22628 KB Output is correct
9 Correct 65 ms 9424 KB Output is correct
10 Correct 26 ms 6424 KB Output is correct
11 Correct 34 ms 12116 KB Output is correct
12 Correct 53 ms 11636 KB Output is correct
13 Incorrect 47 ms 8752 KB Output isn't correct
14 Incorrect 60 ms 10184 KB Output isn't correct
15 Correct 31 ms 6872 KB Output is correct
16 Correct 30 ms 6104 KB Output is correct
17 Correct 44 ms 19832 KB Output is correct
18 Correct 56 ms 11604 KB Output is correct
19 Correct 59 ms 12140 KB Output is correct
20 Correct 45 ms 8144 KB Output is correct
21 Incorrect 53 ms 8908 KB Output isn't correct
22 Correct 42 ms 14684 KB Output is correct
23 Correct 32 ms 11100 KB Output is correct
24 Correct 40 ms 8508 KB Output is correct
25 Correct 49 ms 8912 KB Output is correct
26 Incorrect 51 ms 9292 KB Output isn't correct
27 Correct 56 ms 8648 KB Output is correct
28 Correct 50 ms 9060 KB Output is correct
29 Incorrect 33 ms 8528 KB Output isn't correct
30 Correct 48 ms 9928 KB Output is correct
31 Correct 47 ms 24404 KB Output is correct
32 Correct 36 ms 8232 KB Output is correct
33 Correct 50 ms 9128 KB Output is correct
34 Correct 49 ms 9424 KB Output is correct
35 Correct 58 ms 12888 KB Output is correct
36 Incorrect 47 ms 8904 KB Output isn't correct
37 Correct 64 ms 10064 KB Output is correct
38 Correct 49 ms 20316 KB Output is correct
39 Incorrect 49 ms 9416 KB Output isn't correct
40 Correct 45 ms 20764 KB Output is correct
41 Incorrect 55 ms 9324 KB Output isn't correct
42 Correct 64 ms 9784 KB Output is correct
43 Incorrect 44 ms 9820 KB Output isn't correct
44 Correct 51 ms 9436 KB Output is correct
45 Correct 46 ms 10068 KB Output is correct
46 Correct 39 ms 13140 KB Output is correct
47 Correct 42 ms 14016 KB Output is correct
48 Correct 48 ms 8912 KB Output is correct
49 Incorrect 40 ms 10576 KB Output isn't correct
50 Correct 36 ms 8276 KB Output is correct
51 Incorrect 61 ms 10112 KB Output isn't correct
52 Incorrect 41 ms 10832 KB Output isn't correct
53 Correct 49 ms 20052 KB Output is correct
54 Correct 30 ms 7252 KB Output is correct
55 Incorrect 40 ms 9808 KB Output isn't correct
56 Correct 36 ms 14692 KB Output is correct
57 Correct 49 ms 9296 KB Output is correct
58 Correct 37 ms 8140 KB Output is correct
59 Correct 42 ms 17488 KB Output is correct
60 Correct 47 ms 8396 KB Output is correct
61 Correct 32 ms 6872 KB Output is correct
62 Correct 33 ms 14004 KB Output is correct
63 Correct 64 ms 11856 KB Output is correct
64 Correct 51 ms 9704 KB Output is correct
65 Correct 60 ms 25936 KB Output is correct
66 Incorrect 45 ms 9300 KB Output isn't correct
67 Correct 13 ms 4968 KB Output is correct
68 Correct 57 ms 9972 KB Output is correct
69 Correct 48 ms 23120 KB Output is correct
70 Incorrect 54 ms 12120 KB Output isn't correct
71 Incorrect 63 ms 9460 KB Output isn't correct
72 Correct 13 ms 7004 KB Output is correct
73 Incorrect 43 ms 10552 KB Output isn't correct
74 Correct 44 ms 8916 KB Output is correct
75 Correct 32 ms 7140 KB Output is correct
76 Correct 30 ms 10832 KB Output is correct
77 Correct 48 ms 9076 KB Output is correct
78 Correct 30 ms 11904 KB Output is correct
79 Correct 42 ms 15232 KB Output is correct
80 Correct 61 ms 13628 KB Output is correct
81 Correct 42 ms 15956 KB Output is correct
82 Correct 37 ms 7884 KB Output is correct
83 Correct 36 ms 10324 KB Output is correct
84 Incorrect 52 ms 10032 KB Output isn't correct
85 Correct 26 ms 6096 KB Output is correct
86 Correct 30 ms 6880 KB Output is correct
87 Correct 25 ms 10844 KB Output is correct
88 Correct 54 ms 10012 KB Output is correct
89 Correct 54 ms 11344 KB Output is correct
90 Incorrect 43 ms 10644 KB Output isn't correct
91 Correct 55 ms 11600 KB Output is correct
92 Correct 42 ms 18256 KB Output is correct
93 Correct 48 ms 9164 KB Output is correct
94 Correct 51 ms 9420 KB Output is correct
95 Correct 57 ms 8948 KB Output is correct
96 Correct 41 ms 8652 KB Output is correct
97 Correct 53 ms 9424 KB Output is correct
98 Correct 39 ms 7628 KB Output is correct
99 Incorrect 41 ms 10060 KB Output isn't correct
100 Incorrect 27 ms 8796 KB Output isn't correct
101 Incorrect 46 ms 8112 KB Output isn't correct
102 Correct 46 ms 9812 KB Output is correct