Submission #1115652

#TimeUsernameProblemLanguageResultExecution timeMemory
1115652staszic_ojuzDango Maker (JOI18_dango_maker)C++17
13 / 100
1 ms336 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++){ //cout << i << ' ' << j << '\n'; if (v[i][j]=='R' and v[i][min(j+1,m-1)]=='G' and v[i][min(j+2,m-1)]=='W' and !odw[i][j] and !odw[i][min(j+1,n-1)] and !odw[i][min(j+2,m-1)]){ if (v[i][min(j+1,m-1)]=='G' and v[max(i-1,int64_t(0))][min(j+1,m-1)]=='R' and v[min(i+1,n-1)][min(j+1,m-1)]=='W' and !odw[i][min(j+1,m-1)] and !odw[max(i-1,int64_t(0))][min(j+1,m-1)] and !odw[min(i+1,n-1)][min(j+1,m-1)]){ odw[i][j]=odw[i-1][j]=odw[i+1][j]=1; wyn++; } else{ //cout << i << ' ' << j << '\n'; odw[i][j]=odw[i][j+1]=odw[i][j+2]=1; wyn++; } } else 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 !odw[i][j] and !odw[max(i-1,int64_t(0))][j] and !odw[min(i+1,n-1)][j]){ //cout << i << ' ' << j << '\n'; 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...