제출 #114339

#제출 시각아이디문제언어결과실행 시간메모리
114339tinjyu자리 배치 (IOI18_seats)C++14
0 / 100
4093 ms31636 KiB
#include "seats.h" #include <iostream> using namespace std; vector<int> r; long long int x[1000005],y[1000005],n; void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) { n=H*W; for(int i=0;i<n;i++) { x[i]=R[i]; y[i]=C[i]; } } int swap_seats(int a, int b) { swap(x[a],x[b]); swap(y[a],y[b]); int ans=1; long long int lx=x[0],rx=x[0],ly=y[0],ry=y[0]; for(int i=1;i<n;i++) { lx=min(x[i],lx); rx=max(x[i],rx); ly=min(y[i],ly); ry=max(y[i],ry); //cout<<i<<" "<<lx<<" "<<rx<<" "<<ly<<" "<<ry<<endl; //cout<<lx<<" "<<rx<<" "<<ly<<" "<<ry<<endl; if((rx-lx+1)*(ry-ly+1)==i+1)ans++; else i=(rx-lx+1)*(ry-ly+1)-2; } 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...