oj.uz

Submission #241665

# Submission time Handle Problem Language Result Execution time Memory
241665 2020-06-25T07:14:50 Z ChrisT Dango Maker (JOI18_dango_maker) C++17
33 / 100
 1184 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pib = pair<int,bool>;
using ll = long long;
using ld = long double;
#define all(x) (x).begin(),(x).end()
#ifdef fread_unlocked
#define fread fread_unlocked
#define fwrite fwrite_unlocked
#endif
#define mp make_pair
#define lc ind<<1
#define rc ind<<1|1
const int MN = 3e3+5, MOD = 1e9+7, BASE = 31, MASK = (1 << 13) - 1;
char grid[MN][MN]; int cnt[MN][MN];
inline int hsh (int a, int b, int c, int d) {return d | (c << 1) | (b << 14) | (a << 28);}
int main () {
	int n,m; set<int> st;
	scanf ("%d %d",&n,&m);
	for (int i = 1; i <= n; i++) {
		scanf ("%s",grid[i]+1);
		for (int j = 1; j <= m-2; j++) if (grid[i][j] == 'R' && grid[i][j+1] == 'G' && grid[i][j+2] == 'W') {
			cnt[i][j]=cnt[i][j+1]=cnt[i][j+2]=1;
		}
	}
	for (int j = 1; j <= m; j++) {
		for (int i = 1; i <= n-2; i++) if (grid[i][j] == 'R' && grid[i+1][j] == 'G' && grid[i+2][j] == 'W') {
			++cnt[i][j];++cnt[i+1][j];++cnt[i+2][j];st.insert(hsh(cnt[i][j]+cnt[i+1][j]+cnt[i+2][j],i,j,1));
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m-2; j++) if (grid[i][j]=='R'&&grid[i][j+1]=='G'&&grid[i][j+2]=='W') {
			st.insert(hsh(cnt[i][j]+cnt[i][j+1]+cnt[i][j+2],i,j,0));
		}
	}
	auto del1 = [&] (int x, int y) {
		auto it = st.find(hsh(cnt[x][y]+cnt[x][y+1]+cnt[x][y+2],x,y,0));
		if (it != st.end()) {
			st.erase(it);
			--cnt[x][y];--cnt[x][y+1];--cnt[x][y+2];
			if (cnt[x][y]) {
				it = st.find(hsh(2+cnt[x+1][y]+cnt[x+2][y],x,y,1));
				if (it != st.end()) {
					st.erase(it);
					st.insert(hsh(1+cnt[x+1][y]+cnt[x+2][y],x,y,1));
				}
			}
			if (cnt[x][y+1]) {
				it = st.find(hsh(cnt[x-1][y+1]+2+cnt[x+1][y+1],x-1,y+1,1));
				if (it != st.end()) {
					st.erase(it);
					st.insert(hsh(cnt[x-1][y+1]+1+cnt[x+1][y+1],x-1,y+1,1));
				}
			}
			if (cnt[x][y+2]) {
				it = st.find(hsh(cnt[x-2][y+2]+cnt[x-1][y+2]+2,x-2,y+2,1));
				if (it != st.end()) {
					st.erase(it);
					st.insert(hsh(cnt[x-2][y+2]+cnt[x-1][y+2]+1,x-2,y+2,1));
				}
			}
		}
	};
	auto del2 = [&] (int x, int y) {
		auto it = st.find(hsh(cnt[x][y]+cnt[x+1][y]+cnt[x+2][y],x,y,1));
		if (it != st.end()) {
			st.erase(it);
			--cnt[x][y]; --cnt[x+1][y]; --cnt[x+2][y];
			if (cnt[x][y]) {
				it = st.find(hsh(2+cnt[x][y+1]+cnt[x][y+2],x,y,0));
				if (it != st.end()) {
					st.erase(it);
					st.insert(hsh(1+cnt[x][y+1]+cnt[x][y+2],x,y,0));
				}
			}
			if (cnt[x+1][y]) {
				it = st.find(hsh(cnt[x+1][y-1]+2+cnt[x+1][y+1],x+1,y-1,0));
				if (it != st.end()) {
					st.erase(it);
					st.insert(hsh(cnt[x+1][y-1]+1+cnt[x+1][y+1],x+1,y-1,0));
				}
			}
			if (cnt[x+2][y]) {
				it = st.find(hsh(cnt[x+2][y-2]+cnt[x+2][y-1]+2,x+2,y-2,0));
				if (it != st.end()) {
					st.erase(it);
					st.insert(hsh(cnt[x+2][y-2]+cnt[x+2][y-1]+1,x+2,y-2,0));
				}
			}
		} 
	};
	int ret = 0;
	while (!st.empty()) {
		int cur = *st.begin(); st.erase(st.begin()); ++ret;
		int x = (cur>>14)&MASK, y = (cur>>1)&MASK;
		if (cur&1) {
			if (cnt[x][y]==2) del1(x,y);
			if (cnt[x+1][y]==2) del1(x+1,y-1);
			if (cnt[x+2][y]==2) del1(x+2,y-2);
		} else {
			if (cnt[x][y] == 2) del2(x,y);
			if (cnt[x][y+1] == 2) del2(x-1,y+1);
			if (cnt[x][y+2] == 2) del2(x-2,y+2);
		}
	}
	printf("%d\n",ret);
	return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:20:8: 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:22:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%s",grid[i]+1);
   ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 416 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 4 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 9 ms 10496 KB Output is correct
56 Correct 6 ms 588 KB Output is correct
57 Correct 13 ms 14464 KB Output is correct
58 Correct 69 ms 15608 KB Output is correct
59 Correct 749 ms 77176 KB Output is correct
60 Correct 801 ms 77312 KB Output is correct
61 Correct 837 ms 77192 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 741 ms 76184 KB Output is correct
64 Runtime error 1184 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
65 Halted 0 ms 0 KB -