Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f ("boats.in");
- ofstream g ("boats.out");
- int n,m,i,j,a[1001][1001],l[1001],c[1001],cer,nrp,maxl,maxc;
- int main()
- {
- f >> cer >> n >> m;
- for(i=1; i<=n; i++)
- for(j=1; j<=m; j++) {
- f >> a[i][j];
- if(a[i][j]>0) {
- if(a[i-1][j]>0) {
- if(a[i-1][j]>1)c[a[i-1][j]]--;
- else nrp--;
- a[i][j]=a[i-1][j]+1;
- c[a[i][j]]++;
- maxc=max(a[i][j],maxc);
- }
- else if(a[i][j-1]>0) {
- if(a[i][j-1]>1)l[a[i][j-1]]--;
- else nrp--;
- a[i][j]=a[i][j-1]+1;
- l[a[i][j]]++;
- maxl=max(a[i][j],maxl);
- }
- else nrp++;
- }
- }
- if(cer==1) g << nrp;
- else {
- for(i=1; i<=maxl; i++) if(l[i]>0) g << "L " << i << " " << l[i] << "\n";
- for(i=1; i<=maxc; i++) if(c[i]>0) g << "C " << i << " " << c[i] << "\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement