oj.uz

Submission #41104

# Submission time Handle Problem Language Result Execution time Memory
41104 2018-02-12T18:53:02 Z abeker Dango Maker (JOI18_dango_maker) C++14
33 / 100
 45 ms 50108 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e3 + 5;
const int INF = 0x3f3f3f3f;

int N, M;
char mat[MAXN][MAXN];
vector <int> E[MAXN * MAXN];
int match[MAXN * MAXN], dist[MAXN * MAXN];
int hor[MAXN][MAXN], ver[MAXN][MAXN];
vector <int> lft, rig;

void load() {
	scanf("%d%d", &N, &M);
	for (int i = 0; i < N; i++)
		scanf("%s", mat[i]);
}

bool bfs() {
  queue <int> Q;
  for (auto it : lft)
    if (!match[it]) {
      dist[it] = 0;
      Q.push(it);
    }
    else 
			dist[it] = INF;
  
  dist[0] = INF;
  while (!Q.empty()) {
    int x = Q.front(); 
		Q.pop();
    if (!x)
    	continue;
    for (auto it : E[x]) 
      if (dist[match[it]] == INF) {
        dist[match[it]] = dist[x] + 1;
        Q.push(match[it]);
      }
  }
  
  return dist[0] != INF;
}

bool dfs(int x) {
  if (!x)
  	return true;
  for (auto it : E[x]) 
    if (dist[match[it]] == dist[x] + 1 && dfs(match[it])) {
      match[it] = x;
      match[x] = it;
      return true;
    }
  dist[x] = INF;
  return false;
}

int hopcroft_karp() {
  int matching = 0;
  while (bfs())
    for (auto it : lft)
      matching += !match[it] && dfs(it);
  return matching;
}

int get(int x, int y) {
	return M * x + y + 1;
}

void check_hor(int x, int y) {
	if (y > M - 3)
		return;
	for (int i = 0; i < 3; i++)
		if (mat[x][y + i] != "RGW"[i])
			return;
	lft.push_back(get(x, y));
	for (int i = 0; i < 3; i++)
		hor[x][y + i] = get(x, y);
}

void check_ver(int x, int y) {
	if (x > N - 3)
		return;
	for (int i = 0; i < 3; i++)
		if (mat[x + i][y] != "RGW"[i])
			return;
	rig.push_back(get(x, y));
	for (int i = 0; i < 3; i++)
		ver[x + i][y] = get(x, y);
}

int solve() {
	for (int i = 0; i < N; i++)
		for (int j = 0; j < M; j++) {
			check_hor(i, j);
			check_ver(i, j);
		}
	
	for (int i = 0; i < N; i++)
		for (int j = 0; j < M; j++)
			if (hor[i][j] && ver[i][j]) 
				E[hor[i][j]].push_back(ver[i][j]);
	
	return lft.size() + rig.size() - hopcroft_karp();
}

int main() {
	load();
	printf("%d\n", solve());
	return 0;
}

Compilation message

dango_maker.cpp: In function 'void load()':
dango_maker.cpp:15:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
                       ^
dango_maker.cpp:17:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", mat[i]);
                      ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24056 KB Output is correct
