oj.uz

Submission #330198

# Submission time Handle Problem Language Result Execution time Memory
330198 2020-11-24T06:41:13 Z Kevin_Zhang_TW Dango Maker (JOI18_dango_maker) C++17
0 / 100
 13 ms 23916 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T>
bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }
template<class T> 
bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U>
void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T>
void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 3005, MAX_M = MAX_N * MAX_N / 3 << 1;
char w[MAX_N][MAX_N];
int n, m, a, b;//, id[MAX_N][MAX_N];
bool valid (char a, char b, char c) { return a == 'R' && b == 'G' && c == 'W'; }
array<int,5> edge[MAX_M];
int ma[MAX_M], vist[MAX_M], deg[MAX_M];
int Time;
bool dfs(int x) {
	if (vist[x] == Time) return false;
	vist[x] = Time;
	for (int i = 0;i < deg[x];++i) {
		int u = edge[x][i];
		if (ma[u] == -1 || dfs(ma[u])) 
			return ma[u] = x, ma[x] = u, true;
	}
	return false;
}
int max_clique() {
	b += a;
	memset(ma, -1, sizeof(ma)); 
	int res = b;

	for (int i = 1;i <= a;++i)
		if (ma[i] == -1 && (Time = i, dfs(i)))
			--res;

	return res; 
}
using ip = int *;
int solve() {
	int **id = new ip[n + 1];
	for (int i = 1;i <= n;++i)
		id[i] = new int[m + 1]{};

	for (int i = 1;i <= n;++i)
		for (int j = 1;j <= m;++j) { 
			if (valid(w[i][j-1], w[i][j], w[i][j+1])) 
				id[i][j] = ++a; 
		} 

	for (int i = 1;i <= n;++i)
		for (int j = 1;j <= m;++j) { 
			if (valid(w[i-1][j], w[i][j], w[i+1][j])) {
				++b;
				for (int x : {id[i-1][j+1], id[i][j], id[i+1][j-1]})
					edge[x][deg[x]++] = (b + a);
			} 
		} 
	for (int i = 1;i <= n;++i)
		delete id[i];
	delete id;

	return max_clique(); 
}
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	for (int i = 1;i <= n;++i)
		cin >> w[i] + 1;

	cout << solve() << '\n';
}

Compilation message

dango_maker.cpp: In function 'int32_t main()':
dango_maker.cpp:80:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   80 |   cin >> w[i] + 1;
      |          ~~~~~^~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23916 KB Output is correct
2 Correct 13 ms 23916 KB Output is correct
3 Correct 13 ms 23916 KB Output is correct
4 Correct 13 ms 23916 KB Output is correct
5 Correct 13 ms 23916 KB Output is correct
6 Correct 13 ms 23916 KB Output is correct
7 Incorrect 12 ms 23916 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23916 KB Output is correct
2 Correct 13 ms 23916 KB Output is correct
3 Correct 13 ms 23916 KB Output is correct
4 Correct 13 ms 23916 KB Output is correct
5 Correct 13 ms 23916 KB Output is correct
6 Correct 13 ms 23916 KB Output is correct
7 Incorrect 12 ms 23916 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23916 KB Output is correct
2 Correct 13 ms 23916 KB Output is correct
3 Correct 13 ms 23916 KB Output is correct
4 Correct 13 ms 23916 KB Output is correct
5 Correct 13 ms 23916 KB Output is correct
6 Correct 13 ms 23916 KB Output is correct
7 Incorrect 12 ms 23916 KB Output isn't correct
8 Halted 0 ms 0 KB -