0! 样例过了

B3662 [语言月赛202209] 山峰

@[sjz520](/user/767417) > 如果有一块土地,比上下左右直接相邻的土地海拔都高,我们称其为一个山峰。
by Jerrycyx @ 2022-11-10 20:38:30


@[Jerrycyx](/user/545986) 为什么还有2RE? ```cpp #include<bits/stdc++.h> using namespace std; int main(){ int a[1001][1001],n,m,t,x1[1001],x2[1001],y1[1001],y2[1001],s,sum; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; }} cin>>t; if(t==0){ }else{ for(int i=1;i<=t;i++){ cin>>x1[i]>>y1[i]>>x2[i]>>y2[i]; s=a[x1[i]][y1[i]]; a[x1[i]][y1[i]]=a[x2[i]][y2[i]]; a[x2[i]][y2[i]]=s; }} for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1]){ sum++; } }} cout<<sum<<endl;; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1]){ cout<<i<<" "<<j<<endl; } }} } ```
by Serendi_Pity @ 2022-11-10 20:47:09


```cpp #include<bits/stdc++.h> using namespace std; long long n,m,a[15005][15005],b[1005000],c[1000500],l=1,ans=0; int main() { cin>>n>>m; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j]; int t; cin>>t; while(t--) { int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2; swap(a[x1][y1],a[x2][y2]); } for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { if((j==1&&a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j+1])||(i==1&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1])||(i==1&&j==1&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j+1])||(a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1])) { ans++; b[l]=i; c[l++]=j; } } cout<<ans<<endl; for(int i=1;i<=ans;i++) cout<<b[i]<<" "<<c[i]<<endl; return 0; } ``` //求关注
by leoqing @ 2022-11-10 20:47:41


@[leoqing](/user/495133) 关注你妈呢傻*,从讨论区抄个代码你可真厉害,您这么强,写了道黑题,就是好像和题解长度一样呢- [https://www.luogu.com.cn/record/85170434](https://www.luogu.com.cn/record/85170434) 题解代码[https://www.luogu.com.cn/record/96076949](https://www.luogu.com.cn/record/96076949)
by 3blue1blue @ 2022-11-29 20:47:18


|