2 Correct 21 ms 24056 KB Output is correct
3 Correct 21 ms 24104 KB Output is correct
4 Correct 22 ms 24176 KB Output is correct
5 Correct 21 ms 24192 KB Output is correct
6 Correct 21 ms 24228 KB Output is correct
7 Correct 21 ms 24228 KB Output is correct
8 Correct 21 ms 24268 KB Output is correct
9 Correct 20 ms 24344 KB Output is correct
10 Correct 21 ms 24344 KB Output is correct
11 Correct 22 ms 24344 KB Output is correct
12 Correct 21 ms 24344 KB Output is correct
13 Correct 21 ms 24344 KB Output is correct
14 Correct 20 ms 24344 KB Output is correct
15 Correct 22 ms 24344 KB Output is correct
16 Correct 22 ms 24344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24056 KB Output is correct
2 Correct 21 ms 24056 KB Output is correct
3 Correct 21 ms 24104 KB Output is correct
4 Correct 22 ms 24176 KB Output is correct
5 Correct 21 ms 24192 KB Output is correct
6 Correct 21 ms 24228 KB Output is correct
7 Correct 21 ms 24228 KB Output is correct
8 Correct 21 ms 24268 KB Output is correct
9 Correct 20 ms 24344 KB Output is correct
10 Correct 21 ms 24344 KB Output is correct
11 Correct 22 ms 24344 KB Output is correct
12 Correct 21 ms 24344 KB Output is correct
13 Correct 21 ms 24344 KB Output is correct
14 Correct 20 ms 24344 KB Output is correct
15 Correct 22 ms 24344 KB Output is correct
16 Correct 22 ms 24344 KB Output is correct
17 Correct 20 ms 24344 KB Output is correct
18 Correct 22 ms 24344 KB Output is correct
19 Correct 21 ms 24344 KB Output is correct
20 Correct 21 ms 24428 KB Output is correct
21 Correct 22 ms 24428 KB Output is correct
22 Correct 20 ms 24544 KB Output is correct
23 Correct 25 ms 24544 KB Output is correct
24 Correct 20 ms 24544 KB Output is correct
25 Correct 21 ms 24544 KB Output is correct
26 Correct 20 ms 24544 KB Output is correct
27 Correct 23 ms 24556 KB Output is correct
28 Correct 21 ms 24556 KB Output is correct
29 Correct 21 ms 24556 KB Output is correct
30 Correct 21 ms 24556 KB Output is correct
31 Correct 21 ms 24556 KB Output is correct
32 Correct 22 ms 24556 KB Output is correct
33 Correct 21 ms 24556 KB Output is correct
34 Correct 23 ms 24556 KB Output is correct
35 Correct 21 ms 24556 KB Output is correct
36 Correct 21 ms 24556 KB Output is correct
37 Correct 21 ms 24556 KB Output is correct
38 Correct 23 ms 24556 KB Output is correct
39 Correct 19 ms 24556 KB Output is correct
40 Correct 21 ms 24556 KB Output is correct
41 Correct 20 ms 24556 KB Output is correct
42 Correct 21 ms 24556 KB Output is correct
43 Correct 20 ms 24556 KB Output is correct
44 Correct 22 ms 24556 KB Output is correct
45 Correct 20 ms 24556 KB Output is correct
46 Correct 21 ms 24556 KB Output is correct
47 Correct 21 ms 24556 KB Output is correct
48 Correct 22 ms 24556 KB Output is correct
49 Correct 21 ms 24556 KB Output is correct
50 Correct 20 ms 24556 KB Output is correct
51 Correct 21 ms 24556 KB Output is correct
52 Correct 20 ms 24556 KB Output is correct
53 Correct 23 ms 24556 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24056 KB Output is correct
2 Correct 21 ms 24056 KB Output is correct
3 Correct 21 ms 24104 KB Output is correct
4 Correct 22 ms 24176 KB Output is correct
5 Correct 21 ms 24192 KB Output is correct
6 Correct 21 ms 24228 KB Output is correct
7 Correct 21 ms 24228 KB Output is correct
8 Correct 21 ms 24268 KB Output is correct
9 Correct 20 ms 24344 KB Output is correct
10 Correct 21 ms 24344 KB Output is correct
11 Correct 22 ms 24344 KB Output is correct
12 Correct 21 ms 24344 KB Output is correct
13 Correct 21 ms 24344 KB Output is correct
14 Correct 20 ms 24344 KB Output is correct
15 Correct 22 ms 24344 KB Output is correct
16 Correct 22 ms 24344 KB Output is correct
17 Correct 20 ms 24344 KB Output is correct
18 Correct 22 ms 24344 KB Output is correct
19 Correct 21 ms 24344 KB Output is correct
20 Correct 21 ms 24428 KB Output is correct
21 Correct 22 ms 24428 KB Output is correct
22 Correct 20 ms 24544 KB Output is correct
23 Correct 25 ms 24544 KB Output is correct
24 Correct 20 ms 24544 KB Output is correct
25 Correct 21 ms 24544 KB Output is correct
26 Correct 20 ms 24544 KB Output is correct
27 Correct 23 ms 24556 KB Output is correct
28 Correct 21 ms 24556 KB Output is correct
29 Correct 21 ms 24556 KB Output is correct
30 Correct 21 ms 24556 KB Output is correct
31 Correct 21 ms 24556 KB Output is correct
32 Correct 22 ms 24556 KB Output is correct
33 Correct 21 ms 24556 KB Output is correct
34 Correct 23 ms 24556 KB Output is correct
35 Correct 21 ms 24556 KB Output is correct
36 Correct 21 ms 24556 KB Output is correct
37 Correct 21 ms 24556 KB Output is correct
38 Correct 23 ms 24556 KB Output is correct
39 Correct 19 ms 24556 KB Output is correct
40 Correct 21 ms 24556 KB Output is correct
41 Correct 20 ms 24556 KB Output is correct
42 Correct 21 ms 24556 KB Output is correct
43 Correct 20 ms 24556 KB Output is correct
44 Correct 22 ms 24556 KB Output is correct
45 Correct 20 ms 24556 KB Output is correct
46 Correct 21 ms 24556 KB Output is correct
47 Correct 21 ms 24556 KB Output is correct
48 Correct 22 ms 24556 KB Output is correct
49 Correct 21 ms 24556 KB Output is correct
50 Correct 20 ms 24556 KB Output is correct
51 Correct 21 ms 24556 KB Output is correct
52 Correct 20 ms 24556 KB Output is correct
53 Correct 23 ms 24556 KB Output is correct
54 Correct 21 ms 24556 KB Output is correct
55 Runtime error 45 ms 50108 KB Execution killed with signal 11 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -