Submission #940520

#	Time	Username	Problem	Language	Result	Execution time	Memory
940520		vjudge1	미술 수업 (IOI13_artclass)	C++17	Compilation error	0 ms	0 KiB

artclass

#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));
    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;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccnpPwv6.o: in function `main':
artclass.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccqZT2p2.o:grader.c:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status