# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294439 | zoooma13 | Seats (IOI18_seats) | C++14 | 0 ms | 0 KiB |
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>
#include "seats.h"
#include "grader.cpp"
using namespace std;
#define MAX_N 1000006
#define pii pair<int ,int>
#define mxp first
#define mip second
#define FL p<<1
#define FR p<<1|1
int n;
int h ,w ,ans;
vector <int> cor[2] ,sat;
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
n = R.size();
h = H;
w = W;
sat.resize(n);
cor[0] = R;
cor[1] = C;
int mxR = 0 ,miR = H;
int mxC = 0 ,miC = W;
for(int i=0; i<R.size(); i++){
mxR = max(mxR ,R[i]);
miR = min(miR ,R[i]);
mxC = max(mxC ,C[i]);
miC = min(miC ,C[i]);
if((mxR-miR+1)*(mxC-miC+1) == i+1)
sat[i] = 1 ,ans++;
}
}
int swap_seats(int a, int b) {
swap(cor[0][a] ,cor[0][b]);
swap(cor[1][a] ,cor[1][b]);
int mxR = 0 ,miR = h;
int mxC = 0 ,miC = w;
for(int i=0; i<n; i++){
mxR = max(mxR ,cor[0][i]);
miR = min(miR ,cor[0][i]);
mxC = max(mxC ,cor[1][i]);
miC = min(miC ,cor[1][i]);
if((mxR-miR+1)*(mxC-miC+1) == i+1){
if(!sat[i]){ sat[i] = 1 ,ans++; }
}else{
if(sat[i]){ sat[i] = 0 ,ans--; }
}
}
return ans;
}