# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255569 | tleontest1 | Dango Maker (JOI18_dango_maker) | C++17 | 0 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 5005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int ans;
char c[li][li];
string s;
vector<int> v;
int main(void){
scanf("%d %d",&n,&m);
FOR{
for(int j=1;j<=m;j++){
scanf(" %c",&c[i][j]);
}
}
FOR{
for(int j=3;j<=m;j++){
if(c[i][j]=='W' && c[i][j-1]=='G' && c[i][j-2]=='R')ans++;
}
}
for(int j=1;j<=m;j++){
for(int i=3;i<=n;i++){
if(c[i][j]=='W' && c[i-1][j]=='G' && c[i-2][j]=='R')ans++;
}
}
printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |