oj.uz

Submission #708719

# Submission time Handle Problem Language Result Execution time Memory
708719 2023-03-12T08:35:44 Z myrcella Dango Maker (JOI18_dango_maker) C++17
13 / 100
 2000 ms 340 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

int n,m;
int grid[5][5];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	memset(grid,-1,sizeof(grid));
	rep(i,0,n) {
		string s;cin>>s;
		rep(j,0,m) {
			if (s[j]=='R') grid[i][j]=0;
			else if (s[j]=='G') grid[i][j]=1;
			else grid[i][j]=2;
		}
	}
	int ans = 0;
	rep(mask,0,(1<<(n*m))) {
		int cur=0;
		rep(i,0,n)	
			rep(j,0,m) {
				if ( ((mask>>(i*m+j))&1) and grid[i][j]==0 and ((mask>>(i*m+j+1))&1) and grid[i][j+1]==1 and ((mask>>(i*m+j+2))&1) and grid[i][j+2]==2 ) cur++;
				if ( ((mask>>(i*m+j))&1)==0 and grid[i][j]==0 and ((mask>>(i*m+m+j))&1)==0 and grid[i+1][j]==1 and ((mask>>(i*m+m+m+j))&1)==0 and grid[i+2][j]==2 ) cur++;
			}
		ans=max(ans,cur);
	}
	cout<<ans;
	return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 212 KB Output is correct
6 Correct 6 ms 316 KB Output is correct
7 Correct 6 ms 320 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 6 ms 324 KB Output is correct
12 Correct 6 ms 320 KB Output is correct
13 Correct 6 ms 320 KB Output is correct
14 Correct 5 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct
16 Correct 6 ms 212 KB Output is correct
17 Execution timed out 2067 ms 212 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 212 KB Output is correct
6 Correct 6 ms 316 KB Output is correct
7 Correct 6 ms 320 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 6 ms 324 KB Output is correct
12 Correct 6 ms 320 KB Output is correct
13 Correct 6 ms 320 KB Output is correct
14 Correct 5 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct
16 Correct 6 ms 212 KB Output is correct
17 Execution timed out 2067 ms 212 KB Time limit exceeded
18 Halted 0 ms 0 KB -