This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;
int n,m,minx,miny,maxx,maxy;
pair<int,int> w[MAXN];
void give_initial_chart(int H, int W,vector<int> R,vector<int> C){
n=H; m=W;
for(int i=0;i<n*m;i++){
w[i]={R[i],C[i]};
}
}
int swap_seats(int x,int y){
swap(w[x],w[y]);
int ans=0;
minx=miny=n+m;
maxx=maxy=-1;
for(int i=0;i<n*m;i++){
minx=min(minx,w[i].first);
maxx=max(maxx,w[i].first);
miny=min(miny,w[i].second);
maxy=max(maxy,w[i].second);
if((maxx-minx+1)*(maxy-miny+1)==i+1)ans++;
}
return ans;
}
/*
int main(){
give_initial_chart(2, 3, {0, 1, 1, 0, 0, 1}, {0, 0, 1,1, 2, 2});
cout<<swap_seats(0, 5)<<" "<<swap_seats(0, 5)<<"\n";
}
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |