oj.uz

Submission #533195

# Submission time Handle Problem Language Result Execution time Memory
533195 2022-03-05T06:17:05 Z browntoad Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=3005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}

//=======================================================================================

char arr[maxn][maxn];
bool ma[maxn][maxn];
int n,m; 
int leftr(){
	int res=0;
	REP(i,n){
		REP(j,m-2){
			if (arr[i][j]=='R'&&arr[i][j+1]=='G'&&arr[i][j+2]=='W'){
				ma[i][j]=ma[i][j+1]=ma[i][j+2]=1;
				j+=2;
				res++;
			}
		}
	}
	REP(j,m){
		REP(i,n-2){
			if (arr[i][j]=='R'&&arr[i+1][j]=='G'&&arr[i+2][j]=='W'&&ma[i][j]+ma[i+1][j]+ma[i+2][j]==0){
				res++;
				i+=2;
			}
		}
	}
	return res;
}
int updow(){
	REP(i,n){
		REP(j,m){
			ma[i][j]=0;
		}
	}
	int res=0;
	REP(j,m){
		REP(i,n-2){
			if (arr[i][j]=='R'&&arr[i+1][j]=='G'&&arr[i+2][j]=='W'){
				ma[i][j]=ma[i+1][j]=ma[i+2][j]=1;
				res++;
				i+=2;
			}
		}
	}
	REP(i,n){
		REP(j,m-2){
			if (arr[i][j]=='R'&&arr[i][j+1]=='G'&&arr[i][j+2]=='W'&&ma[i][j]+ma[i][j+1]+ma[i][j+2]==0){
				j+=2;
				res++;
			}
		}
	}
	return res;
}
signed main (){
    IOS();
    cin>>n>>m;
    REP(i,n){
    	REP(j,m){
    		cin>>arr[i][j];
    	}
    }
    cout<<max(leftr(), updow())<<endl;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Incorrect 0 ms 332 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Incorrect 0 ms 332 KB Output isn't correct
21 Halted 0 ms 0 KB -