# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1211911 | Adeeb_obedo | Seats (IOI18_seats) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#define int long long
#define ld double
#define _1 first
#define _2 second
#define yes cout<<"Yes\n"
#define nah cout<<"No\n"
#define FFF ios_base::sync_with_stdio(0);cin.tie(0);
#define ipr pair<int,int>
#define ret return
#define intt int32_t
#define mid ((l+r)/2)
#define pb push_back
#define lll __int128
#include "seats.h"
using namespace std;
int tst, ts;
intt mo = 1e9+7, dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0};
int mul( int x, int y ) {
ret ( ( x % mo ) * ( y % mo ) ) % mo;
ret x*y;
}
int pwo( int x, int y ) {
int res = 1;
for( int i = 63; i + 1; i-- )
res = mul( res, res * ( ( 1ll << i )&y ? x : 1 ) );
ret res;
}
int dvii( int x, int y ) {
ret mul( x, pwo( y, mo - 2 ) );
}
int oo( char x ) {
ret ( int )x - '0';
}
int lgg( int x, int y ) {
int u = 0;
while( x ) {
u++;
x /= y;
}
ret u;
}
int mun( int x, int y ) {
while( x < y )x += mo;
ret ( x - y ) % mo;
}
int add( int x, int y ) {
ret x + y - ( mo * ( x + y >= mo ) );
ret x + y;
}
int lcm( int x, int y ) {
ret ( x * y ) / __gcd( x, y );
}
#define endl '\n';
const int M =1007, N = 1e6+ 7, N2 = 5e3 + 7, inf = 1e9 + 7;
intt sz,n,m,a[N],d[N],p1[N],p2[N],p3[N],p4[N],ans;
void give_initial_chart(intt nn,intt mm,vector<intt>c,vector<intt>b){
n=nn,m=mm;sz=n*m;
for(intt i=0;i<n*m;i++){
a[i]=p1[i]=p2[i]=c[i],d[i]=p3[i]=p4[i]=b[i];
if(i){
p1[i]=max(p1[i],p1[i-1]);
p3[i]=max(p3[i],p3[i-1]);
p2[i]=min(p2[i],p2[i-1]);
p4[i]=min(p4[i],p4[i-1]);
}
}
for(intt i=0;i<sz;i++){
ans+=((p1[i]-p2[i]+1)*(p3[i]-p4[i]+1)==i+1);
}
}
intt swap_seats(intt x,intt y){
if(y<x)
swap(x,y);
for(intt i=x;i<y;i++)
ans-=((p1[i]-p2[i]+1)*(p3[i]-p4[i]+1)==i+1);
swap(a[x],a[y]);
swap(d[x],d[y]);
for(intt i=x;i<y;i++){
p1[i]=p2[i]=a[i],p3[i]=p4[i]=d[i];
if(i){
p1[i]=max(p1[i],p1[i-1]);
p3[i]=max(p3[i],p3[i-1]);
p2[i]=min(p2[i],p2[i-1]);
p4[i]=min(p4[i],p4[i-1]);
}
ans+=((p1[i]-p2[i]+1)*(p3[i]-p4[i]+1)==i+1);
}
ret ans;
}
/*
void solve(){
}
intt main() {
FFF
// freopen("fcolor.in", "r", stdin);
// freopen("fcolor.out", "w", stdout);
tst = 1;
//cin >> tst;
for ( ts = 1; ts <= tst; ts++ ){
solve();
}
}*/
}*/