Submission #295853

#TimeUsernameProblemLanguageResultExecution timeMemory
295853daniel920712Seats (IOI18_seats)C++14
11 / 100
4070 ms39824 KiB
#include "seats.h" using namespace std; pair < int , int > all[1000005]; int N; void give_initial_chart(int H,int W,vector<int> R,vector<int> C) { int i; N=H*W; for(i=0;i<N;i++) all[i]=make_pair(R[i],C[i]); } int swap_seats(int a, int b) { int i; swap(all[a],all[b]); int u=all[0].first,d=all[0].first,l=all[0].second,r=all[0].second; int ans=0; for(i=0;i<N;i++) { d=max(d,all[i].first); u=min(u,all[i].first); r=max(r,all[i].second); l=min(l,all[i].second); if((r-l+1)*(d-u+1)==i+1) ans++; } return ans; }
#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...