Submission #1115615

#TimeUsernameProblemLanguageResultExecution timeMemory
1115615staszic_ojuzDango Maker (JOI18_dango_maker)C++17
13 / 100
1 ms508 KiB
#include <iostream> #include <vector> using namespace std; bool odw[3001][3001]; int main() { int64_t n,m; cin >> n >> m; int64_t wyn=0; vector<string> v(n); for (int64_t i=0; i<n; i++) cin >> v[i]; for (int64_t i=0; i<n; i++){ for (int64_t j=0; j<m; j++){ if (v[i][j]=='G' and v[max(i-1,int64_t(0))][j]=='R' and v[min(i+1,n-1)][j]=='W' and v[i][max(j-1,int64_t(0))]=='R' and v[i][min(j+1,m-1)]=='W' and !odw[i][j] and !odw[max(i-1,int64_t(0))][j] and !odw[min(i+1,n-1)][j] and !odw[i][max(j-1,int64_t(0))] and !odw[i][min(j+1,m-1)]){ odw[i][j]=odw[i+1][j]=odw[i][j+1]=1; wyn++; } else if (v[i][j]=='G' and v[i][max(j-1,int64_t(0))]=='R' and v[i][min(j+1,m-1)]=='W' and !odw[i][j] and !odw[i][max(j-1,int64_t(0))] and !odw[i][min(j+1,m-1)]){ odw[i][j]=odw[i][j-1]=odw[i][j+1]=1; wyn++; } else if (v[i][j]=='G' and v[max(i-1,int64_t(0))][j]=='R' and v[min(i+1,m-1)][j]=='W' and !odw[i][j] and !odw[max(i-1,int64_t(0))][j] and !odw[min(i+1,m-1)][j]){ odw[i][j]=odw[i-1][j]=odw[i+1][j]=1; wyn++; } } } cout << wyn; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...