Submission #1115570

#TimeUsernameProblemLanguageResultExecution timeMemory
1115570staszic_ojuzDango Maker (JOI18_dango_maker)C++17
0 / 100
1 ms336 KiB
#include <iostream> using namespace std; const int MAXN = 3001; int n, m; int tablica[MAXN][MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; char p1; for (int i = 0; n > i; i++) { for (int j = 0; m > j; j++) { cin >> p1; if (p1 == 'R') { tablica[i][j] = 1; } else if (p1 == 'G') { tablica[i][j] = 2; } else { tablica[i][j] = 3; } } } int wynik = 0; for (int i = 0; n > i; i++) { for (int j = 0; m > j; j++) { //czy poziomo if (((j + 2) < m) && tablica[i][j] == 1 && tablica[i][j + 1] == 2 && tablica[i][j + 2]) { if ((i > 0) && ((i + 1) < n) && tablica[i - 1][j + 1] == 1 && tablica[i][j + 1] == 2 && tablica[i + 1][j + 1] == 3) { wynik++; tablica[i - 1][j + 1] = 0; tablica[i][j + 1] = 0; tablica[i][j + 2] = 0; } else { wynik++; tablica[i][j] = 0; tablica[i][j + 1] = 0; tablica[i][j + 2] = 0; } } if ((i > 0) && (i + 1) < n && tablica[i - 1][j] == 1 && tablica[i][j] == 2 && tablica[i + 1][j]) { wynik++; tablica[i - 1][j + 1] = 0; tablica[i][j + 1] = 0; tablica[i][j + 2] = 0; } //czy pionowo } } cout << wynik; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...