oj.uz

답안 #241668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241668 2020-06-25T08:01:14 Z ChrisT Dango Maker (JOI18_dango_maker) C++17
33 / 100
 711 ms 104444 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;
vector<int> cancer[7];
bitset<MN * 2 * MASK> done;
char grid[MN][MN]; int cnt[MN][MN];
inline int hsh (int a, int b, int c) {return c | (b << 1) | (a << 14);}
int main () {
	int n,m;
	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];cancer[cnt[i][j]+cnt[i+1][j]+cnt[i+2][j]].push_back(hsh(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') {
			cancer[cnt[i][j]+cnt[i][j+1]+cnt[i][j+2]].push_back(hsh(i,j,0));
		}
	}
	auto del1 = [&] (int x, int y) {
		if (!done.test(hsh(x,y,0))) {
			done.set(hsh(x,y,0));
			--cnt[x][y];--cnt[x][y+1];--cnt[x][y+2];
			if (cnt[x][y]) {
				if (!done.test(hsh(x,y,1))) {
					cancer[1+cnt[x+1][y]+cnt[x+2][y]].push_back(hsh(x,y,1));
				}
			}
			if (cnt[x][y+1]) {
				if (!done.test(hsh(x-1,y+1,1))) {
					cancer[cnt[x-1][y+1]+1+cnt[x+1][y+1]].push_back(hsh(x-1,y+1,1));
				}
			}
			if (cnt[x][y+2]) {
				if (!done.test(hsh(x-2,y+2,1))) {
					cancer[cnt[x-2][y+2]+cnt[x-1][y+2]+1].push_back(hsh(x-2,y+2,1));
				}
			}
		}
	};
	auto del2 = [&] (int x, int y) {
		if (!done.test(hsh(x,y,1))) {
			done.set(hsh(x,y,1));
			--cnt[x][y]; --cnt[x+1][y]; --cnt[x+2][y];
			if (cnt[x][y]) {
				if (!done.test(hsh(x,y,0))) {
					cancer[1+cnt[x][y+1]+cnt[x][y+2]].push_back(hsh(x,y,0));
				}
			}
			if (cnt[x+1][y]) {
				if (!done.test(hsh(x+1,y-1,0))) {
					cancer[cnt[x+1][y-1]+1+cnt[x+1][y+1]].push_back(hsh(x+1,y-1,0));
				}
			}
			if (cnt[x+2][y]) {
				if (!done.test(hsh(x+2,y-2,0))) {
					cancer[cnt[x+2][y-2]+cnt[x+2][y-1]+1].push_back(hsh(x+2,y-2,0));
				}
			}
		} 
	};
	auto getmin = [&] () {
		for (int i = 0; i < 7; i++) if (!cancer[i].empty()) {
			int ret = cancer[i].back();
			cancer[i].pop_back();
			return ret;
		}
		return -1;
	};
	int ret = 0, cur;
	while (~(cur=getmin())) {
		if (done.test(cur)) continue;
		done.set(cur); ++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:22: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:24: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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 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 4 ms 384 KB Output is correct
8 Correct 5 ms 416 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 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 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 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 4 ms 384 KB Output is correct
8 Correct 5 ms 416 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 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 4 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 536 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 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 4 ms 384 KB Output is correct
30 Correct 5 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 4 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 512 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 512 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 4 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 4 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 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 4 ms 384 KB Output is correct
8 Correct 5 ms 416 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 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 4 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 536 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 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 4 ms 384 KB Output is correct
30 Correct 5 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 4 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 512 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 512 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 4 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 4 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 10 ms 10880 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 15 ms 18176 KB Output is correct
58 Correct 43 ms 13556 KB Output is correct
59 Correct 343 ms 53988 KB Output is correct
60 Correct 338 ms 53988 KB Output is correct
61 Correct 361 ms 54192 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 339 ms 53988 KB Output is correct
64 Correct 647 ms 104200 KB Output is correct
65 Correct 639 ms 104444 KB Output is correct
66 Incorrect 711 ms 91544 KB Output isn't correct
67 Halted 0 ms 0 KB -