답안 #62247 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
62247	2018-07-27T23:38:50 Z	qkxwsm	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	678 ms	18932 KB

dango_maker

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
    int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
    	return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using hashtable = gp_hash_table<T, T, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 3013
#define MAXM 11000013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, M, K, E = 2;
int S, T;
short grid[MAXN][MAXN];
int ok[MAXN][2];
bool color[MAXM];
int lvl[MAXN];
int to[MAXM], cap[MAXM], nxt[MAXM], head[MAXM];
int ans;

void addedge(int u, int v, int f)
{
    to[E] = v; cap[E] = f;
    nxt[E] = head[u]; head[u] = E;
    E++;
    to[E] = u; cap[E] = 0;
    nxt[E] = head[v]; head[v] = E;
    E++;
}
bool bfs(int m)
{
    for (int i = 0; i < K; i++)
    {
        lvl[i] = -1;
    }
    queue<int> q;
    lvl[S] = 0;
    q.push(S);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        for (int e = head[u]; e; e = nxt[e])
        {
            int v = to[e];
            if (cap[e] >= m && lvl[v] == -1)
            {
                lvl[v] = lvl[u] + 1;
                q.push(v);
                if (v == T)
                {
                    return true;
                }
            }
        }
    }
    return false;
}
int aug(int u, int f)
{
    if (u == T)
    {
        return f;
    }
    int rem = f, gain = 0;
    for (int e = head[u]; e; e = nxt[e])
    {
        int v = to[e];
        if (cap[e] && lvl[v] == lvl[u] + 1)
        {
            gain = aug(v, min(rem, cap[e]));
            cap[e] -= gain;
			cap[e ^ 1] += gain;
			rem -= gain;
        }
    }
    return f - rem;
}
int dinic()
{
    int res = 0;
    while(bfs(1))
    {
        res += aug(S, INF);
    }
    return res;
}
int matching()
{
    S = K; T = K + 1;
    for (int i = 0; i < K; i++)
    {
        if (color[i])
        {
            addedge(i, T, 1);
        }
        else
        {
            addedge(S, i, 1);
        }
    }
    K += 2;
    int res = dinic();
    return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
    cin >> N >> M;
    for (int i = 0; i < N; i++)
    {
        string temps;
        cin >> temps;
        for (int j = 0; j < M; j++)
        {
            if (temps[j] == 'R')
            {
                grid[i][j] = -1;
            }
            if (temps[j] == 'G')
            {
                grid[i][j] = 0;
            }
            if (temps[j] == 'W')
            {
                grid[i][j] = 1;
            }
        }
    }
    for (int s = 0; s < N + M; s++)
    {
        for (int i = 0; i < N; i++)
        {
            int j = s - i;
            if (j < 0 || j >= M)
            {
                continue;
            }
            ok[i][0] = ok[i][1] = -1;
        }
        for (int i = 0; i < N; i++)
        {
            int j = s - i;
            if (j < 0 || j >= M)
            {
                continue;
            }
            if (grid[i][j] == -1 && grid[i][j + 1] == 0 && grid[i][j + 2] == 1)
            {
                ok[i][1] = K;
                color[K] = true;
                K++;
            }
            if (grid[i][j] == -1 && grid[i + 1][j] == 0 && grid[i + 2][j] == 1)
            {
                ok[i][0] = K;
                color[K] = false;
                K++;
            }
        }
        for (int i = 0; i < N; i++)
        {
            int j = s - i;
            if (ok[i][0] == -1)
            {
                continue;
            }
            if (ok[i][1] != -1)
            {
                addedge(ok[i][0], ok[i][1], INF);
            }
            if (i + 1 < N && j - 1 >= 0 && ok[i + 1][1] != -1)
            {
                addedge(ok[i][0], ok[i + 1][1], INF);
            }
            if (i + 2 < N && j - 2 >= 0 && ok[i + 2][1] != -1)
            {
                addedge(ok[i][0], ok[i + 2][1], INF);
            }
        }
        ans += K;
        ans -= matching();
        E = 2;
        for (int i = 0; i < K; i++)
        {
            head[i] = 0;
        }
        K = 0;
    }
    cout << ans << '\n';
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

dango_maker.cpp: In function 'int32_t main()':
dango_maker.cpp:247:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:248:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	544 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	3 ms	680 KB	Output is correct
7	Correct	3 ms	680 KB	Output is correct
8	Correct	3 ms	680 KB	Output is correct
9	Correct	3 ms	680 KB	Output is correct
10	Correct	3 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	4 ms	680 KB	Output is correct
13	Correct	3 ms	680 KB	Output is correct
14	Correct	3 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	3 ms	680 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	544 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	3 ms	680 KB	Output is correct
7	Correct	3 ms	680 KB	Output is correct
8	Correct	3 ms	680 KB	Output is correct
9	Correct	3 ms	680 KB	Output is correct
10	Correct	3 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	4 ms	680 KB	Output is correct
13	Correct	3 ms	680 KB	Output is correct
14	Correct	3 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	3 ms	680 KB	Output is correct
17	Correct	3 ms	680 KB	Output is correct
18	Correct	2 ms	680 KB	Output is correct
19	Correct	3 ms	680 KB	Output is correct
20	Correct	2 ms	680 KB	Output is correct
21	Correct	3 ms	680 KB	Output is correct
22	Correct	4 ms	680 KB	Output is correct
23	Correct	3 ms	680 KB	Output is correct
24	Correct	3 ms	680 KB	Output is correct
25	Correct	3 ms	680 KB	Output is correct
26	Correct	2 ms	680 KB	Output is correct
27	Correct	3 ms	708 KB	Output is correct
28	Correct	3 ms	708 KB	Output is correct
29	Correct	2 ms	708 KB	Output is correct
30	Correct	2 ms	708 KB	Output is correct
31	Correct	3 ms	708 KB	Output is correct
32	Correct	2 ms	708 KB	Output is correct
33	Correct	3 ms	708 KB	Output is correct
34	Correct	3 ms	708 KB	Output is correct
35	Correct	3 ms	708 KB	Output is correct
36	Correct	2 ms	760 KB	Output is correct
37	Correct	3 ms	760 KB	Output is correct
38	Correct	2 ms	760 KB	Output is correct
39	Correct	3 ms	760 KB	Output is correct
40	Correct	3 ms	760 KB	Output is correct
41	Correct	3 ms	760 KB	Output is correct
42	Correct	3 ms	764 KB	Output is correct
43	Correct	3 ms	764 KB	Output is correct
44	Correct	3 ms	764 KB	Output is correct
45	Correct	2 ms	764 KB	Output is correct
46	Correct	3 ms	764 KB	Output is correct
47	Correct	3 ms	764 KB	Output is correct
48	Correct	3 ms	764 KB	Output is correct
49	Correct	3 ms	764 KB	Output is correct
50	Correct	3 ms	764 KB	Output is correct
51	Correct	2 ms	764 KB	Output is correct
52	Correct	2 ms	764 KB	Output is correct
53	Correct	2 ms	764 KB	Output is correct

Subtask #3
67.0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	544 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	3 ms	680 KB	Output is correct
7	Correct	3 ms	680 KB	Output is correct
8	Correct	3 ms	680 KB	Output is correct
9	Correct	3 ms	680 KB	Output is correct
10	Correct	3 ms	680 KB	Output is correct
11	Correct	2 ms	680 KB	Output is correct
12	Correct	4 ms	680 KB	Output is correct
13	Correct	3 ms	680 KB	Output is correct
14	Correct	3 ms	680 KB	Output is correct
15	Correct	2 ms	680 KB	Output is correct
16	Correct	3 ms	680 KB	Output is correct
17	Correct	3 ms	680 KB	Output is correct
18	Correct	2 ms	680 KB	Output is correct
19	Correct	3 ms	680 KB	Output is correct
20	Correct	2 ms	680 KB	Output is correct
21	Correct	3 ms	680 KB	Output is correct
22	Correct	4 ms	680 KB	Output is correct
23	Correct	3 ms	680 KB	Output is correct
24	Correct	3 ms	680 KB	Output is correct
25	Correct	3 ms	680 KB	Output is correct
26	Correct	2 ms	680 KB	Output is correct
27	Correct	3 ms	708 KB	Output is correct
28	Correct	3 ms	708 KB	Output is correct
29	Correct	2 ms	708 KB	Output is correct
30	Correct	2 ms	708 KB	Output is correct
31	Correct	3 ms	708 KB	Output is correct
32	Correct	2 ms	708 KB	Output is correct
33	Correct	3 ms	708 KB	Output is correct
34	Correct	3 ms	708 KB	Output is correct
35	Correct	3 ms	708 KB	Output is correct
36	Correct	2 ms	760 KB	Output is correct
37	Correct	3 ms	760 KB	Output is correct
38	Correct	2 ms	760 KB	Output is correct
39	Correct	3 ms	760 KB	Output is correct
40	Correct	3 ms	760 KB	Output is correct
41	Correct	3 ms	760 KB	Output is correct
42	Correct	3 ms	764 KB	Output is correct
43	Correct	3 ms	764 KB	Output is correct
44	Correct	3 ms	764 KB	Output is correct
45	Correct	2 ms	764 KB	Output is correct
46	Correct	3 ms	764 KB	Output is correct
47	Correct	3 ms	764 KB	Output is correct
48	Correct	3 ms	764 KB	Output is correct
49	Correct	3 ms	764 KB	Output is correct
50	Correct	3 ms	764 KB	Output is correct
51	Correct	2 ms	764 KB	Output is correct
52	Correct	2 ms	764 KB	Output is correct
53	Correct	2 ms	764 KB	Output is correct
54	Correct	4 ms	764 KB	Output is correct
55	Correct	88 ms	12812 KB	Output is correct
56	Correct	5 ms	12812 KB	Output is correct
57	Correct	49 ms	12812 KB	Output is correct
58	Correct	61 ms	12812 KB	Output is correct
59	Correct	394 ms	18692 KB	Output is correct
60	Correct	390 ms	18692 KB	Output is correct
61	Correct	388 ms	18692 KB	Output is correct
62	Correct	4 ms	18692 KB	Output is correct
63	Correct	438 ms	18692 KB	Output is correct
64	Correct	634 ms	18932 KB	Output is correct
65	Correct	566 ms	18932 KB	Output is correct
66	Correct	678 ms	18932 KB	Output is correct
67	Correct	323 ms	18932 KB	Output is correct
68	Correct	365 ms	18932 KB	Output is correct
69	Correct	347 ms	18932 KB	Output is correct
70	Correct	81 ms	18932 KB	Output is correct
71	Correct	94 ms	18932 KB	Output is correct
72	Correct	63 ms	18932 KB	Output is correct
73	Correct	64 ms	18932 KB	Output is correct
74	Correct	74 ms	18932 KB	Output is correct
75	Correct	88 ms	18932 KB	Output is correct
76	Correct	97 ms	18932 KB	Output is correct
77	Correct	71 ms	18932 KB	Output is correct
78	Correct	78 ms	18932 KB	Output is correct
79	Correct	74 ms	18932 KB	Output is correct
80	Correct	69 ms	18932 KB	Output is correct
81	Correct	92 ms	18932 KB	Output is correct
82	Correct	101 ms	18932 KB	Output is correct
83	Correct	72 ms	18932 KB	Output is correct
84	Correct	75 ms	18932 KB	Output is correct
85	Correct	78 ms	18932 KB	Output is correct
86	Correct	74 ms	18932 KB	Output is correct
87	Correct	79 ms	18932 KB	Output is correct
88	Correct	79 ms	18932 KB	Output is correct
89	Correct	88 ms	18932 KB	Output is correct
90	Correct	68 ms	18932 KB	Output is correct

답안 #62247

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 67.0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
67.0 / 67.0