oj.uz

Submission #940652

# Submission time Handle Problem Language Result Execution time Memory
940652 2024-03-07T12:41:17 Z vjudge1 Art Class (IOI13_artclass) C++17
0 / 100
 59 ms 10068 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 O = 0;

struct DSU
{
    vector<int> sz, p;

    void init(int n)
    {
        p.resize(n);
        sz.resize(n);
        for (int i = 0; i < n; ++i)
            p[i] = i;
    }

    int getRoot(int v)
    {
        return p[v] == v ? v : p[v] = getRoot(p[v]);
    }

    void merge(int a, int b)
    {
        a = getRoot(a);
        b = getRoot(b);
        if (a == b)
            return;
        sz[a] += sz[b];
        p[b] = a;
    }
};

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
    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;

    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];
        }
    vector<int> d;
    {
        DSU dsu;
        dsu.init(n * m);
        for (int x = 0; x < n; ++x)
            for (int y = 0; y < m; ++y)
                for (int d = 0; d < 4; ++d)
                {
                    int tox = x + dx[d];
                    int toy = y + dy[d];
                    if (good(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 <= 40)
                            dsu.merge(x * m + y, tox * m + toy);
                    }
                }

        for (int i = 0; i < n * m; ++i)
            if (dsu.p[i] == i)
                d.pb(i);
    }
    sort(all(d));
    reverse(all(d));
    if ((int)d.size() == 1)
        return 4;
    if (d[0] + d[1] >= (double)(n * m) * 0.70)
        return 4;
    d.clear();
    {
        DSU dsu;
        dsu.init(n * m);
        for (int x = 0; x < n; ++x)
            for (int y = 0; y < m; ++y)
                for (int d = 0; d < 4; ++d)
                {
                    int tox = x + dx[d];
                    int toy = y + dy[d];
                    if (good(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 <= 5)
                            dsu.merge(x * m + y, tox * m + toy);
                    }
                }

        for (int i = 0; i < n * m; ++i)
            if (dsu.p[i] == i)
                d.pb(i);
    }
    if (((double)d.size() / (double)(H * W)) <= 0.1)
        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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 8276 KB Output isn't correct
