Submission #625114

#TimeUsernameProblemLanguageResultExecution timeMemory
625114alexander707070Seats (IOI18_seats)C++14
11 / 100
4073 ms40756 KiB
#include<bits/stdc++.h> #define MAXN 1000007 using namespace std; int n,m; pair<int,int> pos[MAXN]; int check(){ int minx=n+1,maxx=0,miny=m+1,maxy=0,res=0; for(int i=0;i<n*m;i++){ minx=min(minx,pos[i].first); maxx=max(maxx,pos[i].first); miny=min(miny,pos[i].second); maxy=max(maxy,pos[i].second); if((maxx-minx+1)*(maxy-miny+1)==i+1)res++; } return res; } 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++){ pos[i]={R[i],C[i]}; } } int swap_seats(int a, int b){ swap(pos[a],pos[b]); return check(); } /* int main(){ give_initial_chart(2,3,{0,1,1,0,0,1},{0,0,1,1,2,2}); cout<<swap_seats(0,5)<<"\n"; cout<<swap_seats(0,5)<<"\n"; } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...