Submission #443123

#TimeUsernameProblemLanguageResultExecution timeMemory
443123The_Panonian_SailorPaint (COI20_paint)C++14
0 / 100
368 ms524292 KiB
#include <iostream> int a[20][20]; using namespace std; void obojiSve(int a1, int b1, int c, int m, int n) { int poc=a[a1][b1]; a[a1][b1]=c; if(a[a1+1][b1]==poc && a1<n-1) { obojiSve(a1+1,b1,c, m, n); } if(a[a1-1][b1]==poc && a1>0) { obojiSve(a1-1,b1,c,m,n); } if(a[a1][b1+1]==poc && b1<m-1) { obojiSve(a1,b1+1,c,m,n); } if(a[a1][b1-1]==poc && b1>0) { obojiSve(a1,b1-1,c,m,n); } } int main() { int n,m; cin>>n>>m; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { cin>>a[i][j]; } } int q,a1,b1,c; cin>>q; for(int k=0; k<q; k++) { cin>>a1>>b1>>c; a1--;b1--; obojiSve(a1,b1,c,m,n); } for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { cout<<a[i][j]<<' '; } cout<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...