2 Correct 29 ms 7364 KB Output is correct
3 Correct 49 ms 9432 KB Output is correct
4 Correct 43 ms 8772 KB Output is correct
5 Incorrect 23 ms 5972 KB Output isn't correct
6 Incorrect 42 ms 8564 KB Output isn't correct
7 Incorrect 35 ms 7896 KB Output isn't correct
8 Correct 39 ms 8180 KB Output is correct
9 Incorrect 44 ms 8480 KB Output isn't correct
10 Incorrect 42 ms 8376 KB Output isn't correct
11 Incorrect 54 ms 8112 KB Output isn't correct
12 Correct 34 ms 7516 KB Output is correct
13 Incorrect 39 ms 8116 KB Output isn't correct
14 Incorrect 40 ms 8276 KB Output isn't correct
15 Incorrect 11 ms 4700 KB Output isn't correct
16 Correct 40 ms 8680 KB Output is correct
17 Incorrect 42 ms 8532 KB Output isn't correct
18 Incorrect 24 ms 6236 KB Output isn't correct
19 Correct 43 ms 8784 KB Output is correct
20 Incorrect 51 ms 9556 KB Output isn't correct
21 Incorrect 40 ms 8272 KB Output isn't correct
22 Correct 34 ms 7764 KB Output is correct
23 Incorrect 43 ms 8284 KB Output isn't correct
24 Incorrect 46 ms 8788 KB Output isn't correct
25 Correct 41 ms 8540 KB Output is correct
26 Incorrect 42 ms 8172 KB Output isn't correct
27 Incorrect 40 ms 7996 KB Output isn't correct
28 Incorrect 50 ms 9564 KB Output isn't correct
29 Incorrect 28 ms 6748 KB Output isn't correct
30 Correct 33 ms 7772 KB Output is correct
31 Incorrect 40 ms 8272 KB Output isn't correct
32 Incorrect 34 ms 7764 KB Output isn't correct
33 Incorrect 50 ms 9556 KB Output isn't correct
34 Incorrect 40 ms 8272 KB Output isn't correct
35 Correct 33 ms 7764 KB Output is correct
36 Incorrect 35 ms 7500 KB Output isn't correct
37 Incorrect 51 ms 9308 KB Output isn't correct
38 Incorrect 43 ms 8916 KB Output isn't correct
39 Incorrect 23 ms 5980 KB Output isn't correct
40 Correct 46 ms 9040 KB Output is correct
41 Correct 40 ms 8528 KB Output is correct
42 Incorrect 57 ms 9300 KB Output isn't correct
43 Incorrect 46 ms 8836 KB Output isn't correct
44 Incorrect 43 ms 8796 KB Output isn't correct
45 Incorrect 59 ms 10068 KB Output isn't correct
46 Incorrect 48 ms 9300 KB Output isn't correct
47 Incorrect 28 ms 6480 KB Output isn't correct
48 Incorrect 43 ms 8396 KB Output isn't correct
49 Incorrect 43 ms 8572 KB Output isn't correct
50 Incorrect 50 ms 9556 KB Output isn't correct
51 Incorrect 46 ms 8784 KB Output isn't correct
52 Correct 42 ms 8716 KB Output is correct
53 Incorrect 43 ms 8840 KB Output isn't correct
54 Incorrect 33 ms 7516 KB Output isn't correct
55 Incorrect 45 ms 9020 KB Output isn't correct
56 Incorrect 40 ms 8020 KB Output isn't correct
57 Incorrect 36 ms 7640 KB Output isn't correct
58 Incorrect 54 ms 9544 KB Output isn't correct
59 Incorrect 45 ms 8788 KB Output isn't correct
60 Incorrect 35 ms 7504 KB Output isn't correct
61 Correct 29 ms 7260 KB Output is correct
62 Incorrect 45 ms 8796 KB Output isn't correct
63 Incorrect 46 ms 8748 KB Output isn't correct
64 Incorrect 48 ms 8528 KB Output isn't correct
65 Incorrect 47 ms 8652 KB Output isn't correct
66 Correct 34 ms 6736 KB Output is correct
67 Correct 41 ms 8560 KB Output is correct
68 Incorrect 43 ms 8324 KB Output isn't correct
69 Incorrect 44 ms 8524 KB Output isn't correct
70 Correct 42 ms 8784 KB Output is correct
71 Incorrect 57 ms 9556 KB Output isn't correct
72 Incorrect 34 ms 7892 KB Output isn't correct
73 Incorrect 42 ms 8540 KB Output isn't correct
74 Correct 32 ms 7420 KB Output is correct
75 Incorrect 28 ms 7004 KB Output isn't correct
76 Correct 45 ms 8796 KB Output is correct
77 Incorrect 29 ms 6748 KB Output isn't correct
78 Incorrect 41 ms 8276 KB Output isn't correct
79 Incorrect 53 ms 9980 KB Output isn't correct
80 Incorrect 37 ms 7908 KB Output isn't correct
81 Correct 39 ms 8276 KB Output is correct
82 Incorrect 47 ms 9044 KB Output isn't correct
83 Incorrect 33 ms 7228 KB Output isn't correct
84 Incorrect 28 ms 6704 KB Output isn't correct
85 Incorrect 46 ms 8904 KB Output isn't correct
86 Incorrect 46 ms 9168 KB Output isn't correct
87 Incorrect 42 ms 8924 KB Output isn't correct
88 Incorrect 37 ms 8440 KB Output isn't correct
89 Incorrect 45 ms 8504 KB Output isn't correct
90 Incorrect 27 ms 6860 KB Output isn't correct
91 Correct 40 ms 8488 KB Output is correct
92 Incorrect 40 ms 8536 KB Output isn't correct
93 Incorrect 46 ms 8512 KB Output isn't correct
94 Incorrect 31 ms 7504 KB Output isn't correct
95 Correct 45 ms 9044 KB Output is correct
96 Incorrect 50 ms 9352 KB Output isn't correct
97 Correct 45 ms 8752 KB Output is correct
98 Incorrect 52 ms 9040 KB Output isn't correct
99 Correct 12 ms 5212 KB Output is correct
100 Incorrect 54 ms 9544 KB Output isn't correct
101 Incorrect 47 ms 9044 KB Output isn't correct
102 Incorrect 41 ms 8620 KB Output isn't correct