| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1289605 | omer_faruk_tuzun | Dango Maker (JOI18_dango_maker) | C++20 | 2 ms | 580 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,count=0;
cin>>n>>m;//n satır sayısı m sütun sayısı
char a [n][m];
for(int i=0;i<n;++i)
{
for(int j=0;j<m;++j)
{
cin>>a[i][j];
}
}
for(int i=0;i<n;++i)
{
for(int j=0;j<m-2;++j)
{
if (a[i][j]=='R'&&a[i][j+1]=='G'&&a[i][j+2]=='W')
{
++count;
a[i][j]=' ';
a[i][j+1]=' ';
a[i][j+2]=' ';
++j;
++j;
}
}
}
for(int j=0;j<m;++j)
{
for (int i=0;i<n-2;++i)
{
if(a[i][j]=='R'&&a[i+1][j]=='G'&&a[i+2][j]=='W')
{
++count;
++i;
++i;
}
}
}
cout<<count<<"\n";
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
