oj.uz

Submission #62228

# Submission time Handle Problem Language Result Execution time Memory
62228 2018-07-27T22:35:32 Z qkxwsm Dango Maker (JOI18_dango_maker) C++17
33 / 100
 982 ms 263168 KB 
/*
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

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;
int grid[MAXN][MAXN];
int ok[MAXN][MAXN][2];
bool color[MAXN * MAXN];
bool seen[MAXN * MAXN];
vector<int> edge[MAXN * MAXN];
int ans;
int match[MAXN * MAXN];
vector<int> seens;

bool dfs(int u)
{
    if (seen[u])
    {
        return false;
    }
    seen[u] = true;
    seens.PB(u);
    for (int v : edge[u])
    {
        if (match[v] == -1 || dfs(match[v]))
        {
            match[v] = u;
            return true;
        }
    }
    return false;
}
int matching()
{
    for (int i = 0; i < K; i++)
    {
        match[i] = -1;
    }
    int res = 0;
    for (int i = 0; i < K; i++)
    {
        if (color[i])
        {
            continue;
        }
        for (int x : seens)
        {
            seen[x] = false;
        }
        seens.clear();
        if (dfs(i))
        {
            res++;
        }
    }
    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;
            }
            ok[i][j][0] = -1;
            ok[i][j][1] = -1;
        }
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < M; j++)
        {
            if (grid[i][j] == -1 && grid[i][j + 1] == 0 && grid[i][j + 2] == 1)
            {
                ok[i][j][1] = K;
                // cerr << i << ' ' << j << " r " << K << endl;
                color[K] = true;
                K++;
            }
            if (grid[i][j] == -1 && grid[i + 1][j] == 0 && grid[i + 2][j] == 1)
            {
                // cerr << i << ' ' << j << " d " << K << endl;
                ok[i][j][0] = K;
                color[K] = false;
                K++;
            }
        }
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < M; j++)
        {
            if (ok[i][j][0] == -1)
            {
                continue;
            }
            for (int k = 0; k <= 2; k++)
            {
                if (i + k < 0 || i + k >= N)
                {
                    continue;
                }
                for (int m = -2; m <= 0; m++)
                {
                    if (j + m < 0 || j + m >= M)
                    {
                        continue;
                    }
                    if (ok[i + k][j + m][1] == -1)
                    {
                        continue;
                    }
                    // cerr << i << ' ' << j << ' ' << i + k << ' ' << j + m << endl;
                    edge[ok[i][j][0]].PB(ok[i + k][j + m][1]);
                    edge[ok[i + k][j + m][1]].PB(ok[i][j][0]);
                }
            }
        }
    }
    // for (int i = 0; i < K; i++)
    // {
    //     for (int v : edge[i])
    //     {
    //         cerr << i << ' ' << v << endl;
    //     }
    // }
    ans = K - matching();
    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:205: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:206: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

# Verdict Execution time Memory Grader output
1 Correct 189 ms 213664 KB Output is correct
2 Correct 190 ms 213664 KB Output is correct
3 Correct 191 ms 213712 KB Output is correct
4 Correct 196 ms 213712 KB Output is correct
5 Correct 211 ms 213712 KB Output is correct
6 Correct 198 ms 213724 KB Output is correct
7 Correct 237 ms 213768 KB Output is correct
8 Correct 231 ms 213768 KB Output is correct
9 Correct 232 ms 213768 KB Output is correct
10 Correct 239 ms 213784 KB Output is correct
11 Correct 224 ms 213796 KB Output is correct
12 Correct 237 ms 213864 KB Output is correct
13 Correct 208 ms 213868 KB Output is correct
14 Correct 244 ms 213948 KB Output is correct
15 Correct 242 ms 213948 KB Output is correct
16 Correct 190 ms 213948 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 213664 KB Output is correct
2 Correct 190 ms 213664 KB Output is correct
3 Correct 191 ms 213712 KB Output is correct
4 Correct 196 ms 213712 KB Output is correct
5 Correct 211 ms 213712 KB Output is correct
6 Correct 198 ms 213724 KB Output is correct
7 Correct 237 ms 213768 KB Output is correct
8 Correct 231 ms 213768 KB Output is correct
9 Correct 232 ms 213768 KB Output is correct
10 Correct 239 ms 213784 KB Output is correct
11 Correct 224 ms 213796 KB Output is correct
12 Correct 237 ms 213864 KB Output is correct
13 Correct 208 ms 213868 KB Output is correct
14 Correct 244 ms 213948 KB Output is correct
15 Correct 242 ms 213948 KB Output is correct
16 Correct 190 ms 213948 KB Output is correct
17 Correct 209 ms 213948 KB Output is correct
18 Correct 193 ms 213948 KB Output is correct
19 Correct 196 ms 213948 KB Output is correct
20 Correct 200 ms 213996 KB Output is correct
21 Correct 198 ms 213996 KB Output is correct
22 Correct 209 ms 213996 KB Output is correct
23 Correct 199 ms 213996 KB Output is correct
24 Correct 241 ms 214028 KB Output is correct
25 Correct 254 ms 214028 KB Output is correct
26 Correct 230 ms 214028 KB Output is correct
27 Correct 206 ms 214028 KB Output is correct
28 Correct 197 ms 214028 KB Output is correct
29 Correct 203 ms 214104 KB Output is correct
30 Correct 195 ms 214104 KB Output is correct
31 Correct 193 ms 214104 KB Output is correct
32 Correct 191 ms 214104 KB Output is correct
33 Correct 201 ms 214104 KB Output is correct
34 Correct 252 ms 214104 KB Output is correct
35 Correct 186 ms 214104 KB Output is correct
36 Correct 187 ms 214104 KB Output is correct
37 Correct 186 ms 214104 KB Output is correct
38 Correct 216 ms 214104 KB Output is correct
39 Correct 176 ms 214104 KB Output is correct
40 Correct 180 ms 214104 KB Output is correct
41 Correct 213 ms 214104 KB Output is correct
42 Correct 213 ms 214104 KB Output is correct
43 Correct 242 ms 214104 KB Output is correct
44 Correct 232 ms 214104 KB Output is correct
45 Correct 238 ms 214104 KB Output is correct
46 Correct 230 ms 214104 KB Output is correct
47 Correct 205 ms 214104 KB Output is correct
48 Correct 236 ms 214104 KB Output is correct
49 Correct 212 ms 214104 KB Output is correct
50 Correct 206 ms 214104 KB Output is correct
51 Correct 204 ms 214104 KB Output is correct
52 Correct 246 ms 214104 KB Output is correct
53 Correct 185 ms 214104 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 213664 KB Output is correct
2 Correct 190 ms 213664 KB Output is correct
3 Correct 191 ms 213712 KB Output is correct
4 Correct 196 ms 213712 KB Output is correct
5 Correct 211 ms 213712 KB Output is correct
6 Correct 198 ms 213724 KB Output is correct
7 Correct 237 ms 213768 KB Output is correct
8 Correct 231 ms 213768 KB Output is correct
9 Correct 232 ms 213768 KB Output is correct
10 Correct 239 ms 213784 KB Output is correct
11 Correct 224 ms 213796 KB Output is correct
12 Correct 237 ms 213864 KB Output is correct
13 Correct 208 ms 213868 KB Output is correct
14 Correct 244 ms 213948 KB Output is correct
15 Correct 242 ms 213948 KB Output is correct
16 Correct 190 ms 213948 KB Output is correct
17 Correct 209 ms 213948 KB Output is correct
18 Correct 193 ms 213948 KB Output is correct
19 Correct 196 ms 213948 KB Output is correct
20 Correct 200 ms 213996 KB Output is correct
21 Correct 198 ms 213996 KB Output is correct
22 Correct 209 ms 213996 KB Output is correct
23 Correct 199 ms 213996 KB Output is correct
24 Correct 241 ms 214028 KB Output is correct
25 Correct 254 ms 214028 KB Output is correct
26 Correct 230 ms 214028 KB Output is correct
27 Correct 206 ms 214028 KB Output is correct
28 Correct 197 ms 214028 KB Output is correct
29 Correct 203 ms 214104 KB Output is correct
30 Correct 195 ms 214104 KB Output is correct
31 Correct 193 ms 214104 KB Output is correct
32 Correct 191 ms 214104 KB Output is correct
33 Correct 201 ms 214104 KB Output is correct
34 Correct 252 ms 214104 KB Output is correct
35 Correct 186 ms 214104 KB Output is correct
36 Correct 187 ms 214104 KB Output is correct
37 Correct 186 ms 214104 KB Output is correct
38 Correct 216 ms 214104 KB Output is correct
39 Correct 176 ms 214104 KB Output is correct
40 Correct 180 ms 214104 KB Output is correct
41 Correct 213 ms 214104 KB Output is correct
42 Correct 213 ms 214104 KB Output is correct
43 Correct 242 ms 214104 KB Output is correct
44 Correct 232 ms 214104 KB Output is correct
45 Correct 238 ms 214104 KB Output is correct
46 Correct 230 ms 214104 KB Output is correct
47 Correct 205 ms 214104 KB Output is correct
48 Correct 236 ms 214104 KB Output is correct
49 Correct 212 ms 214104 KB Output is correct
50 Correct 206 ms 214104 KB Output is correct
51 Correct 204 ms 214104 KB Output is correct
52 Correct 246 ms 214104 KB Output is correct
53 Correct 185 ms 214104 KB Output is correct
54 Correct 198 ms 214104 KB Output is correct
55 Correct 233 ms 238116 KB Output is correct
56 Correct 187 ms 238116 KB Output is correct
57 Correct 237 ms 238116 KB Output is correct
58 Correct 246 ms 238116 KB Output is correct
59 Runtime error 982 ms 263168 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
60 Halted 0 ms 0 KB -